/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix042.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 16:29:54,665 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 16:29:54,667 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 16:29:54,702 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 16:29:54,702 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 16:29:54,706 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 16:29:54,710 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 16:29:54,714 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 16:29:54,718 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 16:29:54,722 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 16:29:54,723 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 16:29:54,724 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 16:29:54,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 16:29:54,725 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 16:29:54,726 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 16:29:54,726 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 16:29:54,727 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 16:29:54,728 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 16:29:54,729 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 16:29:54,730 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 16:29:54,731 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 16:29:54,732 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 16:29:54,733 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 16:29:54,734 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 16:29:54,737 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 16:29:54,737 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 16:29:54,737 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 16:29:54,738 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 16:29:54,738 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 16:29:54,739 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 16:29:54,739 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 16:29:54,741 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 16:29:54,742 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 16:29:54,742 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 16:29:54,752 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 16:29:54,753 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 16:29:54,753 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 16:29:54,754 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 16:29:54,754 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 16:29:54,755 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 16:29:54,756 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 16:29:54,757 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-06 16:29:54,791 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 16:29:54,791 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 16:29:54,792 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-06 16:29:54,792 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-06 16:29:54,792 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 16:29:54,792 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 16:29:54,793 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 16:29:54,793 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 16:29:54,793 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 16:29:54,793 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 16:29:54,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 16:29:54,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 16:29:54,793 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 16:29:54,794 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 16:29:54,794 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 16:29:54,794 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 16:29:54,794 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 16:29:54,794 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 16:29:54,794 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 16:29:54,794 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 16:29:54,795 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 16:29:54,795 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 16:29:54,795 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 16:29:54,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:29:54,795 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 16:29:54,795 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 16:29:54,795 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 16:29:54,796 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 16:29:54,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 16:29:54,796 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-06 16:29:54,796 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-06 16:29:54,796 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 16:29:55,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 16:29:55,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 16:29:55,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 16:29:55,142 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 16:29:55,143 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 16:29:55,144 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042.opt.i [2022-12-06 16:29:56,385 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 16:29:56,657 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 16:29:56,658 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042.opt.i [2022-12-06 16:29:56,681 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2acbccec2/f18280cb14da4e09a23212c810a91179/FLAG14d7dfd32 [2022-12-06 16:29:56,694 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2acbccec2/f18280cb14da4e09a23212c810a91179 [2022-12-06 16:29:56,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 16:29:56,697 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 16:29:56,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 16:29:56,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 16:29:56,702 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 16:29:56,703 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:29:56" (1/1) ... [2022-12-06 16:29:56,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cec845d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:56, skipping insertion in model container [2022-12-06 16:29:56,704 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:29:56" (1/1) ... [2022-12-06 16:29:56,709 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 16:29:56,760 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 16:29:56,925 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/mix042.opt.i[944,957] [2022-12-06 16:29:57,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:29:57,144 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 16:29:57,153 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/mix042.opt.i[944,957] [2022-12-06 16:29:57,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:29:57,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:29:57,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:29:57,223 INFO L208 MainTranslator]: Completed translation [2022-12-06 16:29:57,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:57 WrapperNode [2022-12-06 16:29:57,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 16:29:57,225 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 16:29:57,225 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 16:29:57,225 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 16:29:57,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:57" (1/1) ... [2022-12-06 16:29:57,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:57" (1/1) ... [2022-12-06 16:29:57,267 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2022-12-06 16:29:57,267 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 16:29:57,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 16:29:57,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 16:29:57,268 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 16:29:57,275 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:57" (1/1) ... [2022-12-06 16:29:57,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:57" (1/1) ... [2022-12-06 16:29:57,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:57" (1/1) ... [2022-12-06 16:29:57,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:57" (1/1) ... [2022-12-06 16:29:57,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:57" (1/1) ... [2022-12-06 16:29:57,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:57" (1/1) ... [2022-12-06 16:29:57,290 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:57" (1/1) ... [2022-12-06 16:29:57,296 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:57" (1/1) ... [2022-12-06 16:29:57,300 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 16:29:57,301 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 16:29:57,301 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 16:29:57,301 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 16:29:57,301 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:57" (1/1) ... [2022-12-06 16:29:57,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:29:57,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:29:57,336 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 16:29:57,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 16:29:57,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 16:29:57,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 16:29:57,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 16:29:57,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 16:29:57,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 16:29:57,372 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 16:29:57,372 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 16:29:57,372 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 16:29:57,372 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 16:29:57,373 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 16:29:57,373 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 16:29:57,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 16:29:57,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 16:29:57,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 16:29:57,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 16:29:57,374 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 16:29:57,481 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 16:29:57,483 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 16:29:57,742 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 16:29:57,903 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 16:29:57,903 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 16:29:57,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:29:57 BoogieIcfgContainer [2022-12-06 16:29:57,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 16:29:57,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 16:29:57,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 16:29:57,911 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 16:29:57,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:29:56" (1/3) ... [2022-12-06 16:29:57,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f78a23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:29:57, skipping insertion in model container [2022-12-06 16:29:57,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:57" (2/3) ... [2022-12-06 16:29:57,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f78a23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:29:57, skipping insertion in model container [2022-12-06 16:29:57,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:29:57" (3/3) ... [2022-12-06 16:29:57,915 INFO L112 eAbstractionObserver]: Analyzing ICFG mix042.opt.i [2022-12-06 16:29:57,930 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 16:29:57,930 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 16:29:57,931 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 16:29:58,007 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 16:29:58,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 237 flow [2022-12-06 16:29:58,130 INFO L130 PetriNetUnfolder]: 2/108 cut-off events. [2022-12-06 16:29:58,130 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 16:29:58,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-06 16:29:58,136 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 111 transitions, 237 flow [2022-12-06 16:29:58,139 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 108 transitions, 225 flow [2022-12-06 16:29:58,148 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 16:29:58,154 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@420078ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 16:29:58,154 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 16:29:58,170 INFO L130 PetriNetUnfolder]: 0/71 cut-off events. [2022-12-06 16:29:58,171 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 16:29:58,171 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:29:58,172 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:29:58,172 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:29:58,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:29:58,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1891246406, now seen corresponding path program 1 times [2022-12-06 16:29:58,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:29:58,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277891111] [2022-12-06 16:29:58,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:29:58,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:29:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:29:58,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:29:58,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:29:58,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277891111] [2022-12-06 16:29:58,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277891111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:29:58,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:29:58,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 16:29:58,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310549726] [2022-12-06 16:29:58,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:29:58,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 16:29:58,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:29:58,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 16:29:58,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 16:29:58,885 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 111 [2022-12-06 16:29:58,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 108 transitions, 225 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:29:58,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:29:58,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 111 [2022-12-06 16:29:58,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:29:59,010 INFO L130 PetriNetUnfolder]: 17/185 cut-off events. [2022-12-06 16:29:59,010 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 16:29:59,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 185 events. 17/185 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 483 event pairs, 3 based on Foata normal form. 9/187 useless extension candidates. Maximal degree in co-relation 186. Up to 27 conditions per place. [2022-12-06 16:29:59,014 INFO L137 encePairwiseOnDemand]: 106/111 looper letters, 10 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2022-12-06 16:29:59,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 107 transitions, 247 flow [2022-12-06 16:29:59,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 16:29:59,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 16:29:59,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2022-12-06 16:29:59,031 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.933933933933934 [2022-12-06 16:29:59,037 INFO L294 CegarLoopForPetriNet]: 116 programPoint places, 0 predicate places. [2022-12-06 16:29:59,038 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 247 flow [2022-12-06 16:29:59,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:29:59,038 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:29:59,039 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:29:59,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 16:29:59,039 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:29:59,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:29:59,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1189007794, now seen corresponding path program 1 times [2022-12-06 16:29:59,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:29:59,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238724906] [2022-12-06 16:29:59,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:29:59,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:29:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:29:59,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:29:59,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:29:59,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238724906] [2022-12-06 16:29:59,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238724906] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:29:59,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:29:59,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:29:59,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934789191] [2022-12-06 16:29:59,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:29:59,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:29:59,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:29:59,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:29:59,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:29:59,534 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 111 [2022-12-06 16:29:59,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 247 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:29:59,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:29:59,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 111 [2022-12-06 16:29:59,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:29:59,786 INFO L130 PetriNetUnfolder]: 84/384 cut-off events. [2022-12-06 16:29:59,786 INFO L131 PetriNetUnfolder]: For 80/110 co-relation queries the response was YES. [2022-12-06 16:29:59,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 384 events. 84/384 cut-off events. For 80/110 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1871 event pairs, 14 based on Foata normal form. 1/375 useless extension candidates. Maximal degree in co-relation 614. Up to 86 conditions per place. [2022-12-06 16:29:59,793 INFO L137 encePairwiseOnDemand]: 105/111 looper letters, 17 selfloop transitions, 2 changer transitions 38/136 dead transitions. [2022-12-06 16:29:59,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 136 transitions, 437 flow [2022-12-06 16:29:59,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 16:29:59,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 16:29:59,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 863 transitions. [2022-12-06 16:29:59,798 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8638638638638638 [2022-12-06 16:29:59,799 INFO L294 CegarLoopForPetriNet]: 116 programPoint places, 8 predicate places. [2022-12-06 16:29:59,799 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 136 transitions, 437 flow [2022-12-06 16:29:59,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:29:59,799 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:29:59,800 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:29:59,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 16:29:59,800 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:29:59,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:29:59,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1108432075, now seen corresponding path program 1 times [2022-12-06 16:29:59,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:29:59,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036169995] [2022-12-06 16:29:59,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:29:59,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:29:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:30:00,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:30:00,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:30:00,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036169995] [2022-12-06 16:30:00,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036169995] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:30:00,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:30:00,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 16:30:00,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658079204] [2022-12-06 16:30:00,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:30:00,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 16:30:00,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:30:00,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 16:30:00,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-06 16:30:00,847 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 111 [2022-12-06 16:30:00,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 136 transitions, 437 flow. Second operand has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:00,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:30:00,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 111 [2022-12-06 16:30:00,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:30:01,275 INFO L130 PetriNetUnfolder]: 205/862 cut-off events. [2022-12-06 16:30:01,275 INFO L131 PetriNetUnfolder]: For 286/416 co-relation queries the response was YES. [2022-12-06 16:30:01,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1796 conditions, 862 events. 205/862 cut-off events. For 286/416 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5905 event pairs, 14 based on Foata normal form. 3/854 useless extension candidates. Maximal degree in co-relation 1734. Up to 175 conditions per place. [2022-12-06 16:30:01,281 INFO L137 encePairwiseOnDemand]: 100/111 looper letters, 22 selfloop transitions, 8 changer transitions 108/214 dead transitions. [2022-12-06 16:30:01,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 214 transitions, 1060 flow [2022-12-06 16:30:01,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 16:30:01,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 16:30:01,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1474 transitions. [2022-12-06 16:30:01,284 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.829954954954955 [2022-12-06 16:30:01,285 INFO L294 CegarLoopForPetriNet]: 116 programPoint places, 23 predicate places. [2022-12-06 16:30:01,285 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 214 transitions, 1060 flow [2022-12-06 16:30:01,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:01,286 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:30:01,286 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:30:01,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 16:30:01,286 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:30:01,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:30:01,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1480723794, now seen corresponding path program 1 times [2022-12-06 16:30:01,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:30:01,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854472697] [2022-12-06 16:30:01,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:30:01,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:30:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:30:01,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:30:01,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:30:01,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854472697] [2022-12-06 16:30:01,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854472697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:30:01,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:30:01,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:30:01,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20293082] [2022-12-06 16:30:01,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:30:01,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:30:01,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:30:01,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:30:01,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:30:01,600 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 111 [2022-12-06 16:30:01,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 214 transitions, 1060 flow. Second operand has 6 states, 6 states have (on average 90.33333333333333) internal successors, (542), 6 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:01,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:30:01,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 111 [2022-12-06 16:30:01,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:30:02,121 INFO L130 PetriNetUnfolder]: 908/2499 cut-off events. [2022-12-06 16:30:02,121 INFO L131 PetriNetUnfolder]: For 2650/2682 co-relation queries the response was YES. [2022-12-06 16:30:02,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6182 conditions, 2499 events. 908/2499 cut-off events. For 2650/2682 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 19927 event pairs, 40 based on Foata normal form. 1/2430 useless extension candidates. Maximal degree in co-relation 6116. Up to 698 conditions per place. [2022-12-06 16:30:02,134 INFO L137 encePairwiseOnDemand]: 101/111 looper letters, 50 selfloop transitions, 7 changer transitions 152/296 dead transitions. [2022-12-06 16:30:02,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 296 transitions, 1867 flow [2022-12-06 16:30:02,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 16:30:02,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 16:30:02,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 954 transitions. [2022-12-06 16:30:02,146 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8594594594594595 [2022-12-06 16:30:02,148 INFO L294 CegarLoopForPetriNet]: 116 programPoint places, 32 predicate places. [2022-12-06 16:30:02,148 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 296 transitions, 1867 flow [2022-12-06 16:30:02,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.33333333333333) internal successors, (542), 6 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:02,148 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:30:02,148 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:30:02,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 16:30:02,149 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:30:02,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:30:02,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1669317656, now seen corresponding path program 1 times [2022-12-06 16:30:02,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:30:02,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212413811] [2022-12-06 16:30:02,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:30:02,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:30:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:30:02,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:30:02,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:30:02,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212413811] [2022-12-06 16:30:02,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212413811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:30:02,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:30:02,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:30:02,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657264001] [2022-12-06 16:30:02,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:30:02,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:30:02,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:30:02,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:30:02,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:30:02,404 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 111 [2022-12-06 16:30:02,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 296 transitions, 1867 flow. Second operand has 7 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:02,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:30:02,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 111 [2022-12-06 16:30:02,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:30:02,901 INFO L130 PetriNetUnfolder]: 591/1512 cut-off events. [2022-12-06 16:30:02,901 INFO L131 PetriNetUnfolder]: For 2174/2310 co-relation queries the response was YES. [2022-12-06 16:30:02,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4675 conditions, 1512 events. 591/1512 cut-off events. For 2174/2310 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10380 event pairs, 10 based on Foata normal form. 31/1518 useless extension candidates. Maximal degree in co-relation 4605. Up to 386 conditions per place. [2022-12-06 16:30:02,908 INFO L137 encePairwiseOnDemand]: 101/111 looper letters, 60 selfloop transitions, 28 changer transitions 127/302 dead transitions. [2022-12-06 16:30:02,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 302 transitions, 2228 flow [2022-12-06 16:30:02,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:30:02,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:30:02,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1242 transitions. [2022-12-06 16:30:02,912 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8607068607068608 [2022-12-06 16:30:02,914 INFO L294 CegarLoopForPetriNet]: 116 programPoint places, 35 predicate places. [2022-12-06 16:30:02,914 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 302 transitions, 2228 flow [2022-12-06 16:30:02,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:02,915 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:30:02,915 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:30:02,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 16:30:02,916 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:30:02,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:30:02,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1734893618, now seen corresponding path program 1 times [2022-12-06 16:30:02,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:30:02,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376053791] [2022-12-06 16:30:02,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:30:02,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:30:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:30:03,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:30:03,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:30:03,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376053791] [2022-12-06 16:30:03,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376053791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:30:03,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:30:03,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 16:30:03,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150930547] [2022-12-06 16:30:03,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:30:03,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 16:30:03,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:30:03,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 16:30:03,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 16:30:03,414 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 111 [2022-12-06 16:30:03,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 302 transitions, 2228 flow. Second operand has 8 states, 8 states have (on average 80.375) internal successors, (643), 8 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:03,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:30:03,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 111 [2022-12-06 16:30:03,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:30:04,139 INFO L130 PetriNetUnfolder]: 1664/3917 cut-off events. [2022-12-06 16:30:04,139 INFO L131 PetriNetUnfolder]: For 10192/10998 co-relation queries the response was YES. [2022-12-06 16:30:04,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13392 conditions, 3917 events. 1664/3917 cut-off events. For 10192/10998 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 32051 event pairs, 83 based on Foata normal form. 99/3869 useless extension candidates. Maximal degree in co-relation 13308. Up to 1047 conditions per place. [2022-12-06 16:30:04,161 INFO L137 encePairwiseOnDemand]: 103/111 looper letters, 106 selfloop transitions, 4 changer transitions 219/438 dead transitions. [2022-12-06 16:30:04,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 438 transitions, 4218 flow [2022-12-06 16:30:04,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 16:30:04,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 16:30:04,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 689 transitions. [2022-12-06 16:30:04,164 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7759009009009009 [2022-12-06 16:30:04,164 INFO L294 CegarLoopForPetriNet]: 116 programPoint places, 42 predicate places. [2022-12-06 16:30:04,164 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 438 transitions, 4218 flow [2022-12-06 16:30:04,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 80.375) internal successors, (643), 8 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:04,165 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:30:04,165 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:30:04,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 16:30:04,166 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:30:04,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:30:04,166 INFO L85 PathProgramCache]: Analyzing trace with hash 894742450, now seen corresponding path program 2 times [2022-12-06 16:30:04,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:30:04,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795094549] [2022-12-06 16:30:04,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:30:04,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:30:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:30:04,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:30:04,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:30:04,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795094549] [2022-12-06 16:30:04,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795094549] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:30:04,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:30:04,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 16:30:04,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803642115] [2022-12-06 16:30:04,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:30:04,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 16:30:04,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:30:04,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 16:30:04,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 16:30:04,416 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 111 [2022-12-06 16:30:04,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 438 transitions, 4218 flow. Second operand has 8 states, 8 states have (on average 90.0) internal successors, (720), 8 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:04,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:30:04,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 111 [2022-12-06 16:30:04,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:30:05,183 INFO L130 PetriNetUnfolder]: 1551/3489 cut-off events. [2022-12-06 16:30:05,183 INFO L131 PetriNetUnfolder]: For 11197/13239 co-relation queries the response was YES. [2022-12-06 16:30:05,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14515 conditions, 3489 events. 1551/3489 cut-off events. For 11197/13239 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 28713 event pairs, 69 based on Foata normal form. 494/3862 useless extension candidates. Maximal degree in co-relation 14427. Up to 851 conditions per place. [2022-12-06 16:30:05,206 INFO L137 encePairwiseOnDemand]: 101/111 looper letters, 48 selfloop transitions, 32 changer transitions 263/422 dead transitions. [2022-12-06 16:30:05,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 422 transitions, 4666 flow [2022-12-06 16:30:05,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 16:30:05,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 16:30:05,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1499 transitions. [2022-12-06 16:30:05,210 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8440315315315315 [2022-12-06 16:30:05,211 INFO L294 CegarLoopForPetriNet]: 116 programPoint places, 51 predicate places. [2022-12-06 16:30:05,211 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 422 transitions, 4666 flow [2022-12-06 16:30:05,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.0) internal successors, (720), 8 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:05,211 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:30:05,212 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:30:05,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 16:30:05,212 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:30:05,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:30:05,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1733898522, now seen corresponding path program 1 times [2022-12-06 16:30:05,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:30:05,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540965812] [2022-12-06 16:30:05,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:30:05,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:30:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:30:05,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:30:05,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:30:05,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540965812] [2022-12-06 16:30:05,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540965812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:30:05,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:30:05,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:30:05,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432559450] [2022-12-06 16:30:05,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:30:05,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:30:05,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:30:05,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:30:05,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:30:05,490 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 111 [2022-12-06 16:30:05,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 422 transitions, 4666 flow. Second operand has 7 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:05,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:30:05,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 111 [2022-12-06 16:30:05,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:30:05,904 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L766-->L773: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_26 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse1 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~y$r_buff0_thd2~0_25 (ite .cse0 0 v_~y$r_buff0_thd2~0_26)) (= v_~y$w_buff0_used~0_105 (ite .cse1 0 v_~y$w_buff0_used~0_106)) (= (ite (or (and .cse2 (not (= (mod v_~y$r_buff0_thd2~0_25 256) 0))) (and .cse3 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19) (= (ite (or .cse4 .cse0) 0 v_~y$w_buff1_used~0_93) v_~y$w_buff1_used~0_92) (= v_~y~0_61 (ite .cse1 v_~y$w_buff0~0_44 (ite .cse4 v_~y$w_buff1~0_41 v_~y~0_62)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_44, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_26, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_44, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_25, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][352], [30#L773true, 122#true, 50#L3true, 43#L751true, 254#(= ~x~0 1), 239#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 125#true, 208#(= ~a~0 1), 4#L798true, P0Thread1of1ForFork2InUse, 141#true, P1Thread1of1ForFork0InUse, 199#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork1InUse, 180#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:30:05,904 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-12-06 16:30:05,904 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:30:05,905 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:30:05,905 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:30:05,905 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([339] L801-->L808: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_19 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd3~0_16 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_69 256) 0)))) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse2 (and .cse3 .cse5))) (and (= (ite .cse0 v_~y$w_buff0~0_30 (ite .cse1 v_~y$w_buff1~0_27 v_~y~0_44)) v_~y~0_43) (= v_~y$w_buff1_used~0_68 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_69)) (= (ite .cse0 0 v_~y$w_buff0_used~0_78) v_~y$w_buff0_used~0_77) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_18 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_68 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_16) v_~y$r_buff1_thd3~0_15) (= v_~y$r_buff0_thd3~0_18 (ite .cse2 0 v_~y$r_buff0_thd3~0_19))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_19, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y~0=v_~y~0_44, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y~0=v_~y~0_43, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][285], [122#true, 84#L763true, 50#L3true, 254#(= ~x~0 1), 43#L751true, 215#(and (= ~a~0 1) (= ~__unbuffered_p2_EBX~0 1)), 239#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 125#true, 27#L808true, P0Thread1of1ForFork2InUse, 141#true, P1Thread1of1ForFork0InUse, 199#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork1InUse, 180#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:30:05,905 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-12-06 16:30:05,905 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:30:05,906 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:30:05,906 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:30:06,061 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([339] L801-->L808: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_19 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd3~0_16 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_69 256) 0)))) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse2 (and .cse3 .cse5))) (and (= (ite .cse0 v_~y$w_buff0~0_30 (ite .cse1 v_~y$w_buff1~0_27 v_~y~0_44)) v_~y~0_43) (= v_~y$w_buff1_used~0_68 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_69)) (= (ite .cse0 0 v_~y$w_buff0_used~0_78) v_~y$w_buff0_used~0_77) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_18 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_68 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_16) v_~y$r_buff1_thd3~0_15) (= v_~y$r_buff0_thd3~0_18 (ite .cse2 0 v_~y$r_buff0_thd3~0_19))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_19, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y~0=v_~y~0_44, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y~0=v_~y~0_43, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][353], [122#true, 50#L3true, 43#L751true, 254#(= ~x~0 1), 215#(and (= ~a~0 1) (= ~__unbuffered_p2_EBX~0 1)), 239#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 125#true, 17#L766true, 27#L808true, P0Thread1of1ForFork2InUse, 141#true, P1Thread1of1ForFork0InUse, 199#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork1InUse, 180#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:30:06,062 INFO L382 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-12-06 16:30:06,062 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:06,062 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:06,062 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:06,062 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L766-->L773: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_26 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse1 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~y$r_buff0_thd2~0_25 (ite .cse0 0 v_~y$r_buff0_thd2~0_26)) (= v_~y$w_buff0_used~0_105 (ite .cse1 0 v_~y$w_buff0_used~0_106)) (= (ite (or (and .cse2 (not (= (mod v_~y$r_buff0_thd2~0_25 256) 0))) (and .cse3 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19) (= (ite (or .cse4 .cse0) 0 v_~y$w_buff1_used~0_93) v_~y$w_buff1_used~0_92) (= v_~y~0_61 (ite .cse1 v_~y$w_buff0~0_44 (ite .cse4 v_~y$w_buff1~0_41 v_~y~0_62)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_44, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_26, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_44, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_25, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][355], [30#L773true, 122#true, 88#L801true, 50#L3true, 43#L751true, 254#(= ~x~0 1), 215#(and (= ~a~0 1) (= ~__unbuffered_p2_EBX~0 1)), 239#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 125#true, P0Thread1of1ForFork2InUse, 141#true, P1Thread1of1ForFork0InUse, 199#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork1InUse, 180#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:30:06,063 INFO L382 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-12-06 16:30:06,063 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:06,063 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:06,063 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:06,064 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L766-->L773: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_26 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse1 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~y$r_buff0_thd2~0_25 (ite .cse0 0 v_~y$r_buff0_thd2~0_26)) (= v_~y$w_buff0_used~0_105 (ite .cse1 0 v_~y$w_buff0_used~0_106)) (= (ite (or (and .cse2 (not (= (mod v_~y$r_buff0_thd2~0_25 256) 0))) (and .cse3 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19) (= (ite (or .cse4 .cse0) 0 v_~y$w_buff1_used~0_93) v_~y$w_buff1_used~0_92) (= v_~y~0_61 (ite .cse1 v_~y$w_buff0~0_44 (ite .cse4 v_~y$w_buff1~0_41 v_~y~0_62)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_44, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_26, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_44, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_25, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][352], [111#L3-1true, 30#L773true, 122#true, 254#(= ~x~0 1), 43#L751true, 239#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 125#true, 208#(= ~a~0 1), 4#L798true, P0Thread1of1ForFork2InUse, 141#true, P1Thread1of1ForFork0InUse, 199#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork1InUse, 180#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:30:06,064 INFO L382 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-12-06 16:30:06,064 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:06,064 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:06,064 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:06,065 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([339] L801-->L808: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_19 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd3~0_16 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_69 256) 0)))) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse2 (and .cse3 .cse5))) (and (= (ite .cse0 v_~y$w_buff0~0_30 (ite .cse1 v_~y$w_buff1~0_27 v_~y~0_44)) v_~y~0_43) (= v_~y$w_buff1_used~0_68 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_69)) (= (ite .cse0 0 v_~y$w_buff0_used~0_78) v_~y$w_buff0_used~0_77) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_18 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_68 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_16) v_~y$r_buff1_thd3~0_15) (= v_~y$r_buff0_thd3~0_18 (ite .cse2 0 v_~y$r_buff0_thd3~0_19))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_19, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y~0=v_~y~0_44, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y~0=v_~y~0_43, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][285], [111#L3-1true, 122#true, 84#L763true, 43#L751true, 254#(= ~x~0 1), 215#(and (= ~a~0 1) (= ~__unbuffered_p2_EBX~0 1)), 239#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 125#true, 27#L808true, P0Thread1of1ForFork2InUse, 141#true, P1Thread1of1ForFork0InUse, 199#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork1InUse, 180#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:30:06,065 INFO L382 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-12-06 16:30:06,065 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:06,065 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:06,065 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:06,141 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([339] L801-->L808: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_19 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd3~0_16 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_69 256) 0)))) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse2 (and .cse3 .cse5))) (and (= (ite .cse0 v_~y$w_buff0~0_30 (ite .cse1 v_~y$w_buff1~0_27 v_~y~0_44)) v_~y~0_43) (= v_~y$w_buff1_used~0_68 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_69)) (= (ite .cse0 0 v_~y$w_buff0_used~0_78) v_~y$w_buff0_used~0_77) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_18 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_68 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_16) v_~y$r_buff1_thd3~0_15) (= v_~y$r_buff0_thd3~0_18 (ite .cse2 0 v_~y$r_buff0_thd3~0_19))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_19, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y~0=v_~y~0_44, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y~0=v_~y~0_43, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][353], [111#L3-1true, 122#true, 43#L751true, 254#(= ~x~0 1), 215#(and (= ~a~0 1) (= ~__unbuffered_p2_EBX~0 1)), 239#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 125#true, 17#L766true, 27#L808true, P0Thread1of1ForFork2InUse, 141#true, P1Thread1of1ForFork0InUse, 199#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork1InUse, 180#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:30:06,142 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-06 16:30:06,142 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:06,142 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:06,142 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:06,142 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L766-->L773: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_26 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse1 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~y$r_buff0_thd2~0_25 (ite .cse0 0 v_~y$r_buff0_thd2~0_26)) (= v_~y$w_buff0_used~0_105 (ite .cse1 0 v_~y$w_buff0_used~0_106)) (= (ite (or (and .cse2 (not (= (mod v_~y$r_buff0_thd2~0_25 256) 0))) (and .cse3 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19) (= (ite (or .cse4 .cse0) 0 v_~y$w_buff1_used~0_93) v_~y$w_buff1_used~0_92) (= v_~y~0_61 (ite .cse1 v_~y$w_buff0~0_44 (ite .cse4 v_~y$w_buff1~0_41 v_~y~0_62)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_44, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_26, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_44, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_25, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][355], [111#L3-1true, 30#L773true, 88#L801true, 122#true, 254#(= ~x~0 1), 43#L751true, 215#(and (= ~a~0 1) (= ~__unbuffered_p2_EBX~0 1)), 239#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 125#true, P0Thread1of1ForFork2InUse, 141#true, P1Thread1of1ForFork0InUse, 199#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 180#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork1InUse]) [2022-12-06 16:30:06,143 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-06 16:30:06,143 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:06,143 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:06,143 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:06,240 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([323] L751-->L756: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][129], [201#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 30#L773true, 122#true, 88#L801true, 243#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 50#L3true, 36#L756true, 125#true, 260#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 182#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 208#(= ~a~0 1), P0Thread1of1ForFork2InUse, 141#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-12-06 16:30:06,240 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-06 16:30:06,240 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:06,240 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:06,240 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:06,329 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([339] L801-->L808: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_19 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd3~0_16 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_69 256) 0)))) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse2 (and .cse3 .cse5))) (and (= (ite .cse0 v_~y$w_buff0~0_30 (ite .cse1 v_~y$w_buff1~0_27 v_~y~0_44)) v_~y~0_43) (= v_~y$w_buff1_used~0_68 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_69)) (= (ite .cse0 0 v_~y$w_buff0_used~0_78) v_~y$w_buff0_used~0_77) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_18 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_68 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_16) v_~y$r_buff1_thd3~0_15) (= v_~y$r_buff0_thd3~0_18 (ite .cse2 0 v_~y$r_buff0_thd3~0_19))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_19, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y~0=v_~y~0_44, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y~0=v_~y~0_43, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][406], [30#L773true, 122#true, 50#L3true, 43#L751true, 239#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 125#true, 260#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 208#(= ~a~0 1), 27#L808true, P0Thread1of1ForFork2InUse, 141#true, P1Thread1of1ForFork0InUse, 199#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 180#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork1InUse]) [2022-12-06 16:30:06,329 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is not cut-off event [2022-12-06 16:30:06,330 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is not cut-off event [2022-12-06 16:30:06,330 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is not cut-off event [2022-12-06 16:30:06,330 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is not cut-off event [2022-12-06 16:30:06,331 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([323] L751-->L756: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][129], [111#L3-1true, 30#L773true, 201#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 122#true, 88#L801true, 243#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 36#L756true, 125#true, 260#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 208#(= ~a~0 1), 182#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, 141#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-12-06 16:30:06,331 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-12-06 16:30:06,331 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:30:06,331 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:30:06,331 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:30:06,332 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([339] L801-->L808: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_19 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd3~0_16 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_69 256) 0)))) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse2 (and .cse3 .cse5))) (and (= (ite .cse0 v_~y$w_buff0~0_30 (ite .cse1 v_~y$w_buff1~0_27 v_~y~0_44)) v_~y~0_43) (= v_~y$w_buff1_used~0_68 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_69)) (= (ite .cse0 0 v_~y$w_buff0_used~0_78) v_~y$w_buff0_used~0_77) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_18 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_68 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_16) v_~y$r_buff1_thd3~0_15) (= v_~y$r_buff0_thd3~0_18 (ite .cse2 0 v_~y$r_buff0_thd3~0_19))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_19, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y~0=v_~y~0_44, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y~0=v_~y~0_43, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][406], [111#L3-1true, 30#L773true, 122#true, 43#L751true, 239#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 125#true, 260#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 208#(= ~a~0 1), 27#L808true, P0Thread1of1ForFork2InUse, 141#true, P1Thread1of1ForFork0InUse, 199#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 180#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork1InUse]) [2022-12-06 16:30:06,332 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-12-06 16:30:06,332 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:30:06,332 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:30:06,332 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:30:06,333 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([323] L751-->L756: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][369], [205#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 247#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 104#L776true, 122#true, 88#L801true, 50#L3true, 36#L756true, 125#true, 260#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 182#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 208#(= ~a~0 1), P0Thread1of1ForFork2InUse, 141#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-12-06 16:30:06,333 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-12-06 16:30:06,333 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:30:06,333 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:30:06,334 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:30:06,399 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([339] L801-->L808: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_19 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd3~0_16 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_69 256) 0)))) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse2 (and .cse3 .cse5))) (and (= (ite .cse0 v_~y$w_buff0~0_30 (ite .cse1 v_~y$w_buff1~0_27 v_~y~0_44)) v_~y~0_43) (= v_~y$w_buff1_used~0_68 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_69)) (= (ite .cse0 0 v_~y$w_buff0_used~0_78) v_~y$w_buff0_used~0_77) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_18 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_68 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_16) v_~y$r_buff1_thd3~0_15) (= v_~y$r_buff0_thd3~0_18 (ite .cse2 0 v_~y$r_buff0_thd3~0_19))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_19, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y~0=v_~y~0_44, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y~0=v_~y~0_43, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][460], [201#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 122#true, 104#L776true, 243#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 50#L3true, 43#L751true, 125#true, 260#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 182#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 208#(= ~a~0 1), 27#L808true, P0Thread1of1ForFork2InUse, 141#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-12-06 16:30:06,399 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is not cut-off event [2022-12-06 16:30:06,399 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-12-06 16:30:06,399 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-12-06 16:30:06,399 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-12-06 16:30:06,403 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([323] L751-->L756: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][369], [111#L3-1true, 205#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 247#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 122#true, 88#L801true, 104#L776true, 36#L756true, 125#true, 260#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 182#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 208#(= ~a~0 1), P0Thread1of1ForFork2InUse, 141#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-12-06 16:30:06,403 INFO L382 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-12-06 16:30:06,403 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-06 16:30:06,403 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-06 16:30:06,403 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-06 16:30:06,404 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([339] L801-->L808: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_19 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd3~0_16 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_69 256) 0)))) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse2 (and .cse3 .cse5))) (and (= (ite .cse0 v_~y$w_buff0~0_30 (ite .cse1 v_~y$w_buff1~0_27 v_~y~0_44)) v_~y~0_43) (= v_~y$w_buff1_used~0_68 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_69)) (= (ite .cse0 0 v_~y$w_buff0_used~0_78) v_~y$w_buff0_used~0_77) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_18 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_68 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_16) v_~y$r_buff1_thd3~0_15) (= v_~y$r_buff0_thd3~0_18 (ite .cse2 0 v_~y$r_buff0_thd3~0_19))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_19, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y~0=v_~y~0_44, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y~0=v_~y~0_43, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][460], [111#L3-1true, 201#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 122#true, 104#L776true, 243#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 43#L751true, 125#true, 260#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 182#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 208#(= ~a~0 1), 27#L808true, P0Thread1of1ForFork2InUse, 141#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-12-06 16:30:06,404 INFO L382 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-12-06 16:30:06,404 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-06 16:30:06,404 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-06 16:30:06,404 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-06 16:30:06,558 INFO L130 PetriNetUnfolder]: 2834/6260 cut-off events. [2022-12-06 16:30:06,559 INFO L131 PetriNetUnfolder]: For 31112/33442 co-relation queries the response was YES. [2022-12-06 16:30:06,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27929 conditions, 6260 events. 2834/6260 cut-off events. For 31112/33442 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 56869 event pairs, 64 based on Foata normal form. 296/6386 useless extension candidates. Maximal degree in co-relation 27836. Up to 1548 conditions per place. [2022-12-06 16:30:06,602 INFO L137 encePairwiseOnDemand]: 105/111 looper letters, 29 selfloop transitions, 1 changer transitions 504/635 dead transitions. [2022-12-06 16:30:06,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 635 transitions, 8892 flow [2022-12-06 16:30:06,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 16:30:06,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 16:30:06,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 656 transitions. [2022-12-06 16:30:06,605 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8442728442728443 [2022-12-06 16:30:06,607 INFO L294 CegarLoopForPetriNet]: 116 programPoint places, 57 predicate places. [2022-12-06 16:30:06,607 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 635 transitions, 8892 flow [2022-12-06 16:30:06,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:06,609 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:30:06,609 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:30:06,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 16:30:06,610 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:30:06,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:30:06,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1291209270, now seen corresponding path program 2 times [2022-12-06 16:30:06,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:30:06,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878505769] [2022-12-06 16:30:06,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:30:06,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:30:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:30:07,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:30:07,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:30:07,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878505769] [2022-12-06 16:30:07,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878505769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:30:07,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:30:07,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-06 16:30:07,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309366292] [2022-12-06 16:30:07,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:30:07,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 16:30:07,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:30:07,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 16:30:07,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-06 16:30:07,791 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 111 [2022-12-06 16:30:07,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 635 transitions, 8892 flow. Second operand has 11 states, 11 states have (on average 80.54545454545455) internal successors, (886), 11 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:07,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:30:07,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 111 [2022-12-06 16:30:07,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:30:08,750 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([323] L751-->L756: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][163], [30#L773true, 201#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 122#true, 88#L801true, 243#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 50#L3true, 36#L756true, 125#true, 260#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 208#(= ~a~0 1), 182#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 271#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff1_thd0~0 0)), P0Thread1of1ForFork2InUse, 141#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-12-06 16:30:08,750 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-06 16:30:08,750 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:08,750 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:08,751 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:08,751 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([339] L801-->L808: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_19 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd3~0_16 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_69 256) 0)))) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse2 (and .cse3 .cse5))) (and (= (ite .cse0 v_~y$w_buff0~0_30 (ite .cse1 v_~y$w_buff1~0_27 v_~y~0_44)) v_~y~0_43) (= v_~y$w_buff1_used~0_68 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_69)) (= (ite .cse0 0 v_~y$w_buff0_used~0_78) v_~y$w_buff0_used~0_77) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_18 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_68 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_16) v_~y$r_buff1_thd3~0_15) (= v_~y$r_buff0_thd3~0_18 (ite .cse2 0 v_~y$r_buff0_thd3~0_19))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_19, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y~0=v_~y~0_44, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y~0=v_~y~0_43, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][523], [30#L773true, 122#true, 50#L3true, 43#L751true, 239#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 125#true, 260#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 208#(= ~a~0 1), 27#L808true, 271#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff1_thd0~0 0)), P0Thread1of1ForFork2InUse, 141#true, P1Thread1of1ForFork0InUse, 199#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork1InUse, 180#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:30:08,751 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-06 16:30:08,751 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:08,751 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:08,751 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:08,882 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([323] L751-->L756: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][163], [30#L773true, 201#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 111#L3-1true, 122#true, 88#L801true, 243#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 36#L756true, 125#true, 260#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 208#(= ~a~0 1), 182#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 271#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff1_thd0~0 0)), P0Thread1of1ForFork2InUse, 141#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-12-06 16:30:08,882 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-12-06 16:30:08,882 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:30:08,882 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:30:08,882 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:30:08,883 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([339] L801-->L808: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_19 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd3~0_16 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_69 256) 0)))) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse2 (and .cse3 .cse5))) (and (= (ite .cse0 v_~y$w_buff0~0_30 (ite .cse1 v_~y$w_buff1~0_27 v_~y~0_44)) v_~y~0_43) (= v_~y$w_buff1_used~0_68 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_69)) (= (ite .cse0 0 v_~y$w_buff0_used~0_78) v_~y$w_buff0_used~0_77) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_18 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_68 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_16) v_~y$r_buff1_thd3~0_15) (= v_~y$r_buff0_thd3~0_18 (ite .cse2 0 v_~y$r_buff0_thd3~0_19))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_19, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y~0=v_~y~0_44, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y~0=v_~y~0_43, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][523], [30#L773true, 111#L3-1true, 122#true, 43#L751true, 239#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 125#true, 260#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 208#(= ~a~0 1), 27#L808true, 271#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff1_thd0~0 0)), P0Thread1of1ForFork2InUse, 141#true, P1Thread1of1ForFork0InUse, 199#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 180#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork1InUse]) [2022-12-06 16:30:08,883 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-12-06 16:30:08,883 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:30:08,883 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:30:08,883 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:30:08,884 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([323] L751-->L756: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][462], [205#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 247#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 122#true, 104#L776true, 88#L801true, 50#L3true, 36#L756true, 125#true, 260#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 208#(= ~a~0 1), 182#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 271#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff1_thd0~0 0)), P0Thread1of1ForFork2InUse, 141#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-12-06 16:30:08,884 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-12-06 16:30:08,884 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:30:08,884 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:30:08,884 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:30:08,980 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([339] L801-->L808: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_19 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd3~0_16 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_69 256) 0)))) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse2 (and .cse3 .cse5))) (and (= (ite .cse0 v_~y$w_buff0~0_30 (ite .cse1 v_~y$w_buff1~0_27 v_~y~0_44)) v_~y~0_43) (= v_~y$w_buff1_used~0_68 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_69)) (= (ite .cse0 0 v_~y$w_buff0_used~0_78) v_~y$w_buff0_used~0_77) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_18 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_68 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_16) v_~y$r_buff1_thd3~0_15) (= v_~y$r_buff0_thd3~0_18 (ite .cse2 0 v_~y$r_buff0_thd3~0_19))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_19, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y~0=v_~y~0_44, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y~0=v_~y~0_43, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][586], [201#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 104#L776true, 122#true, 243#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 50#L3true, 43#L751true, 125#true, 260#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 182#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 208#(= ~a~0 1), 27#L808true, 271#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff1_thd0~0 0)), P0Thread1of1ForFork2InUse, 141#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-12-06 16:30:08,980 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is not cut-off event [2022-12-06 16:30:08,980 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-12-06 16:30:08,980 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-12-06 16:30:08,980 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-12-06 16:30:08,985 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([323] L751-->L756: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][462], [111#L3-1true, 205#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 247#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 122#true, 104#L776true, 88#L801true, 36#L756true, 125#true, 260#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 208#(= ~a~0 1), 182#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 271#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff1_thd0~0 0)), P0Thread1of1ForFork2InUse, 141#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-12-06 16:30:08,985 INFO L382 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-12-06 16:30:08,985 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-06 16:30:08,985 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-06 16:30:08,985 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-06 16:30:08,986 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([339] L801-->L808: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_19 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd3~0_16 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_69 256) 0)))) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse2 (and .cse3 .cse5))) (and (= (ite .cse0 v_~y$w_buff0~0_30 (ite .cse1 v_~y$w_buff1~0_27 v_~y~0_44)) v_~y~0_43) (= v_~y$w_buff1_used~0_68 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_69)) (= (ite .cse0 0 v_~y$w_buff0_used~0_78) v_~y$w_buff0_used~0_77) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_18 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_68 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_16) v_~y$r_buff1_thd3~0_15) (= v_~y$r_buff0_thd3~0_18 (ite .cse2 0 v_~y$r_buff0_thd3~0_19))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_19, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y~0=v_~y~0_44, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y~0=v_~y~0_43, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][586], [201#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 111#L3-1true, 104#L776true, 122#true, 243#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 43#L751true, 125#true, 260#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 182#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 208#(= ~a~0 1), 27#L808true, 271#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff1_thd0~0 0)), P0Thread1of1ForFork2InUse, 141#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-12-06 16:30:08,986 INFO L382 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-12-06 16:30:08,986 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-06 16:30:08,986 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-06 16:30:08,986 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-06 16:30:09,331 INFO L130 PetriNetUnfolder]: 4208/9449 cut-off events. [2022-12-06 16:30:09,331 INFO L131 PetriNetUnfolder]: For 59230/67676 co-relation queries the response was YES. [2022-12-06 16:30:09,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44249 conditions, 9449 events. 4208/9449 cut-off events. For 59230/67676 co-relation queries the response was YES. Maximal size of possible extension queue 808. Compared 92635 event pairs, 86 based on Foata normal form. 724/9975 useless extension candidates. Maximal degree in co-relation 44142. Up to 2212 conditions per place. [2022-12-06 16:30:09,374 INFO L137 encePairwiseOnDemand]: 102/111 looper letters, 27 selfloop transitions, 7 changer transitions 762/867 dead transitions. [2022-12-06 16:30:09,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 867 transitions, 14226 flow [2022-12-06 16:30:09,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 16:30:09,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 16:30:09,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 746 transitions. [2022-12-06 16:30:09,377 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7467467467467468 [2022-12-06 16:30:09,378 INFO L294 CegarLoopForPetriNet]: 116 programPoint places, 65 predicate places. [2022-12-06 16:30:09,378 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 867 transitions, 14226 flow [2022-12-06 16:30:09,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 80.54545454545455) internal successors, (886), 11 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:09,378 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:30:09,379 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:30:09,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 16:30:09,379 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:30:09,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:30:09,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1766026794, now seen corresponding path program 3 times [2022-12-06 16:30:09,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:30:09,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482503750] [2022-12-06 16:30:09,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:30:09,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:30:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 16:30:09,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 16:30:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 16:30:09,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 16:30:09,555 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 16:30:09,556 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 16:30:09,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 16:30:09,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 16:30:09,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 16:30:09,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 16:30:09,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 16:30:09,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 16:30:09,562 INFO L458 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2022-12-06 16:30:09,568 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 16:30:09,568 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 16:30:09,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:30:09 BasicIcfg [2022-12-06 16:30:09,710 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 16:30:09,710 INFO L158 Benchmark]: Toolchain (without parser) took 13013.63ms. Allocated memory was 195.0MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 170.2MB in the beginning and 1.0GB in the end (delta: -831.5MB). Peak memory consumption was 240.9MB. Max. memory is 8.0GB. [2022-12-06 16:30:09,712 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 195.0MB. Free memory is still 172.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 16:30:09,712 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.99ms. Allocated memory is still 195.0MB. Free memory was 170.2MB in the beginning and 143.7MB in the end (delta: 26.5MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 16:30:09,714 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.32ms. Allocated memory is still 195.0MB. Free memory was 143.7MB in the beginning and 141.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 16:30:09,715 INFO L158 Benchmark]: Boogie Preprocessor took 32.16ms. Allocated memory is still 195.0MB. Free memory was 141.1MB in the beginning and 139.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 16:30:09,715 INFO L158 Benchmark]: RCFGBuilder took 604.97ms. Allocated memory is still 195.0MB. Free memory was 139.0MB in the beginning and 106.5MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-06 16:30:09,715 INFO L158 Benchmark]: TraceAbstraction took 11802.15ms. Allocated memory was 195.0MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 105.5MB in the beginning and 1.0GB in the end (delta: -896.2MB). Peak memory consumption was 175.9MB. Max. memory is 8.0GB. [2022-12-06 16:30:09,718 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 195.0MB. Free memory is still 172.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 524.99ms. Allocated memory is still 195.0MB. Free memory was 170.2MB in the beginning and 143.7MB in the end (delta: 26.5MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.32ms. Allocated memory is still 195.0MB. Free memory was 143.7MB in the beginning and 141.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.16ms. Allocated memory is still 195.0MB. Free memory was 141.1MB in the beginning and 139.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 604.97ms. Allocated memory is still 195.0MB. Free memory was 139.0MB in the beginning and 106.5MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 11802.15ms. Allocated memory was 195.0MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 105.5MB in the beginning and 1.0GB in the end (delta: -896.2MB). Peak memory consumption was 175.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L715] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L717] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L718] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L719] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L721] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L723] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L724] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L725] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L726] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L727] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L728] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L729] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L730] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L731] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L732] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L733] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L734] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L735] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L736] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L737] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L738] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L739] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L742] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 0 pthread_t t1108; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1108={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L826] FCALL, FORK 0 pthread_create(&t1108, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1108, ((void *)0), P0, ((void *)0))=-2, t1108={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1109; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1108={5:0}, t1109={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L828] FCALL, FORK 0 pthread_create(&t1109, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1109, ((void *)0), P1, ((void *)0))=-1, t1108={5:0}, t1109={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L829] 0 pthread_t t1110; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1108={5:0}, t1109={6:0}, t1110={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t1110, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1110, ((void *)0), P2, ((void *)0))=0, t1108={5:0}, t1109={6:0}, t1110={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L782] 3 y$w_buff1 = y$w_buff0 [L783] 3 y$w_buff0 = 2 [L784] 3 y$w_buff1_used = y$w_buff0_used [L785] 3 y$w_buff0_used = (_Bool)1 [L786] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L786] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L787] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L788] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L789] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L790] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L791] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L794] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L804] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L806] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1108={5:0}, t1109={6:0}, t1110={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L837] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L838] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L839] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L840] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1108={5:0}, t1109={6:0}, t1110={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 y$flush_delayed = weak$$choice2 [L846] 0 y$mem_tmp = y [L847] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L848] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L849] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L850] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L851] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L853] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] 0 y = y$flush_delayed ? y$mem_tmp : y [L856] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1108={5:0}, t1109={6:0}, t1110={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 828]: 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: 830]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 139 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 530 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 530 mSDsluCounter, 481 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 377 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 926 IncrementalHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 104 mSDtfsCounter, 926 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14226occurred in iteration=9, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 784 NumberOfCodeBlocks, 784 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 688 ConstructedInterpolants, 0 QuantifiedInterpolants, 2809 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 16:30:09,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...