/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe027_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:37:24,693 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:37:24,695 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:37:24,742 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:37:24,743 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:37:24,745 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:37:24,755 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:37:24,759 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:37:24,763 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:37:24,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:37:24,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:37:24,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:37:24,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:37:24,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:37:24,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:37:24,771 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:37:24,771 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:37:24,772 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:37:24,773 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:37:24,775 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:37:24,780 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:37:24,781 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:37:24,782 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:37:24,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:37:24,788 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:37:24,790 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:37:24,790 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:37:24,791 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:37:24,792 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:37:24,792 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:37:24,792 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:37:24,794 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:37:24,795 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:37:24,796 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:37:24,797 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:37:24,797 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:37:24,797 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:37:24,798 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:37:24,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:37:24,798 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:37:24,799 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:37:24,800 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 09:37:24,837 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:37:24,837 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:37:24,839 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:37:24,839 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:37:24,839 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:37:24,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:37:24,840 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:37:24,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:37:24,841 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:37:24,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:37:24,841 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:37:24,842 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:37:24,842 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:37:24,842 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:37:24,842 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:37:24,842 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:37:24,842 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:37:24,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:37:24,843 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:37:24,843 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:37:24,843 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:37:24,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:37:24,843 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:37:24,843 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:37:24,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:37:24,844 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:37:24,844 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:37:24,844 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:37:24,844 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:37:24,844 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 09:37:25,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:37:25,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:37:25,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:37:25,169 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:37:25,170 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:37:25,171 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe027_power.opt.i [2022-12-13 09:37:26,384 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:37:26,609 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:37:26,610 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe027_power.opt.i [2022-12-13 09:37:26,625 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/868f2fbb0/0a8753794aa048a1ba6fd7e8ded2f343/FLAG8b301eabf [2022-12-13 09:37:26,639 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/868f2fbb0/0a8753794aa048a1ba6fd7e8ded2f343 [2022-12-13 09:37:26,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:37:26,642 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:37:26,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:37:26,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:37:26,646 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:37:26,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:37:26" (1/1) ... [2022-12-13 09:37:26,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2583fc5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:26, skipping insertion in model container [2022-12-13 09:37:26,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:37:26" (1/1) ... [2022-12-13 09:37:26,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:37:26,703 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:37:26,825 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/safe027_power.opt.i[994,1007] [2022-12-13 09:37:27,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:37:27,103 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:37:27,116 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/safe027_power.opt.i[994,1007] [2022-12-13 09:37:27,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:27,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:27,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:37:27,205 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:37:27,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:27 WrapperNode [2022-12-13 09:37:27,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:37:27,208 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:37:27,208 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:37:27,208 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:37:27,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:27" (1/1) ... [2022-12-13 09:37:27,232 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:27" (1/1) ... [2022-12-13 09:37:27,254 INFO L138 Inliner]: procedures = 177, calls = 88, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 194 [2022-12-13 09:37:27,254 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:37:27,255 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:37:27,255 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:37:27,255 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:37:27,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:27" (1/1) ... [2022-12-13 09:37:27,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:27" (1/1) ... [2022-12-13 09:37:27,268 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:27" (1/1) ... [2022-12-13 09:37:27,269 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:27" (1/1) ... [2022-12-13 09:37:27,280 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:27" (1/1) ... [2022-12-13 09:37:27,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:27" (1/1) ... [2022-12-13 09:37:27,286 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:27" (1/1) ... [2022-12-13 09:37:27,287 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:27" (1/1) ... [2022-12-13 09:37:27,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:37:27,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:37:27,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:37:27,292 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:37:27,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:27" (1/1) ... [2022-12-13 09:37:27,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:37:27,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:37:27,327 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 09:37:27,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 09:37:27,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 09:37:27,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:37:27,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:37:27,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:37:27,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:37:27,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:37:27,395 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:37:27,395 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:37:27,395 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:37:27,396 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:37:27,396 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 09:37:27,396 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 09:37:27,396 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 09:37:27,396 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 09:37:27,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:37:27,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:37:27,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:37:27,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:37:27,398 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 09:37:27,597 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:37:27,599 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:37:28,089 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:37:28,360 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:37:28,361 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:37:28,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:37:28 BoogieIcfgContainer [2022-12-13 09:37:28,368 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:37:28,370 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:37:28,370 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:37:28,373 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:37:28,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:37:26" (1/3) ... [2022-12-13 09:37:28,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a123fed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:37:28, skipping insertion in model container [2022-12-13 09:37:28,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:27" (2/3) ... [2022-12-13 09:37:28,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a123fed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:37:28, skipping insertion in model container [2022-12-13 09:37:28,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:37:28" (3/3) ... [2022-12-13 09:37:28,375 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_power.opt.i [2022-12-13 09:37:28,390 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:37:28,391 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 09:37:28,391 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:37:28,462 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:37:28,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 146 transitions, 312 flow [2022-12-13 09:37:28,577 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2022-12-13 09:37:28,578 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:37:28,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2022-12-13 09:37:28,583 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 146 transitions, 312 flow [2022-12-13 09:37:28,589 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 142 transitions, 296 flow [2022-12-13 09:37:28,590 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:28,609 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 142 transitions, 296 flow [2022-12-13 09:37:28,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 296 flow [2022-12-13 09:37:28,645 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2022-12-13 09:37:28,646 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:37:28,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2022-12-13 09:37:28,654 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 142 transitions, 296 flow [2022-12-13 09:37:28,654 INFO L226 LiptonReduction]: Number of co-enabled transitions 2664 [2022-12-13 09:37:42,146 INFO L241 LiptonReduction]: Total number of compositions: 119 [2022-12-13 09:37:42,160 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:37:42,165 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@66c730a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:37:42,165 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 09:37:42,170 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2022-12-13 09:37:42,170 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:37:42,170 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:42,171 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 09:37:42,171 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:37:42,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:42,176 INFO L85 PathProgramCache]: Analyzing trace with hash 955749799, now seen corresponding path program 1 times [2022-12-13 09:37:42,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:42,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491320213] [2022-12-13 09:37:42,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:42,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:37:42,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:37:42,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:37:42,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491320213] [2022-12-13 09:37:42,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491320213] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:37:42,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:37:42,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:37:42,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823032292] [2022-12-13 09:37:42,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:37:42,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:37:42,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:37:42,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:37:42,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:37:42,609 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 74 [2022-12-13 09:37:42,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 74 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:42,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:37:42,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 74 [2022-12-13 09:37:42,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:37:52,724 INFO L130 PetriNetUnfolder]: 57424/80529 cut-off events. [2022-12-13 09:37:52,724 INFO L131 PetriNetUnfolder]: For 133/133 co-relation queries the response was YES. [2022-12-13 09:37:52,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156682 conditions, 80529 events. 57424/80529 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 3923. Compared 572683 event pairs, 15118 based on Foata normal form. 0/50392 useless extension candidates. Maximal degree in co-relation 156670. Up to 63597 conditions per place. [2022-12-13 09:37:53,002 INFO L137 encePairwiseOnDemand]: 69/74 looper letters, 44 selfloop transitions, 2 changer transitions 64/122 dead transitions. [2022-12-13 09:37:53,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 122 transitions, 482 flow [2022-12-13 09:37:53,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:37:53,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:37:53,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2022-12-13 09:37:53,014 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6801801801801802 [2022-12-13 09:37:53,016 INFO L175 Difference]: Start difference. First operand has 86 places, 74 transitions, 160 flow. Second operand 3 states and 151 transitions. [2022-12-13 09:37:53,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 122 transitions, 482 flow [2022-12-13 09:37:53,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 122 transitions, 476 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 09:37:53,024 INFO L231 Difference]: Finished difference. Result has 82 places, 39 transitions, 90 flow [2022-12-13 09:37:53,026 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=82, PETRI_TRANSITIONS=39} [2022-12-13 09:37:53,030 INFO L295 CegarLoopForPetriNet]: 86 programPoint places, -4 predicate places. [2022-12-13 09:37:53,030 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:37:53,031 INFO L89 Accepts]: Start accepts. Operand has 82 places, 39 transitions, 90 flow [2022-12-13 09:37:53,036 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:37:53,037 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:53,037 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 39 transitions, 90 flow [2022-12-13 09:37:53,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 39 transitions, 90 flow [2022-12-13 09:37:53,048 INFO L130 PetriNetUnfolder]: 0/39 cut-off events. [2022-12-13 09:37:53,048 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:37:53,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 96 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 09:37:53,052 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 39 transitions, 90 flow [2022-12-13 09:37:53,052 INFO L226 LiptonReduction]: Number of co-enabled transitions 878 [2022-12-13 09:37:53,389 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:37:53,391 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 361 [2022-12-13 09:37:53,391 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 90 flow [2022-12-13 09:37:53,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:53,391 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:53,392 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:37:53,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:37:53,392 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:37:53,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:53,393 INFO L85 PathProgramCache]: Analyzing trace with hash -2124037410, now seen corresponding path program 1 times [2022-12-13 09:37:53,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:53,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859266624] [2022-12-13 09:37:53,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:53,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:37:53,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:37:53,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:37:53,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859266624] [2022-12-13 09:37:53,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859266624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:37:53,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:37:53,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:37:53,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386712223] [2022-12-13 09:37:53,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:37:53,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:37:53,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:37:53,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:37:53,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:37:53,697 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2022-12-13 09:37:53,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:53,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:37:53,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2022-12-13 09:37:53,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:37:55,319 INFO L130 PetriNetUnfolder]: 7639/10948 cut-off events. [2022-12-13 09:37:55,319 INFO L131 PetriNetUnfolder]: For 534/534 co-relation queries the response was YES. [2022-12-13 09:37:55,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22124 conditions, 10948 events. 7639/10948 cut-off events. For 534/534 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 61196 event pairs, 2304 based on Foata normal form. 125/8971 useless extension candidates. Maximal degree in co-relation 22114. Up to 9024 conditions per place. [2022-12-13 09:37:55,398 INFO L137 encePairwiseOnDemand]: 36/39 looper letters, 45 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2022-12-13 09:37:55,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 232 flow [2022-12-13 09:37:55,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:37:55,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:37:55,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-12-13 09:37:55,399 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2022-12-13 09:37:55,400 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 90 flow. Second operand 3 states and 84 transitions. [2022-12-13 09:37:55,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 232 flow [2022-12-13 09:37:55,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 59 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:37:55,402 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 94 flow [2022-12-13 09:37:55,402 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2022-12-13 09:37:55,403 INFO L295 CegarLoopForPetriNet]: 86 programPoint places, -35 predicate places. [2022-12-13 09:37:55,403 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:37:55,403 INFO L89 Accepts]: Start accepts. Operand has 51 places, 39 transitions, 94 flow [2022-12-13 09:37:55,404 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:37:55,404 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:55,404 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 39 transitions, 94 flow [2022-12-13 09:37:55,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 39 transitions, 94 flow [2022-12-13 09:37:55,412 INFO L130 PetriNetUnfolder]: 0/39 cut-off events. [2022-12-13 09:37:55,412 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:37:55,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 97 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 09:37:55,414 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 39 transitions, 94 flow [2022-12-13 09:37:55,414 INFO L226 LiptonReduction]: Number of co-enabled transitions 874 [2022-12-13 09:37:55,437 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:37:55,438 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-13 09:37:55,438 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 94 flow [2022-12-13 09:37:55,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:55,439 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:55,439 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:37:55,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:37:55,440 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:37:55,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:55,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1420651035, now seen corresponding path program 1 times [2022-12-13 09:37:55,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:55,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488086999] [2022-12-13 09:37:55,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:55,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:37:55,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:37:55,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:37:55,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488086999] [2022-12-13 09:37:55,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488086999] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:37:55,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:37:55,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:37:55,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011992205] [2022-12-13 09:37:55,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:37:55,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:37:55,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:37:55,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:37:55,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:37:55,656 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2022-12-13 09:37:55,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:55,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:37:55,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2022-12-13 09:37:55,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:37:57,605 INFO L130 PetriNetUnfolder]: 12880/18495 cut-off events. [2022-12-13 09:37:57,605 INFO L131 PetriNetUnfolder]: For 1361/1361 co-relation queries the response was YES. [2022-12-13 09:37:57,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37797 conditions, 18495 events. 12880/18495 cut-off events. For 1361/1361 co-relation queries the response was YES. Maximal size of possible extension queue 748. Compared 107721 event pairs, 2124 based on Foata normal form. 600/15514 useless extension candidates. Maximal degree in co-relation 37786. Up to 7817 conditions per place. [2022-12-13 09:37:57,685 INFO L137 encePairwiseOnDemand]: 35/39 looper letters, 50 selfloop transitions, 3 changer transitions 8/71 dead transitions. [2022-12-13 09:37:57,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 281 flow [2022-12-13 09:37:57,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:37:57,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:37:57,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-12-13 09:37:57,687 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6794871794871795 [2022-12-13 09:37:57,687 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 94 flow. Second operand 4 states and 106 transitions. [2022-12-13 09:37:57,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 281 flow [2022-12-13 09:37:57,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 275 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:37:57,693 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 102 flow [2022-12-13 09:37:57,693 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2022-12-13 09:37:57,694 INFO L295 CegarLoopForPetriNet]: 86 programPoint places, -32 predicate places. [2022-12-13 09:37:57,694 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:37:57,694 INFO L89 Accepts]: Start accepts. Operand has 54 places, 38 transitions, 102 flow [2022-12-13 09:37:57,695 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:37:57,695 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:57,695 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 38 transitions, 102 flow [2022-12-13 09:37:57,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 38 transitions, 102 flow [2022-12-13 09:37:57,701 INFO L130 PetriNetUnfolder]: 0/38 cut-off events. [2022-12-13 09:37:57,701 INFO L131 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2022-12-13 09:37:57,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 38 events. 0/38 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 99 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 09:37:57,702 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 38 transitions, 102 flow [2022-12-13 09:37:57,702 INFO L226 LiptonReduction]: Number of co-enabled transitions 756 [2022-12-13 09:37:57,749 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:37:57,750 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-13 09:37:57,750 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 102 flow [2022-12-13 09:37:57,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:57,751 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:57,751 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:37:57,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:37:57,751 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:37:57,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:57,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1090602146, now seen corresponding path program 1 times [2022-12-13 09:37:57,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:57,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769549755] [2022-12-13 09:37:57,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:57,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:37:57,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:37:57,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:37:57,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769549755] [2022-12-13 09:37:57,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769549755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:37:57,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:37:57,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:37:57,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476492008] [2022-12-13 09:37:57,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:37:57,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:37:57,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:37:57,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:37:57,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:37:57,981 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2022-12-13 09:37:57,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 38 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:57,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:37:57,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2022-12-13 09:37:57,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:37:59,059 INFO L130 PetriNetUnfolder]: 5460/8138 cut-off events. [2022-12-13 09:37:59,059 INFO L131 PetriNetUnfolder]: For 2880/2880 co-relation queries the response was YES. [2022-12-13 09:37:59,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17637 conditions, 8138 events. 5460/8138 cut-off events. For 2880/2880 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 47476 event pairs, 884 based on Foata normal form. 80/6587 useless extension candidates. Maximal degree in co-relation 17624. Up to 6437 conditions per place. [2022-12-13 09:37:59,126 INFO L137 encePairwiseOnDemand]: 35/38 looper letters, 41 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2022-12-13 09:37:59,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 54 transitions, 230 flow [2022-12-13 09:37:59,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:37:59,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:37:59,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-12-13 09:37:59,130 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6754385964912281 [2022-12-13 09:37:59,130 INFO L175 Difference]: Start difference. First operand has 53 places, 38 transitions, 102 flow. Second operand 3 states and 77 transitions. [2022-12-13 09:37:59,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 54 transitions, 230 flow [2022-12-13 09:37:59,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 54 transitions, 213 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 09:37:59,137 INFO L231 Difference]: Finished difference. Result has 52 places, 38 transitions, 98 flow [2022-12-13 09:37:59,137 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=52, PETRI_TRANSITIONS=38} [2022-12-13 09:37:59,139 INFO L295 CegarLoopForPetriNet]: 86 programPoint places, -34 predicate places. [2022-12-13 09:37:59,139 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:37:59,139 INFO L89 Accepts]: Start accepts. Operand has 52 places, 38 transitions, 98 flow [2022-12-13 09:37:59,141 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:37:59,141 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:59,141 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 38 transitions, 98 flow [2022-12-13 09:37:59,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 38 transitions, 98 flow [2022-12-13 09:37:59,151 INFO L130 PetriNetUnfolder]: 0/38 cut-off events. [2022-12-13 09:37:59,151 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 09:37:59,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 38 events. 0/38 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 96 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 09:37:59,152 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 38 transitions, 98 flow [2022-12-13 09:37:59,152 INFO L226 LiptonReduction]: Number of co-enabled transitions 752 [2022-12-13 09:37:59,303 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:37:59,304 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-13 09:37:59,305 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 98 flow [2022-12-13 09:37:59,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:59,305 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:59,305 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:37:59,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:37:59,305 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:37:59,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:59,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1321050631, now seen corresponding path program 1 times [2022-12-13 09:37:59,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:59,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206449606] [2022-12-13 09:37:59,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:59,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:37:59,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:37:59,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:37:59,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206449606] [2022-12-13 09:37:59,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206449606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:37:59,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:37:59,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:37:59,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950567322] [2022-12-13 09:37:59,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:37:59,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:37:59,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:37:59,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:37:59,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:37:59,624 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2022-12-13 09:37:59,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:59,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:37:59,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2022-12-13 09:37:59,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:01,368 INFO L130 PetriNetUnfolder]: 14009/19189 cut-off events. [2022-12-13 09:38:01,369 INFO L131 PetriNetUnfolder]: For 3228/3228 co-relation queries the response was YES. [2022-12-13 09:38:01,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42133 conditions, 19189 events. 14009/19189 cut-off events. For 3228/3228 co-relation queries the response was YES. Maximal size of possible extension queue 939. Compared 104879 event pairs, 4541 based on Foata normal form. 1116/13390 useless extension candidates. Maximal degree in co-relation 42121. Up to 15226 conditions per place. [2022-12-13 09:38:01,515 INFO L137 encePairwiseOnDemand]: 23/38 looper letters, 42 selfloop transitions, 13 changer transitions 41/103 dead transitions. [2022-12-13 09:38:01,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 103 transitions, 442 flow [2022-12-13 09:38:01,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:38:01,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:38:01,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2022-12-13 09:38:01,516 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7 [2022-12-13 09:38:01,516 INFO L175 Difference]: Start difference. First operand has 52 places, 38 transitions, 98 flow. Second operand 5 states and 133 transitions. [2022-12-13 09:38:01,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 103 transitions, 442 flow [2022-12-13 09:38:01,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 103 transitions, 432 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:38:01,520 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 211 flow [2022-12-13 09:38:01,521 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=211, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2022-12-13 09:38:01,521 INFO L295 CegarLoopForPetriNet]: 86 programPoint places, -29 predicate places. [2022-12-13 09:38:01,521 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:01,521 INFO L89 Accepts]: Start accepts. Operand has 57 places, 50 transitions, 211 flow [2022-12-13 09:38:01,522 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:01,523 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:01,523 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 50 transitions, 211 flow [2022-12-13 09:38:01,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 50 transitions, 211 flow [2022-12-13 09:38:01,677 INFO L130 PetriNetUnfolder]: 2025/3068 cut-off events. [2022-12-13 09:38:01,678 INFO L131 PetriNetUnfolder]: For 906/906 co-relation queries the response was YES. [2022-12-13 09:38:01,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8922 conditions, 3068 events. 2025/3068 cut-off events. For 906/906 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 19905 event pairs, 1296 based on Foata normal form. 0/1530 useless extension candidates. Maximal degree in co-relation 8910. Up to 2536 conditions per place. [2022-12-13 09:38:01,698 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 50 transitions, 211 flow [2022-12-13 09:38:01,698 INFO L226 LiptonReduction]: Number of co-enabled transitions 878 [2022-12-13 09:38:01,761 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:38:01,762 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 241 [2022-12-13 09:38:01,762 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 211 flow [2022-12-13 09:38:01,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:01,762 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:01,762 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:01,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:38:01,762 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:38:01,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:01,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1832000669, now seen corresponding path program 1 times [2022-12-13 09:38:01,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:01,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803079060] [2022-12-13 09:38:01,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:01,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:02,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:38:02,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:02,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803079060] [2022-12-13 09:38:02,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803079060] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:02,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:02,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:38:02,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942869240] [2022-12-13 09:38:02,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:02,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:38:02,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:02,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:38:02,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:38:02,068 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2022-12-13 09:38:02,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 211 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:02,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:02,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2022-12-13 09:38:02,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:03,610 INFO L130 PetriNetUnfolder]: 10463/14926 cut-off events. [2022-12-13 09:38:03,611 INFO L131 PetriNetUnfolder]: For 5889/5889 co-relation queries the response was YES. [2022-12-13 09:38:03,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50743 conditions, 14926 events. 10463/14926 cut-off events. For 5889/5889 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 86596 event pairs, 1607 based on Foata normal form. 1053/10702 useless extension candidates. Maximal degree in co-relation 50728. Up to 10324 conditions per place. [2022-12-13 09:38:03,707 INFO L137 encePairwiseOnDemand]: 23/38 looper letters, 52 selfloop transitions, 25 changer transitions 41/125 dead transitions. [2022-12-13 09:38:03,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 125 transitions, 765 flow [2022-12-13 09:38:03,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:38:03,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:38:03,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2022-12-13 09:38:03,709 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7105263157894737 [2022-12-13 09:38:03,709 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 211 flow. Second operand 6 states and 162 transitions. [2022-12-13 09:38:03,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 125 transitions, 765 flow [2022-12-13 09:38:04,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 125 transitions, 750 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 09:38:04,028 INFO L231 Difference]: Finished difference. Result has 61 places, 62 transitions, 396 flow [2022-12-13 09:38:04,028 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=396, PETRI_PLACES=61, PETRI_TRANSITIONS=62} [2022-12-13 09:38:04,029 INFO L295 CegarLoopForPetriNet]: 86 programPoint places, -25 predicate places. [2022-12-13 09:38:04,029 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:04,029 INFO L89 Accepts]: Start accepts. Operand has 61 places, 62 transitions, 396 flow [2022-12-13 09:38:04,030 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:04,030 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:04,030 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 62 transitions, 396 flow [2022-12-13 09:38:04,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 62 transitions, 396 flow [2022-12-13 09:38:04,181 INFO L130 PetriNetUnfolder]: 1809/2816 cut-off events. [2022-12-13 09:38:04,181 INFO L131 PetriNetUnfolder]: For 1926/2010 co-relation queries the response was YES. [2022-12-13 09:38:04,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12771 conditions, 2816 events. 1809/2816 cut-off events. For 1926/2010 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 18330 event pairs, 621 based on Foata normal form. 4/1428 useless extension candidates. Maximal degree in co-relation 12756. Up to 2308 conditions per place. [2022-12-13 09:38:04,201 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 62 transitions, 396 flow [2022-12-13 09:38:04,201 INFO L226 LiptonReduction]: Number of co-enabled transitions 1100 [2022-12-13 09:38:04,218 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:38:04,219 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-13 09:38:04,220 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 62 transitions, 396 flow [2022-12-13 09:38:04,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:04,220 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:04,220 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:04,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:38:04,220 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:38:04,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:04,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2077597970, now seen corresponding path program 1 times [2022-12-13 09:38:04,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:04,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923502776] [2022-12-13 09:38:04,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:04,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:06,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:38:06,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:06,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923502776] [2022-12-13 09:38:06,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923502776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:06,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:06,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 09:38:06,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045452116] [2022-12-13 09:38:06,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:06,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 09:38:06,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:06,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 09:38:06,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 09:38:06,714 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2022-12-13 09:38:06,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 62 transitions, 396 flow. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:06,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:06,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2022-12-13 09:38:06,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:08,119 INFO L130 PetriNetUnfolder]: 7373/10872 cut-off events. [2022-12-13 09:38:08,120 INFO L131 PetriNetUnfolder]: For 16641/18519 co-relation queries the response was YES. [2022-12-13 09:38:08,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47628 conditions, 10872 events. 7373/10872 cut-off events. For 16641/18519 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 65432 event pairs, 2290 based on Foata normal form. 178/8917 useless extension candidates. Maximal degree in co-relation 47610. Up to 9015 conditions per place. [2022-12-13 09:38:08,208 INFO L137 encePairwiseOnDemand]: 29/38 looper letters, 96 selfloop transitions, 12 changer transitions 0/127 dead transitions. [2022-12-13 09:38:08,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 127 transitions, 991 flow [2022-12-13 09:38:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:38:08,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:38:08,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2022-12-13 09:38:08,209 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.631578947368421 [2022-12-13 09:38:08,209 INFO L175 Difference]: Start difference. First operand has 59 places, 62 transitions, 396 flow. Second operand 6 states and 144 transitions. [2022-12-13 09:38:08,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 127 transitions, 991 flow [2022-12-13 09:38:08,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 127 transitions, 777 flow, removed 78 selfloop flow, removed 4 redundant places. [2022-12-13 09:38:08,584 INFO L231 Difference]: Finished difference. Result has 64 places, 73 transitions, 376 flow [2022-12-13 09:38:08,584 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=64, PETRI_TRANSITIONS=73} [2022-12-13 09:38:08,585 INFO L295 CegarLoopForPetriNet]: 86 programPoint places, -22 predicate places. [2022-12-13 09:38:08,585 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:08,585 INFO L89 Accepts]: Start accepts. Operand has 64 places, 73 transitions, 376 flow [2022-12-13 09:38:08,586 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:08,586 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:08,586 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 73 transitions, 376 flow [2022-12-13 09:38:08,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 73 transitions, 376 flow [2022-12-13 09:38:08,968 INFO L130 PetriNetUnfolder]: 4334/6475 cut-off events. [2022-12-13 09:38:08,968 INFO L131 PetriNetUnfolder]: For 4576/5053 co-relation queries the response was YES. [2022-12-13 09:38:08,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23345 conditions, 6475 events. 4334/6475 cut-off events. For 4576/5053 co-relation queries the response was YES. Maximal size of possible extension queue 909. Compared 44066 event pairs, 1247 based on Foata normal form. 11/3150 useless extension candidates. Maximal degree in co-relation 23328. Up to 5122 conditions per place. [2022-12-13 09:38:09,034 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 73 transitions, 376 flow [2022-12-13 09:38:09,034 INFO L226 LiptonReduction]: Number of co-enabled transitions 1424 [2022-12-13 09:38:09,932 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [952] $Ultimate##0-->L807: Formula: (and (= v_~x$w_buff0_used~0_437 1) (= v_~x$r_buff0_thd0~0_121 v_~x$r_buff1_thd0~0_123) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_7| |v_P1Thread1of1ForFork1_~arg#1.offset_7|) (= v_~x$r_buff0_thd3~0_155 v_~x$r_buff1_thd3~0_159) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_7| |v_P1Thread1of1ForFork1_~arg#1.base_7|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~x$r_buff1_thd2~0_88 v_~x$r_buff0_thd2~0_110) (= v_~x$r_buff1_thd4~0_74 v_~x$r_buff0_thd4~0_80) (= v_~x$w_buff0_used~0_438 v_~x$w_buff1_used~0_426) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| 0)) (= v_~x$w_buff0~0_210 v_~x$w_buff1~0_215) (= v_~x$w_buff0~0_209 1) (= v_~x$r_buff0_thd2~0_109 1) (= v_~x$r_buff1_thd1~0_94 v_~x$r_buff0_thd1~0_93) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_426 256) 0)) (not (= (mod v_~x$w_buff0_used~0_437 256) 0)))) 1 0))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_210, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_121, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_155, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_438, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_209, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_121, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_93, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_7|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_215, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_159, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_88, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_426, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_94, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_155, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_109, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_123, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_74, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_15|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_437, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$r_buff1_thd4~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] and [791] L860-->L867: Formula: (let ((.cse9 (= (mod v_~x$r_buff0_thd4~0_45 256) 0))) (let ((.cse11 (not (= (mod v_~x$w_buff0_used~0_240 256) 0))) (.cse1 (not .cse9)) (.cse6 (= (mod v_~x$r_buff1_thd4~0_37 256) 0)) (.cse7 (= (mod v_~x$w_buff1_used~0_229 256) 0)) (.cse8 (= (mod v_~x$w_buff0_used~0_241 256) 0))) (let ((.cse2 (not .cse8)) (.cse0 (select |v_#memory_int_208| |v_~#x~0.base_150|)) (.cse5 (not .cse7)) (.cse4 (not .cse6)) (.cse10 (and .cse11 .cse1))) (and (= (store |v_#memory_int_208| |v_~#x~0.base_150| (store .cse0 |v_~#x~0.offset_150| |v_P3_#t~ite35_29|)) |v_#memory_int_207|) (= (ite (and .cse1 .cse2) 0 v_~x$w_buff0_used~0_241) v_~x$w_buff0_used~0_240) (let ((.cse3 (= |v_P3_#t~mem33_34| |v_P3Thread1of1ForFork0_#t~mem33_1|))) (or (and (= |v_P3_#t~ite34_31| |v_P3Thread1of1ForFork0_#t~ite34_1|) (= |v_P3_#t~ite35_29| v_~x$w_buff0~0_81) .cse1 .cse3 .cse2) (and (or (and .cse4 (= |v_P3_#t~ite34_31| v_~x$w_buff1~0_90) .cse3 .cse5) (and (or .cse6 .cse7) (= (select .cse0 |v_~#x~0.offset_150|) |v_P3_#t~mem33_34|) (= |v_P3_#t~ite34_31| |v_P3_#t~mem33_34|))) (or .cse8 .cse9) (= |v_P3_#t~ite34_31| |v_P3_#t~ite35_29|)))) (= v_~x$w_buff1_used~0_228 (ite (or .cse10 (and .cse4 .cse5)) 0 v_~x$w_buff1_used~0_229)) (= v_~x$r_buff1_thd4~0_36 (ite (or (and .cse4 (not (= (mod v_~x$w_buff1_used~0_228 256) 0))) (and .cse11 (not (= 0 (mod v_~x$r_buff0_thd4~0_44 256))))) 0 v_~x$r_buff1_thd4~0_37)) (= (ite .cse10 0 v_~x$r_buff0_thd4~0_45) v_~x$r_buff0_thd4~0_44))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_81, ~#x~0.offset=|v_~#x~0.offset_150|, ~x$w_buff1~0=v_~x$w_buff1~0_90, #memory_int=|v_#memory_int_208|, ~#x~0.base=|v_~#x~0.base_150|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_229, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_45, P3Thread1of1ForFork0_#t~ite34=|v_P3Thread1of1ForFork0_#t~ite34_1|, P3Thread1of1ForFork0_#t~mem33=|v_P3Thread1of1ForFork0_#t~mem33_1|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_241} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_81, ~#x~0.offset=|v_~#x~0.offset_150|, ~x$w_buff1~0=v_~x$w_buff1~0_90, #memory_int=|v_#memory_int_207|, ~#x~0.base=|v_~#x~0.base_150|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_228, P3Thread1of1ForFork0_#t~ite35=|v_P3Thread1of1ForFork0_#t~ite35_1|, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_44, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_36, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_240} AuxVars[|v_P3_#t~ite35_29|, |v_P3_#t~ite34_31|, |v_P3_#t~mem33_34|] AssignedVars[#memory_int, ~x$w_buff1_used~0, P3Thread1of1ForFork0_#t~ite35, ~x$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~ite34, P3Thread1of1ForFork0_#t~mem33, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0] [2022-12-13 09:38:10,457 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [952] $Ultimate##0-->L807: Formula: (and (= v_~x$w_buff0_used~0_437 1) (= v_~x$r_buff0_thd0~0_121 v_~x$r_buff1_thd0~0_123) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_7| |v_P1Thread1of1ForFork1_~arg#1.offset_7|) (= v_~x$r_buff0_thd3~0_155 v_~x$r_buff1_thd3~0_159) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_7| |v_P1Thread1of1ForFork1_~arg#1.base_7|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~x$r_buff1_thd2~0_88 v_~x$r_buff0_thd2~0_110) (= v_~x$r_buff1_thd4~0_74 v_~x$r_buff0_thd4~0_80) (= v_~x$w_buff0_used~0_438 v_~x$w_buff1_used~0_426) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| 0)) (= v_~x$w_buff0~0_210 v_~x$w_buff1~0_215) (= v_~x$w_buff0~0_209 1) (= v_~x$r_buff0_thd2~0_109 1) (= v_~x$r_buff1_thd1~0_94 v_~x$r_buff0_thd1~0_93) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_426 256) 0)) (not (= (mod v_~x$w_buff0_used~0_437 256) 0)))) 1 0))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_210, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_121, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_155, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_438, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_209, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_121, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_93, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_7|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_215, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_159, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_88, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_426, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_94, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_155, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_109, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_123, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_74, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_15|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_437, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$r_buff1_thd4~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] and [785] L843-->L850: Formula: (let ((.cse7 (= (mod v_~x$r_buff0_thd3~0_88 256) 0))) (let ((.cse8 (= (mod v_~x$w_buff0_used~0_255 256) 0)) (.cse9 (= (mod v_~x$w_buff1_used~0_245 256) 0)) (.cse10 (= (mod v_~x$r_buff1_thd3~0_86 256) 0)) (.cse5 (not .cse7)) (.cse4 (not (= (mod v_~x$w_buff0_used~0_254 256) 0)))) (let ((.cse2 (and .cse5 .cse4)) (.cse3 (select |v_#memory_int_234| |v_~#x~0.base_160|)) (.cse0 (not .cse10)) (.cse1 (not .cse9)) (.cse6 (not .cse8))) (and (= v_~x$w_buff1_used~0_244 (ite (or (and .cse0 .cse1) .cse2) 0 v_~x$w_buff1_used~0_245)) (= (store |v_#memory_int_234| |v_~#x~0.base_160| (store .cse3 |v_~#x~0.offset_160| |v_P2_#t~ite32_29|)) |v_#memory_int_233|) (= v_~x$r_buff0_thd3~0_87 (ite .cse2 0 v_~x$r_buff0_thd3~0_88)) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_244 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_87 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_86) v_~x$r_buff1_thd3~0_85) (= (ite (and .cse5 .cse6) 0 v_~x$w_buff0_used~0_255) v_~x$w_buff0_used~0_254) (let ((.cse11 (= |v_P2_#t~mem30_30| |v_P2Thread1of1ForFork2_#t~mem30_1|))) (or (and (or .cse7 .cse8) (or (and (= (select .cse3 |v_~#x~0.offset_160|) |v_P2_#t~mem30_30|) (= |v_P2_#t~ite31_29| |v_P2_#t~mem30_30|) (or .cse9 .cse10)) (and (= |v_P2_#t~ite31_29| v_~x$w_buff1~0_104) .cse11 .cse0 .cse1)) (= |v_P2_#t~ite31_29| |v_P2_#t~ite32_29|)) (and .cse5 .cse11 .cse6 (= |v_P2Thread1of1ForFork2_#t~ite31_1| |v_P2_#t~ite31_29|) (= |v_P2_#t~ite32_29| v_~x$w_buff0~0_91)))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_1|, ~#x~0.offset=|v_~#x~0.offset_160|, ~x$w_buff1~0=v_~x$w_buff1~0_104, #memory_int=|v_#memory_int_234|, ~#x~0.base=|v_~#x~0.base_160|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_86, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_245, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_88, P2Thread1of1ForFork2_#t~mem30=|v_P2Thread1of1ForFork2_#t~mem30_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_255} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_91, ~#x~0.offset=|v_~#x~0.offset_160|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_104, #memory_int=|v_#memory_int_233|, ~#x~0.base=|v_~#x~0.base_160|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_85, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_244, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_87, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_254} AuxVars[|v_P2_#t~ite31_29|, |v_P2_#t~mem30_30|, |v_P2_#t~ite32_29|] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite32, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~mem30, ~x$w_buff0_used~0] [2022-12-13 09:38:11,393 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 09:38:11,395 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2810 [2022-12-13 09:38:11,396 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 73 transitions, 392 flow [2022-12-13 09:38:11,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:11,396 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:11,396 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:11,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:38:11,396 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:38:11,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:11,397 INFO L85 PathProgramCache]: Analyzing trace with hash -498764745, now seen corresponding path program 1 times [2022-12-13 09:38:11,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:11,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067296469] [2022-12-13 09:38:11,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:11,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:11,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:13,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:38:13,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:13,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067296469] [2022-12-13 09:38:13,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067296469] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:13,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:13,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:38:13,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036464556] [2022-12-13 09:38:13,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:13,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:38:13,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:13,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:38:13,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:38:13,292 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2022-12-13 09:38:13,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 73 transitions, 392 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:13,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:13,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2022-12-13 09:38:13,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:14,734 INFO L130 PetriNetUnfolder]: 8275/12166 cut-off events. [2022-12-13 09:38:14,734 INFO L131 PetriNetUnfolder]: For 18689/19350 co-relation queries the response was YES. [2022-12-13 09:38:14,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48998 conditions, 12166 events. 8275/12166 cut-off events. For 18689/19350 co-relation queries the response was YES. Maximal size of possible extension queue 848. Compared 75510 event pairs, 2142 based on Foata normal form. 335/10156 useless extension candidates. Maximal degree in co-relation 48978. Up to 8588 conditions per place. [2022-12-13 09:38:14,842 INFO L137 encePairwiseOnDemand]: 29/43 looper letters, 125 selfloop transitions, 20 changer transitions 0/164 dead transitions. [2022-12-13 09:38:14,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 164 transitions, 1191 flow [2022-12-13 09:38:14,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:38:14,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:38:14,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2022-12-13 09:38:14,844 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5891472868217055 [2022-12-13 09:38:14,844 INFO L175 Difference]: Start difference. First operand has 64 places, 73 transitions, 392 flow. Second operand 6 states and 152 transitions. [2022-12-13 09:38:14,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 164 transitions, 1191 flow [2022-12-13 09:38:14,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 164 transitions, 1189 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-13 09:38:14,888 INFO L231 Difference]: Finished difference. Result has 73 places, 83 transitions, 519 flow [2022-12-13 09:38:14,889 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=519, PETRI_PLACES=73, PETRI_TRANSITIONS=83} [2022-12-13 09:38:14,891 INFO L295 CegarLoopForPetriNet]: 86 programPoint places, -13 predicate places. [2022-12-13 09:38:14,891 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:14,892 INFO L89 Accepts]: Start accepts. Operand has 73 places, 83 transitions, 519 flow [2022-12-13 09:38:14,894 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:14,894 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:14,894 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 83 transitions, 519 flow [2022-12-13 09:38:14,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 83 transitions, 519 flow [2022-12-13 09:38:15,408 INFO L130 PetriNetUnfolder]: 4080/6491 cut-off events. [2022-12-13 09:38:15,408 INFO L131 PetriNetUnfolder]: For 8680/9682 co-relation queries the response was YES. [2022-12-13 09:38:15,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25134 conditions, 6491 events. 4080/6491 cut-off events. For 8680/9682 co-relation queries the response was YES. Maximal size of possible extension queue 1062. Compared 48429 event pairs, 1187 based on Foata normal form. 23/3538 useless extension candidates. Maximal degree in co-relation 25111. Up to 4573 conditions per place. [2022-12-13 09:38:15,501 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 83 transitions, 519 flow [2022-12-13 09:38:15,501 INFO L226 LiptonReduction]: Number of co-enabled transitions 1688 [2022-12-13 09:38:15,659 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [952] $Ultimate##0-->L807: Formula: (and (= v_~x$w_buff0_used~0_437 1) (= v_~x$r_buff0_thd0~0_121 v_~x$r_buff1_thd0~0_123) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_7| |v_P1Thread1of1ForFork1_~arg#1.offset_7|) (= v_~x$r_buff0_thd3~0_155 v_~x$r_buff1_thd3~0_159) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_7| |v_P1Thread1of1ForFork1_~arg#1.base_7|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~x$r_buff1_thd2~0_88 v_~x$r_buff0_thd2~0_110) (= v_~x$r_buff1_thd4~0_74 v_~x$r_buff0_thd4~0_80) (= v_~x$w_buff0_used~0_438 v_~x$w_buff1_used~0_426) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| 0)) (= v_~x$w_buff0~0_210 v_~x$w_buff1~0_215) (= v_~x$w_buff0~0_209 1) (= v_~x$r_buff0_thd2~0_109 1) (= v_~x$r_buff1_thd1~0_94 v_~x$r_buff0_thd1~0_93) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_426 256) 0)) (not (= (mod v_~x$w_buff0_used~0_437 256) 0)))) 1 0))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_210, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_121, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_155, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_438, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_209, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_121, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_93, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_7|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_215, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_159, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_88, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_426, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_94, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_155, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_109, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_123, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_74, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_15|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_437, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$r_buff1_thd4~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] and [993] L891-3-->L902: Formula: (let ((.cse7 (= (mod v_~x$r_buff0_thd0~0_204 256) 0))) (let ((.cse6 (= (mod v_~x$w_buff0_used~0_693 256) 0)) (.cse1 (not (= (mod v_~x$w_buff0_used~0_692 256) 0))) (.cse4 (not .cse7)) (.cse8 (= (mod v_~x$r_buff1_thd0~0_209 256) 0)) (.cse9 (= (mod v_~x$w_buff1_used~0_663 256) 0))) (let ((.cse0 (select |v_#memory_int_743| |v_~#x~0.base_350|)) (.cse10 (not .cse9)) (.cse2 (not .cse8)) (.cse11 (and .cse1 .cse4)) (.cse5 (not .cse6))) (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_141| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_143|) (= (store |v_#memory_int_743| |v_~#x~0.base_350| (store .cse0 |v_~#x~0.offset_350| |v_ULTIMATE.start_main_#t~ite46#1_171|)) |v_#memory_int_742|) (= (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd0~0_203 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_662 256) 0)) .cse2)) 0 v_~x$r_buff1_thd0~0_209) v_~x$r_buff1_thd0~0_208) (let ((.cse3 (= |v_ULTIMATE.start_main_#t~mem44#1_219| |v_ULTIMATE.start_main_#t~mem44#1_217|))) (or (and .cse3 (= |v_ULTIMATE.start_main_#t~ite45#1_218| |v_ULTIMATE.start_main_#t~ite45#1_220|) .cse4 .cse5 (= |v_ULTIMATE.start_main_#t~ite46#1_171| v_~x$w_buff0~0_389)) (and (or .cse6 .cse7) (= |v_ULTIMATE.start_main_#t~ite45#1_218| |v_ULTIMATE.start_main_#t~ite46#1_171|) (or (and (= |v_ULTIMATE.start_main_#t~ite45#1_218| |v_ULTIMATE.start_main_#t~mem44#1_217|) (or .cse8 .cse9) (= |v_ULTIMATE.start_main_#t~mem44#1_217| (select .cse0 |v_~#x~0.offset_350|))) (and .cse10 .cse3 (= |v_ULTIMATE.start_main_#t~ite45#1_218| v_~x$w_buff1~0_377) .cse2))))) (= (ite (or .cse11 (and .cse10 .cse2)) 0 v_~x$w_buff1_used~0_663) v_~x$w_buff1_used~0_662) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_143| 0)) (= v_~main$tmp_guard0~0_134 (ite (= (ite (= v_~__unbuffered_cnt~0_749 4) 1 0) 0) 0 1)) (= v_~x$r_buff0_thd0~0_203 (ite .cse11 0 v_~x$r_buff0_thd0~0_204)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_141| (mod v_~main$tmp_guard0~0_134 256)) (= (ite (and .cse4 .cse5) 0 v_~x$w_buff0_used~0_693) v_~x$w_buff0_used~0_692))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_389, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_204, ~#x~0.offset=|v_~#x~0.offset_350|, ULTIMATE.start_main_#t~ite45#1=|v_ULTIMATE.start_main_#t~ite45#1_220|, ~x$w_buff1~0=v_~x$w_buff1~0_377, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_663, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_209, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_693, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_219|, #memory_int=|v_#memory_int_743|, ~#x~0.base=|v_~#x~0.base_350|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_749} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_389, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_203, ~#x~0.offset=|v_~#x~0.offset_350|, ~x$w_buff1~0=v_~x$w_buff1~0_377, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_662, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_134, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_208, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_692, ULTIMATE.start_main_#t~ite46#1=|v_ULTIMATE.start_main_#t~ite46#1_170|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_143|, #memory_int=|v_#memory_int_742|, ~#x~0.base=|v_~#x~0.base_350|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_749, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_133|, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_115|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_141|} AuxVars[|v_ULTIMATE.start_main_#t~ite45#1_218|, |v_ULTIMATE.start_main_#t~ite46#1_171|, |v_ULTIMATE.start_main_#t~mem44#1_217|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite45#1, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~mem44#1, ULTIMATE.start_main_#t~ite46#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 09:38:16,293 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:38:16,294 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1403 [2022-12-13 09:38:16,294 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 83 transitions, 526 flow [2022-12-13 09:38:16,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:16,294 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:16,294 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:16,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:38:16,295 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:38:16,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:16,295 INFO L85 PathProgramCache]: Analyzing trace with hash 155915951, now seen corresponding path program 1 times [2022-12-13 09:38:16,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:16,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123387405] [2022-12-13 09:38:16,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:16,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:16,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:38:16,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:16,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123387405] [2022-12-13 09:38:16,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123387405] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:16,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:16,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:38:16,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113228442] [2022-12-13 09:38:16,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:16,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:38:16,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:16,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:38:16,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:38:16,512 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2022-12-13 09:38:16,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 83 transitions, 526 flow. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:16,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:16,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2022-12-13 09:38:16,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:17,967 INFO L130 PetriNetUnfolder]: 6643/10230 cut-off events. [2022-12-13 09:38:17,967 INFO L131 PetriNetUnfolder]: For 19400/19400 co-relation queries the response was YES. [2022-12-13 09:38:17,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46188 conditions, 10230 events. 6643/10230 cut-off events. For 19400/19400 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 66132 event pairs, 329 based on Foata normal form. 945/7709 useless extension candidates. Maximal degree in co-relation 46162. Up to 5734 conditions per place. [2022-12-13 09:38:18,028 INFO L137 encePairwiseOnDemand]: 27/43 looper letters, 111 selfloop transitions, 37 changer transitions 59/214 dead transitions. [2022-12-13 09:38:18,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 214 transitions, 1863 flow [2022-12-13 09:38:18,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 09:38:18,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 09:38:18,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 200 transitions. [2022-12-13 09:38:18,030 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6644518272425249 [2022-12-13 09:38:18,030 INFO L175 Difference]: Start difference. First operand has 73 places, 83 transitions, 526 flow. Second operand 7 states and 200 transitions. [2022-12-13 09:38:18,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 214 transitions, 1863 flow [2022-12-13 09:38:18,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 214 transitions, 1763 flow, removed 16 selfloop flow, removed 2 redundant places. [2022-12-13 09:38:18,073 INFO L231 Difference]: Finished difference. Result has 80 places, 93 transitions, 725 flow [2022-12-13 09:38:18,073 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=725, PETRI_PLACES=80, PETRI_TRANSITIONS=93} [2022-12-13 09:38:18,073 INFO L295 CegarLoopForPetriNet]: 86 programPoint places, -6 predicate places. [2022-12-13 09:38:18,074 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:18,074 INFO L89 Accepts]: Start accepts. Operand has 80 places, 93 transitions, 725 flow [2022-12-13 09:38:18,075 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:18,075 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:18,075 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 93 transitions, 725 flow [2022-12-13 09:38:18,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 93 transitions, 725 flow [2022-12-13 09:38:18,407 INFO L130 PetriNetUnfolder]: 2662/4443 cut-off events. [2022-12-13 09:38:18,408 INFO L131 PetriNetUnfolder]: For 9476/11163 co-relation queries the response was YES. [2022-12-13 09:38:18,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23204 conditions, 4443 events. 2662/4443 cut-off events. For 9476/11163 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 32608 event pairs, 276 based on Foata normal form. 14/2284 useless extension candidates. Maximal degree in co-relation 23178. Up to 3286 conditions per place. [2022-12-13 09:38:18,458 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 93 transitions, 725 flow [2022-12-13 09:38:18,458 INFO L226 LiptonReduction]: Number of co-enabled transitions 1632 [2022-12-13 09:38:19,278 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:38:19,281 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1207 [2022-12-13 09:38:19,281 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 93 transitions, 733 flow [2022-12-13 09:38:19,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:19,281 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:19,282 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:19,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:38:19,282 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:38:19,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:19,282 INFO L85 PathProgramCache]: Analyzing trace with hash -448331936, now seen corresponding path program 1 times [2022-12-13 09:38:19,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:19,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289443318] [2022-12-13 09:38:19,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:19,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:19,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:38:19,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:19,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289443318] [2022-12-13 09:38:19,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289443318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:19,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:19,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 09:38:19,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293012472] [2022-12-13 09:38:19,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:19,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:38:19,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:19,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:38:19,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:38:19,539 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 44 [2022-12-13 09:38:19,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 93 transitions, 733 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:19,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:19,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 44 [2022-12-13 09:38:19,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:20,573 INFO L130 PetriNetUnfolder]: 3655/5765 cut-off events. [2022-12-13 09:38:20,573 INFO L131 PetriNetUnfolder]: For 12672/12672 co-relation queries the response was YES. [2022-12-13 09:38:20,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29257 conditions, 5765 events. 3655/5765 cut-off events. For 12672/12672 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 34704 event pairs, 83 based on Foata normal form. 432/4128 useless extension candidates. Maximal degree in co-relation 29228. Up to 3178 conditions per place. [2022-12-13 09:38:20,605 INFO L137 encePairwiseOnDemand]: 28/44 looper letters, 98 selfloop transitions, 49 changer transitions 22/176 dead transitions. [2022-12-13 09:38:20,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 176 transitions, 1635 flow [2022-12-13 09:38:20,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 09:38:20,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 09:38:20,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2022-12-13 09:38:20,606 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5340909090909091 [2022-12-13 09:38:20,606 INFO L175 Difference]: Start difference. First operand has 77 places, 93 transitions, 733 flow. Second operand 8 states and 188 transitions. [2022-12-13 09:38:20,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 176 transitions, 1635 flow [2022-12-13 09:38:20,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 176 transitions, 1418 flow, removed 67 selfloop flow, removed 8 redundant places. [2022-12-13 09:38:20,838 INFO L231 Difference]: Finished difference. Result has 79 places, 92 transitions, 674 flow [2022-12-13 09:38:20,839 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=674, PETRI_PLACES=79, PETRI_TRANSITIONS=92} [2022-12-13 09:38:20,839 INFO L295 CegarLoopForPetriNet]: 86 programPoint places, -7 predicate places. [2022-12-13 09:38:20,839 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:20,839 INFO L89 Accepts]: Start accepts. Operand has 79 places, 92 transitions, 674 flow [2022-12-13 09:38:20,840 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:20,840 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:20,841 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 92 transitions, 674 flow [2022-12-13 09:38:20,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 92 transitions, 674 flow [2022-12-13 09:38:20,947 INFO L130 PetriNetUnfolder]: 1056/2007 cut-off events. [2022-12-13 09:38:20,947 INFO L131 PetriNetUnfolder]: For 2234/3335 co-relation queries the response was YES. [2022-12-13 09:38:20,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8109 conditions, 2007 events. 1056/2007 cut-off events. For 2234/3335 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 15376 event pairs, 7 based on Foata normal form. 1/785 useless extension candidates. Maximal degree in co-relation 8085. Up to 1216 conditions per place. [2022-12-13 09:38:20,965 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 92 transitions, 674 flow [2022-12-13 09:38:20,966 INFO L226 LiptonReduction]: Number of co-enabled transitions 1558 [2022-12-13 09:38:23,165 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 09:38:23,166 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2327 [2022-12-13 09:38:23,166 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 89 transitions, 668 flow [2022-12-13 09:38:23,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:23,166 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:23,166 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:23,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 09:38:23,167 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:38:23,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:23,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1476221169, now seen corresponding path program 1 times [2022-12-13 09:38:23,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:23,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841996763] [2022-12-13 09:38:23,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:23,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:23,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:38:23,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:23,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841996763] [2022-12-13 09:38:23,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841996763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:23,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:23,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:38:23,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095229157] [2022-12-13 09:38:23,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:23,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:38:23,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:23,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:38:23,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:38:23,392 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2022-12-13 09:38:23,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 89 transitions, 668 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:23,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:23,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2022-12-13 09:38:23,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:24,379 INFO L130 PetriNetUnfolder]: 4242/6399 cut-off events. [2022-12-13 09:38:24,380 INFO L131 PetriNetUnfolder]: For 18038/18523 co-relation queries the response was YES. [2022-12-13 09:38:24,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28955 conditions, 6399 events. 4242/6399 cut-off events. For 18038/18523 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 37719 event pairs, 476 based on Foata normal form. 233/5031 useless extension candidates. Maximal degree in co-relation 28928. Up to 2537 conditions per place. [2022-12-13 09:38:24,406 INFO L137 encePairwiseOnDemand]: 37/40 looper letters, 72 selfloop transitions, 1 changer transitions 60/155 dead transitions. [2022-12-13 09:38:24,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 155 transitions, 1453 flow [2022-12-13 09:38:24,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:38:24,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:38:24,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2022-12-13 09:38:24,408 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6125 [2022-12-13 09:38:24,408 INFO L175 Difference]: Start difference. First operand has 74 places, 89 transitions, 668 flow. Second operand 4 states and 98 transitions. [2022-12-13 09:38:24,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 155 transitions, 1453 flow [2022-12-13 09:38:24,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 155 transitions, 1149 flow, removed 83 selfloop flow, removed 7 redundant places. [2022-12-13 09:38:24,708 INFO L231 Difference]: Finished difference. Result has 72 places, 82 transitions, 456 flow [2022-12-13 09:38:24,708 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=456, PETRI_PLACES=72, PETRI_TRANSITIONS=82} [2022-12-13 09:38:24,708 INFO L295 CegarLoopForPetriNet]: 86 programPoint places, -14 predicate places. [2022-12-13 09:38:24,708 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:24,709 INFO L89 Accepts]: Start accepts. Operand has 72 places, 82 transitions, 456 flow [2022-12-13 09:38:24,709 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:24,710 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:24,710 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 82 transitions, 456 flow [2022-12-13 09:38:24,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 82 transitions, 456 flow [2022-12-13 09:38:24,816 INFO L130 PetriNetUnfolder]: 1423/2264 cut-off events. [2022-12-13 09:38:24,816 INFO L131 PetriNetUnfolder]: For 2756/2837 co-relation queries the response was YES. [2022-12-13 09:38:24,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6809 conditions, 2264 events. 1423/2264 cut-off events. For 2756/2837 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 14410 event pairs, 7 based on Foata normal form. 15/771 useless extension candidates. Maximal degree in co-relation 6787. Up to 1027 conditions per place. [2022-12-13 09:38:24,832 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 82 transitions, 456 flow [2022-12-13 09:38:24,832 INFO L226 LiptonReduction]: Number of co-enabled transitions 1144 [2022-12-13 09:38:24,853 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [992] $Ultimate##0-->L785: Formula: (let ((.cse4 (= (mod v_~x$r_buff1_thd1~0_204 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_655 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_685 256) 0)) (.cse14 (= (mod v_~x$r_buff0_thd1~0_201 256) 0))) (let ((.cse7 (not .cse14)) (.cse10 (not .cse16)) (.cse12 (and .cse14 .cse8)) (.cse13 (and .cse14 .cse4)) (.cse1 (= (mod v_~weak$$choice2~0_168 256) 0)) (.cse15 (select |v_#memory_int_735| |v_~#x~0.base_346|))) (let ((.cse6 (select .cse15 |v_~#x~0.offset_346|)) (.cse2 (= (mod v_~x$w_buff1_used~0_654 256) 0)) (.cse5 (= (mod v_~x$w_buff0_used~0_684 256) 0)) (.cse0 (not .cse1)) (.cse11 (or .cse12 .cse16 .cse13)) (.cse9 (and .cse7 .cse10))) (and (= v_~x$flush_delayed~0_144 0) (or (and (= |v_P0_#t~ite10_75| v_~x$mem_tmp~0_114) (= |v_P0Thread1of1ForFork3_#t~mem9_92| |v_P0_#t~mem9_78|) .cse0) (and (= v_~__unbuffered_p0_EBX~0_141 |v_P0_#t~mem9_78|) (= |v_P0_#t~ite10_75| |v_P0_#t~mem9_78|) .cse1)) (= (ite .cse0 v_~x$r_buff1_thd1~0_204 (ite (let ((.cse3 (= (mod v_~x$r_buff0_thd1~0_200 256) 0))) (or (and .cse2 .cse3) (and .cse4 .cse3) .cse5)) v_~x$r_buff1_thd1~0_204 0)) v_~x$r_buff1_thd1~0_203) (= |v_P0Thread1of1ForFork3_#t~nondet3_92| v_~weak$$choice0~0_164) (= .cse6 v_~x$mem_tmp~0_114) (= v_~x$w_buff0~0_382 v_~x$w_buff0~0_381) (or (and (or .cse7 (not .cse8)) (or .cse7 (not .cse4)) (= |v_P0Thread1of1ForFork3_#t~mem6_92| |v_P0_#t~mem6_74|) (= v_~__unbuffered_p0_EBX~0_141 (ite .cse9 v_~x$w_buff0~0_382 v_~x$w_buff1~0_370)) .cse10) (and .cse11 (= v_~__unbuffered_p0_EBX~0_141 |v_P0_#t~mem6_74|) (= .cse6 |v_P0_#t~mem6_74|))) (= (ite .cse0 v_~x$w_buff1_used~0_655 (ite (or .cse12 .cse5 .cse13) v_~x$w_buff1_used~0_655 0)) v_~x$w_buff1_used~0_654) (= v_~x$r_buff0_thd1~0_200 (ite .cse0 v_~x$r_buff0_thd1~0_201 (ite (or (and .cse14 .cse2) .cse5 .cse13) v_~x$r_buff0_thd1~0_201 (ite (and .cse7 (not .cse5)) 0 v_~x$r_buff0_thd1~0_201)))) (= v_~x$w_buff1~0_369 v_~x$w_buff1~0_370) (= (store |v_#memory_int_735| |v_~#x~0.base_346| (store .cse15 |v_~#x~0.offset_346| |v_P0_#t~ite10_75|)) |v_#memory_int_734|) (= v_~y~0_71 v_~__unbuffered_p0_EAX~0_106) (= v_P0Thread1of1ForFork3_~arg.base_20 |v_P0Thread1of1ForFork3_#in~arg.base_20|) (= |v_P0Thread1of1ForFork3_#t~nondet4_92| v_~weak$$choice2~0_168) (= (ite .cse0 v_~x$w_buff0_used~0_685 (ite .cse11 v_~x$w_buff0_used~0_685 (ite .cse9 0 v_~x$w_buff0_used~0_685))) v_~x$w_buff0_used~0_684) (= |v_P0Thread1of1ForFork3_#in~arg.offset_20| v_P0Thread1of1ForFork3_~arg.offset_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_382, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_201, ~#x~0.offset=|v_~#x~0.offset_346|, ~x$w_buff1~0=v_~x$w_buff1~0_370, P0Thread1of1ForFork3_#t~mem9=|v_P0Thread1of1ForFork3_#t~mem9_92|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_655, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_204, P0Thread1of1ForFork3_#t~mem6=|v_P0Thread1of1ForFork3_#t~mem6_92|, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_20|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_685, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_20|, #memory_int=|v_#memory_int_735|, ~#x~0.base=|v_~#x~0.base_346|, P0Thread1of1ForFork3_#t~nondet3=|v_P0Thread1of1ForFork3_#t~nondet3_92|, ~y~0=v_~y~0_71, P0Thread1of1ForFork3_#t~nondet4=|v_P0Thread1of1ForFork3_#t~nondet4_92|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_381, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_200, ~x$flush_delayed~0=v_~x$flush_delayed~0_144, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_20, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_203, ~x$mem_tmp~0=v_~x$mem_tmp~0_114, P0Thread1of1ForFork3_#t~mem8=|v_P0Thread1of1ForFork3_#t~mem8_48|, P0Thread1of1ForFork3_#t~mem5=|v_P0Thread1of1ForFork3_#t~mem5_48|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_106, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_20|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_20, ~y~0=v_~y~0_71, P0Thread1of1ForFork3_#t~ite10=|v_P0Thread1of1ForFork3_#t~ite10_48|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_141, ~#x~0.offset=|v_~#x~0.offset_346|, ~x$w_buff1~0=v_~x$w_buff1~0_369, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_654, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_20|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_684, ~weak$$choice0~0=v_~weak$$choice0~0_164, P0Thread1of1ForFork3_#t~ite7=|v_P0Thread1of1ForFork3_#t~ite7_48|, #memory_int=|v_#memory_int_734|, ~#x~0.base=|v_~#x~0.base_346|, ~weak$$choice2~0=v_~weak$$choice2~0_168} AuxVars[|v_P0_#t~mem6_74|, |v_P0_#t~ite10_75|, |v_P0_#t~mem9_78|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#t~mem9, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, P0Thread1of1ForFork3_#t~mem8, P0Thread1of1ForFork3_#t~mem5, P0Thread1of1ForFork3_#t~mem6, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork3_#t~ite7, #memory_int, P0Thread1of1ForFork3_~arg.offset, ~weak$$choice2~0, P0Thread1of1ForFork3_#t~nondet3, P0Thread1of1ForFork3_#t~ite10, P0Thread1of1ForFork3_#t~nondet4] and [785] L843-->L850: Formula: (let ((.cse7 (= (mod v_~x$r_buff0_thd3~0_88 256) 0))) (let ((.cse8 (= (mod v_~x$w_buff0_used~0_255 256) 0)) (.cse9 (= (mod v_~x$w_buff1_used~0_245 256) 0)) (.cse10 (= (mod v_~x$r_buff1_thd3~0_86 256) 0)) (.cse5 (not .cse7)) (.cse4 (not (= (mod v_~x$w_buff0_used~0_254 256) 0)))) (let ((.cse2 (and .cse5 .cse4)) (.cse3 (select |v_#memory_int_234| |v_~#x~0.base_160|)) (.cse0 (not .cse10)) (.cse1 (not .cse9)) (.cse6 (not .cse8))) (and (= v_~x$w_buff1_used~0_244 (ite (or (and .cse0 .cse1) .cse2) 0 v_~x$w_buff1_used~0_245)) (= (store |v_#memory_int_234| |v_~#x~0.base_160| (store .cse3 |v_~#x~0.offset_160| |v_P2_#t~ite32_29|)) |v_#memory_int_233|) (= v_~x$r_buff0_thd3~0_87 (ite .cse2 0 v_~x$r_buff0_thd3~0_88)) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_244 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_87 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_86) v_~x$r_buff1_thd3~0_85) (= (ite (and .cse5 .cse6) 0 v_~x$w_buff0_used~0_255) v_~x$w_buff0_used~0_254) (let ((.cse11 (= |v_P2_#t~mem30_30| |v_P2Thread1of1ForFork2_#t~mem30_1|))) (or (and (or .cse7 .cse8) (or (and (= (select .cse3 |v_~#x~0.offset_160|) |v_P2_#t~mem30_30|) (= |v_P2_#t~ite31_29| |v_P2_#t~mem30_30|) (or .cse9 .cse10)) (and (= |v_P2_#t~ite31_29| v_~x$w_buff1~0_104) .cse11 .cse0 .cse1)) (= |v_P2_#t~ite31_29| |v_P2_#t~ite32_29|)) (and .cse5 .cse11 .cse6 (= |v_P2Thread1of1ForFork2_#t~ite31_1| |v_P2_#t~ite31_29|) (= |v_P2_#t~ite32_29| v_~x$w_buff0~0_91)))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_1|, ~#x~0.offset=|v_~#x~0.offset_160|, ~x$w_buff1~0=v_~x$w_buff1~0_104, #memory_int=|v_#memory_int_234|, ~#x~0.base=|v_~#x~0.base_160|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_86, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_245, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_88, P2Thread1of1ForFork2_#t~mem30=|v_P2Thread1of1ForFork2_#t~mem30_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_255} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_91, ~#x~0.offset=|v_~#x~0.offset_160|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_104, #memory_int=|v_#memory_int_233|, ~#x~0.base=|v_~#x~0.base_160|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_85, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_244, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_87, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_254} AuxVars[|v_P2_#t~ite31_29|, |v_P2_#t~mem30_30|, |v_P2_#t~ite32_29|] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite32, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~mem30, ~x$w_buff0_used~0] [2022-12-13 09:38:26,020 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:38:26,021 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1313 [2022-12-13 09:38:26,021 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 82 transitions, 464 flow [2022-12-13 09:38:26,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:26,021 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:26,021 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:26,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 09:38:26,021 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:38:26,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:26,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1295100088, now seen corresponding path program 1 times [2022-12-13 09:38:26,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:26,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313260247] [2022-12-13 09:38:26,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:26,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:38:26,124 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 09:38:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:38:26,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 09:38:26,266 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 09:38:26,266 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 09:38:26,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 09:38:26,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 09:38:26,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 09:38:26,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 09:38:26,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 09:38:26,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 09:38:26,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 09:38:26,270 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:26,277 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:38:26,277 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:38:26,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:38:26 BasicIcfg [2022-12-13 09:38:26,409 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:38:26,410 INFO L158 Benchmark]: Toolchain (without parser) took 59767.74ms. Allocated memory was 189.8MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 149.5MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2022-12-13 09:38:26,410 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 189.8MB. Free memory was 166.4MB in the beginning and 166.3MB in the end (delta: 73.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:38:26,410 INFO L158 Benchmark]: CACSL2BoogieTranslator took 562.86ms. Allocated memory is still 189.8MB. Free memory was 149.5MB in the beginning and 120.0MB in the end (delta: 29.5MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-13 09:38:26,410 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.07ms. Allocated memory is still 189.8MB. Free memory was 120.0MB in the beginning and 117.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:38:26,410 INFO L158 Benchmark]: Boogie Preprocessor took 36.12ms. Allocated memory is still 189.8MB. Free memory was 117.5MB in the beginning and 114.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 09:38:26,411 INFO L158 Benchmark]: RCFGBuilder took 1075.70ms. Allocated memory is still 189.8MB. Free memory was 114.9MB in the beginning and 125.7MB in the end (delta: -10.9MB). Peak memory consumption was 60.5MB. Max. memory is 8.0GB. [2022-12-13 09:38:26,411 INFO L158 Benchmark]: TraceAbstraction took 58039.38ms. Allocated memory was 189.8MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 124.7MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 978.7MB. Max. memory is 8.0GB. [2022-12-13 09:38:26,412 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 189.8MB. Free memory was 166.4MB in the beginning and 166.3MB in the end (delta: 73.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 562.86ms. Allocated memory is still 189.8MB. Free memory was 149.5MB in the beginning and 120.0MB in the end (delta: 29.5MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.07ms. Allocated memory is still 189.8MB. Free memory was 120.0MB in the beginning and 117.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.12ms. Allocated memory is still 189.8MB. Free memory was 117.5MB in the beginning and 114.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1075.70ms. Allocated memory is still 189.8MB. Free memory was 114.9MB in the beginning and 125.7MB in the end (delta: -10.9MB). Peak memory consumption was 60.5MB. Max. memory is 8.0GB. * TraceAbstraction took 58039.38ms. Allocated memory was 189.8MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 124.7MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 978.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.5s, 153 PlacesBefore, 86 PlacesAfterwards, 142 TransitionsBefore, 74 TransitionsAfterwards, 2664 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 62 TrivialYvCompositions, 52 ConcurrentYvCompositions, 4 ChoiceCompositions, 119 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4554, independent: 4423, independent conditional: 4423, independent unconditional: 0, dependent: 131, dependent conditional: 131, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2776, independent: 2721, independent conditional: 0, independent unconditional: 2721, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2776, independent: 2721, independent conditional: 0, independent unconditional: 2721, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2776, independent: 2697, independent conditional: 0, independent unconditional: 2697, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 79, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 635, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 605, dependent conditional: 0, dependent unconditional: 605, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4554, independent: 1702, independent conditional: 1702, independent unconditional: 0, dependent: 76, dependent conditional: 76, dependent unconditional: 0, unknown: 2776, unknown conditional: 2776, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2786, Positive cache size: 2731, Positive conditional cache size: 2731, Positive unconditional cache size: 0, Negative cache size: 55, Negative conditional cache size: 55, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 50 PlacesBefore, 50 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 878 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 362, independent: 324, independent conditional: 324, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 328, independent: 299, independent conditional: 14, independent unconditional: 285, dependent: 29, dependent conditional: 1, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 328, independent: 299, independent conditional: 14, independent unconditional: 285, dependent: 29, dependent conditional: 1, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 328, independent: 242, independent conditional: 0, independent unconditional: 242, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 86, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 29, dependent conditional: 1, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 324, independent: 76, independent conditional: 0, independent unconditional: 76, dependent: 248, dependent conditional: 13, dependent unconditional: 236, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 362, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 328, unknown conditional: 328, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 328, Positive cache size: 299, Positive conditional cache size: 299, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 874 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 340, independent: 304, independent conditional: 304, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 40, independent conditional: 20, independent unconditional: 20, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 42, independent: 40, independent conditional: 20, independent unconditional: 20, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 42, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 13, dependent conditional: 1, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 340, independent: 264, independent conditional: 264, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 42, unknown conditional: 42, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 370, Positive cache size: 339, Positive conditional cache size: 339, Positive unconditional cache size: 0, Negative cache size: 31, Negative conditional cache size: 31, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 756 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 310, independent: 275, independent conditional: 275, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51, independent: 47, independent conditional: 26, independent unconditional: 21, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 51, independent: 47, independent conditional: 26, independent unconditional: 21, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 51, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 36, dependent conditional: 2, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 310, independent: 228, independent conditional: 228, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 51, unknown conditional: 51, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 421, Positive cache size: 386, Positive conditional cache size: 386, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 52 PlacesBefore, 52 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 752 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 280, independent: 246, independent conditional: 246, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, independent: 34, independent conditional: 9, independent unconditional: 25, dependent: 11, dependent conditional: 1, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 45, independent: 34, independent conditional: 9, independent unconditional: 25, dependent: 11, dependent conditional: 1, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 45, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 1, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 146, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 146, dependent conditional: 19, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 280, independent: 212, independent conditional: 212, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 45, unknown conditional: 45, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 466, Positive cache size: 420, Positive conditional cache size: 420, Positive unconditional cache size: 0, Negative cache size: 46, Negative conditional cache size: 46, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 55 PlacesBefore, 55 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 878 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 104, independent: 73, independent conditional: 73, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 6, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 6, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 104, independent: 61, independent conditional: 61, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 482, Positive cache size: 432, Positive conditional cache size: 432, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 1100 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 129, independent: 86, independent conditional: 86, independent unconditional: 0, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 129, independent: 80, independent conditional: 80, independent unconditional: 0, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 488, Positive cache size: 438, Positive conditional cache size: 438, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 64 PlacesBefore, 64 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 1424 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 276, independent: 262, independent conditional: 262, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 103, independent: 101, independent conditional: 74, independent unconditional: 27, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 103, independent: 101, independent conditional: 74, independent unconditional: 27, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 103, independent: 101, independent conditional: 0, independent unconditional: 101, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 276, independent: 161, independent conditional: 161, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 103, unknown conditional: 103, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 591, Positive cache size: 539, Positive conditional cache size: 539, Positive unconditional cache size: 0, Negative cache size: 52, Negative conditional cache size: 52, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 73 PlacesBefore, 73 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 1688 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 227, independent: 211, independent conditional: 211, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, independent: 30, independent conditional: 22, independent unconditional: 8, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, independent: 30, independent conditional: 22, independent unconditional: 8, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 31, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 227, independent: 181, independent conditional: 181, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 622, Positive cache size: 569, Positive conditional cache size: 569, Positive unconditional cache size: 0, Negative cache size: 53, Negative conditional cache size: 53, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 77 PlacesBefore, 77 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 1632 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 229, independent: 213, independent conditional: 213, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, independent: 57, independent conditional: 46, independent unconditional: 11, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 58, independent: 57, independent conditional: 46, independent unconditional: 11, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 58, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 229, independent: 156, independent conditional: 156, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 58, unknown conditional: 58, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 680, Positive cache size: 626, Positive conditional cache size: 626, Positive unconditional cache size: 0, Negative cache size: 54, Negative conditional cache size: 54, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 77 PlacesBefore, 74 PlacesAfterwards, 92 TransitionsBefore, 89 TransitionsAfterwards, 1558 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 334, independent: 320, independent conditional: 320, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51, independent: 51, independent conditional: 51, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 51, independent: 51, independent conditional: 51, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 51, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 334, independent: 269, independent conditional: 269, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 51, unknown conditional: 51, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 731, Positive cache size: 677, Positive conditional cache size: 677, Positive unconditional cache size: 0, Negative cache size: 54, Negative conditional cache size: 54, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 69 PlacesBefore, 69 PlacesAfterwards, 82 TransitionsBefore, 82 TransitionsAfterwards, 1144 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 746, Positive cache size: 692, Positive conditional cache size: 692, Positive unconditional cache size: 0, Negative cache size: 54, Negative conditional cache size: 54, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p0_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L718] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L719] 0 int __unbuffered_p2_EAX$mem_tmp; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L727] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L728] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L729] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L730] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L731] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L732] 0 int __unbuffered_p2_EAX$w_buff0; [L733] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L734] 0 int __unbuffered_p2_EAX$w_buff1; [L735] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L737] 0 int __unbuffered_p2_EBX = 0; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L742] 0 _Bool x$flush_delayed; [L743] 0 int x$mem_tmp; [L744] 0 _Bool x$r_buff0_thd0; [L745] 0 _Bool x$r_buff0_thd1; [L746] 0 _Bool x$r_buff0_thd2; [L747] 0 _Bool x$r_buff0_thd3; [L748] 0 _Bool x$r_buff0_thd4; [L749] 0 _Bool x$r_buff1_thd0; [L750] 0 _Bool x$r_buff1_thd1; [L751] 0 _Bool x$r_buff1_thd2; [L752] 0 _Bool x$r_buff1_thd3; [L753] 0 _Bool x$r_buff1_thd4; [L754] 0 _Bool x$read_delayed; [L755] 0 int *x$read_delayed_var; [L756] 0 int x$w_buff0; [L757] 0 _Bool x$w_buff0_used; [L758] 0 int x$w_buff1; [L759] 0 _Bool x$w_buff1_used; [L761] 0 int y = 0; [L762] 0 _Bool weak$$choice0; [L763] 0 _Bool weak$$choice1; [L764] 0 _Bool weak$$choice2; [L884] 0 pthread_t t2421; [L885] FCALL, FORK 0 pthread_create(&t2421, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2421, ((void *)0), P0, ((void *)0))=10, t2421={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L886] 0 pthread_t t2422; [L887] FCALL, FORK 0 pthread_create(&t2422, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2422, ((void *)0), P1, ((void *)0))=11, t2421={7:0}, t2422={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L888] 0 pthread_t t2423; [L889] FCALL, FORK 0 pthread_create(&t2423, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2423, ((void *)0), P2, ((void *)0))=12, t2421={7:0}, t2422={8:0}, t2423={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L823] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 3 x$flush_delayed = weak$$choice2 [L826] EXPR 3 \read(x) [L826] 3 x$mem_tmp = x [L827] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L828] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L828] EXPR 3 \read(x) [L828] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L828] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L829] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L830] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L831] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L832] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L833] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L834] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L835] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L836] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L837] EXPR 3 \read(x) [L837] 3 __unbuffered_p2_EAX = x [L838] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L838] EXPR 3 \read(x) [L838] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L838] 3 x = x$flush_delayed ? x$mem_tmp : x [L839] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L890] 0 pthread_t t2424; [L842] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L891] FCALL, FORK 0 pthread_create(&t2424, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2424, ((void *)0), P3, ((void *)0))=13, t2421={7:0}, t2422={8:0}, t2423={9:0}, t2424={5:0}, weak$$choice0=1, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L859] 4 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=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=1, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L862] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L862] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L862] EXPR 4 \read(x) [L862] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L862] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L862] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L863] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L864] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L865] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L866] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=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=1, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L768] 1 __unbuffered_p0_EAX = y [L771] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 1 x$flush_delayed = weak$$choice2 [L774] EXPR 1 \read(x) [L774] 1 x$mem_tmp = x [L775] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L775] EXPR 1 \read(x) [L775] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L775] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L776] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L777] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L778] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L779] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L780] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L781] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 1 \read(x) [L782] 1 __unbuffered_p0_EBX = x [L783] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L783] EXPR 1 \read(x) [L783] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L783] 1 x = x$flush_delayed ? x$mem_tmp : x [L784] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=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=1, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L796] 2 x$w_buff1 = x$w_buff0 [L797] 2 x$w_buff0 = 1 [L798] 2 x$w_buff1_used = x$w_buff0_used [L799] 2 x$w_buff0_used = (_Bool)1 [L800] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L800] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L801] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L802] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L803] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L804] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L805] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L806] 2 x$r_buff0_thd2 = (_Bool)1 [L845] EXPR 2 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L845] EXPR 2 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L845] EXPR 2 \read(x) [L845] EXPR 2 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L845] EXPR 2 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L845] 2 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L846] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L847] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L848] 2 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L849] 2 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=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=1, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L809] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L809] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L810] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L811] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L812] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L813] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L852] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=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=1, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=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=1, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L869] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=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=1, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L893] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L895] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L895] RET 0 assume_abort_if_not(main$tmp_guard0) [L897] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L897] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L897] EXPR 0 \read(x) [L897] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L897] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L897] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L898] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L899] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L900] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L901] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L904] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L905] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L905] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L905] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L905] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L905] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L905] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L906] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L908] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, 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=1, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 887]: 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: 885]: 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: 891]: 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: 889]: 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, 179 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 57.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 26.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 13.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 525 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 525 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1612 IncrementalHoareTripleChecker+Invalid, 1737 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 1 mSDtfsCounter, 1612 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=733occurred in iteration=9, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 183 NumberOfCodeBlocks, 183 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 1561 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 09:38:26,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...