/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe019_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:30:37,762 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:30:37,764 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:30:37,823 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:30:37,825 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:30:37,826 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:30:37,828 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:30:37,829 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:30:37,830 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:30:37,831 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:30:37,831 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:30:37,832 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:30:37,832 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:30:37,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:30:37,834 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:30:37,834 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:30:37,835 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:30:37,835 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:30:37,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:30:37,838 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:30:37,839 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:30:37,845 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:30:37,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:30:37,847 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:30:37,849 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:30:37,849 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:30:37,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:30:37,850 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:30:37,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:30:37,852 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:30:37,852 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:30:37,853 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:30:37,853 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:30:37,854 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:30:37,854 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:30:37,854 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:30:37,855 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:30:37,855 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:30:37,855 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:30:37,856 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:30:37,856 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:30:37,857 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:30:37,874 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:30:37,875 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:30:37,876 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:30:37,876 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:30:37,876 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:30:37,876 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:30:37,876 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:30:37,877 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:30:37,877 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:30:37,877 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:30:37,877 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:30:37,877 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:30:37,877 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:30:37,878 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:30:37,878 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:30:37,878 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:30:37,878 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:30:37,878 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:30:37,878 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:30:37,879 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:30:37,879 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:30:37,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:30:37,879 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:30:37,879 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:30:37,879 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:30:37,880 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:30:37,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:30:37,880 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:30:37,880 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:30:38,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:30:38,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:30:38,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:30:38,239 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:30:38,240 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:30:38,241 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_power.opt.i [2022-12-06 04:30:39,390 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:30:39,637 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:30:39,637 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_power.opt.i [2022-12-06 04:30:39,667 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dea61b36/d6cbca6d94f7424e976e5b375457be53/FLAG0b1e0242c [2022-12-06 04:30:39,686 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dea61b36/d6cbca6d94f7424e976e5b375457be53 [2022-12-06 04:30:39,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:30:39,690 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:30:39,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:30:39,693 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:30:39,696 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:30:39,697 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:30:39" (1/1) ... [2022-12-06 04:30:39,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ee5bf8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:39, skipping insertion in model container [2022-12-06 04:30:39,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:30:39" (1/1) ... [2022-12-06 04:30:39,704 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:30:39,762 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:30:39,929 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/safe019_power.opt.i[994,1007] [2022-12-06 04:30:40,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:30:40,126 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:30:40,133 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/safe019_power.opt.i[994,1007] [2022-12-06 04:30:40,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:40,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:40,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:30:40,207 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:30:40,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:40 WrapperNode [2022-12-06 04:30:40,208 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:30:40,209 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:30:40,209 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:30:40,209 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:30:40,213 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:30:40" (1/1) ... [2022-12-06 04:30:40,227 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:30:40" (1/1) ... [2022-12-06 04:30:40,243 INFO L138 Inliner]: procedures = 177, calls = 88, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 193 [2022-12-06 04:30:40,244 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:30:40,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:30:40,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:30:40,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:30:40,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:40" (1/1) ... [2022-12-06 04:30:40,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:40" (1/1) ... [2022-12-06 04:30:40,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:40" (1/1) ... [2022-12-06 04:30:40,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:40" (1/1) ... [2022-12-06 04:30:40,262 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:40" (1/1) ... [2022-12-06 04:30:40,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:40" (1/1) ... [2022-12-06 04:30:40,266 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:40" (1/1) ... [2022-12-06 04:30:40,267 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:40" (1/1) ... [2022-12-06 04:30:40,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:30:40,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:30:40,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:30:40,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:30:40,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:40" (1/1) ... [2022-12-06 04:30:40,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:30:40,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:30:40,304 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:30:40,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:30:40,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:30:40,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:30:40,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:30:40,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:30:40,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:30:40,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:30:40,330 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:30:40,330 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:30:40,330 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:30:40,330 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:30:40,330 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:30:40,331 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:30:40,331 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 04:30:40,331 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 04:30:40,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:30:40,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:30:40,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:30:40,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:30:40,332 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:30:40,453 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:30:40,454 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:30:40,929 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:30:41,233 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:30:41,233 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:30:41,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:30:41 BoogieIcfgContainer [2022-12-06 04:30:41,237 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:30:41,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:30:41,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:30:41,242 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:30:41,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:30:39" (1/3) ... [2022-12-06 04:30:41,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174b5691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:30:41, skipping insertion in model container [2022-12-06 04:30:41,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:40" (2/3) ... [2022-12-06 04:30:41,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174b5691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:30:41, skipping insertion in model container [2022-12-06 04:30:41,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:30:41" (3/3) ... [2022-12-06 04:30:41,245 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_power.opt.i [2022-12-06 04:30:41,262 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:30:41,263 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:30:41,263 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:30:41,337 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:30:41,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 145 transitions, 310 flow [2022-12-06 04:30:41,442 INFO L130 PetriNetUnfolder]: 2/141 cut-off events. [2022-12-06 04:30:41,443 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:30:41,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 2/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2022-12-06 04:30:41,448 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 145 transitions, 310 flow [2022-12-06 04:30:41,451 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 141 transitions, 294 flow [2022-12-06 04:30:41,452 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:41,467 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 141 transitions, 294 flow [2022-12-06 04:30:41,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 141 transitions, 294 flow [2022-12-06 04:30:41,504 INFO L130 PetriNetUnfolder]: 2/141 cut-off events. [2022-12-06 04:30:41,505 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:30:41,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 2/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2022-12-06 04:30:41,510 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 141 transitions, 294 flow [2022-12-06 04:30:41,511 INFO L188 LiptonReduction]: Number of co-enabled transitions 2664 [2022-12-06 04:31:02,967 INFO L203 LiptonReduction]: Total number of compositions: 115 [2022-12-06 04:31:02,979 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:31:02,984 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e9941e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:31:02,984 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 04:31:02,986 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2022-12-06 04:31:02,987 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:31:02,987 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:02,987 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 04:31:02,987 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:31:02,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:02,991 INFO L85 PathProgramCache]: Analyzing trace with hash 909453450, now seen corresponding path program 1 times [2022-12-06 04:31:02,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:02,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110061100] [2022-12-06 04:31:02,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:02,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:03,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:31:03,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:03,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110061100] [2022-12-06 04:31:03,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110061100] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:03,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:03,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:31:03,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579925796] [2022-12-06 04:31:03,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:03,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:31:03,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:03,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:31:03,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:31:03,389 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 04:31:03,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:03,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:03,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 04:31:03,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:04,386 INFO L130 PetriNetUnfolder]: 4863/6660 cut-off events. [2022-12-06 04:31:04,386 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2022-12-06 04:31:04,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13484 conditions, 6660 events. 4863/6660 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 33239 event pairs, 888 based on Foata normal form. 0/6064 useless extension candidates. Maximal degree in co-relation 13472. Up to 5308 conditions per place. [2022-12-06 04:31:04,414 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 37 selfloop transitions, 2 changer transitions 8/48 dead transitions. [2022-12-06 04:31:04,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 208 flow [2022-12-06 04:31:04,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:31:04,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:31:04,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-06 04:31:04,422 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5913978494623656 [2022-12-06 04:31:04,423 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 55 transitions. [2022-12-06 04:31:04,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 208 flow [2022-12-06 04:31:04,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 202 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:31:04,427 INFO L231 Difference]: Finished difference. Result has 39 places, 24 transitions, 60 flow [2022-12-06 04:31:04,429 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2022-12-06 04:31:04,431 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2022-12-06 04:31:04,431 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:04,432 INFO L89 Accepts]: Start accepts. Operand has 39 places, 24 transitions, 60 flow [2022-12-06 04:31:04,433 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:04,433 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:04,434 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 24 transitions, 60 flow [2022-12-06 04:31:04,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 24 transitions, 60 flow [2022-12-06 04:31:04,439 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-12-06 04:31:04,440 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:31:04,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 33 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:31:04,440 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 24 transitions, 60 flow [2022-12-06 04:31:04,440 INFO L188 LiptonReduction]: Number of co-enabled transitions 280 [2022-12-06 04:31:04,633 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:31:04,635 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 204 [2022-12-06 04:31:04,636 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 60 flow [2022-12-06 04:31:04,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:04,636 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:04,636 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:04,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:31:04,639 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:31:04,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:04,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1027965312, now seen corresponding path program 1 times [2022-12-06 04:31:04,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:04,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481259743] [2022-12-06 04:31:04,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:04,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:04,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:31:04,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:04,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481259743] [2022-12-06 04:31:04,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481259743] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:04,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:04,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:31:04,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831897744] [2022-12-06 04:31:04,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:04,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:31:04,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:04,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:31:04,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:31:04,972 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 04:31:04,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 60 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:04,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:04,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 04:31:04,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:05,788 INFO L130 PetriNetUnfolder]: 3895/5344 cut-off events. [2022-12-06 04:31:05,788 INFO L131 PetriNetUnfolder]: For 357/357 co-relation queries the response was YES. [2022-12-06 04:31:05,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11254 conditions, 5344 events. 3895/5344 cut-off events. For 357/357 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 22540 event pairs, 967 based on Foata normal form. 32/5376 useless extension candidates. Maximal degree in co-relation 11244. Up to 4801 conditions per place. [2022-12-06 04:31:05,814 INFO L137 encePairwiseOnDemand]: 20/24 looper letters, 34 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2022-12-06 04:31:05,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 37 transitions, 164 flow [2022-12-06 04:31:05,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:31:05,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:31:05,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-06 04:31:05,816 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2022-12-06 04:31:05,816 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 60 flow. Second operand 3 states and 38 transitions. [2022-12-06 04:31:05,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 37 transitions, 164 flow [2022-12-06 04:31:05,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:31:05,818 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 75 flow [2022-12-06 04:31:05,818 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2022-12-06 04:31:05,819 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -7 predicate places. [2022-12-06 04:31:05,819 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:05,819 INFO L89 Accepts]: Start accepts. Operand has 36 places, 26 transitions, 75 flow [2022-12-06 04:31:05,819 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:05,819 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:05,820 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 26 transitions, 75 flow [2022-12-06 04:31:05,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 26 transitions, 75 flow [2022-12-06 04:31:05,825 INFO L130 PetriNetUnfolder]: 3/34 cut-off events. [2022-12-06 04:31:05,825 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:31:05,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 34 events. 3/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 62 event pairs, 1 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 49. Up to 10 conditions per place. [2022-12-06 04:31:05,826 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 26 transitions, 75 flow [2022-12-06 04:31:05,826 INFO L188 LiptonReduction]: Number of co-enabled transitions 306 [2022-12-06 04:31:05,836 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:31:05,837 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 04:31:05,837 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 75 flow [2022-12-06 04:31:05,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:05,837 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:05,837 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:05,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:31:05,837 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:31:05,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:05,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1802152517, now seen corresponding path program 1 times [2022-12-06 04:31:05,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:05,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320249474] [2022-12-06 04:31:05,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:05,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:06,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:31:06,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:06,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320249474] [2022-12-06 04:31:06,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320249474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:06,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:06,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:31:06,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813007007] [2022-12-06 04:31:06,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:06,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:31:06,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:06,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:31:06,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:31:06,070 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 04:31:06,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:06,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:06,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 04:31:06,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:06,683 INFO L130 PetriNetUnfolder]: 3559/4960 cut-off events. [2022-12-06 04:31:06,683 INFO L131 PetriNetUnfolder]: For 432/432 co-relation queries the response was YES. [2022-12-06 04:31:06,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10799 conditions, 4960 events. 3559/4960 cut-off events. For 432/432 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 21590 event pairs, 1031 based on Foata normal form. 48/5008 useless extension candidates. Maximal degree in co-relation 10788. Up to 3953 conditions per place. [2022-12-06 04:31:06,707 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 35 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2022-12-06 04:31:06,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 39 transitions, 180 flow [2022-12-06 04:31:06,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:31:06,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:31:06,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-06 04:31:06,709 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 04:31:06,709 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 75 flow. Second operand 3 states and 40 transitions. [2022-12-06 04:31:06,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 39 transitions, 180 flow [2022-12-06 04:31:06,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 39 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:31:06,710 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 80 flow [2022-12-06 04:31:06,710 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2022-12-06 04:31:06,711 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -5 predicate places. [2022-12-06 04:31:06,711 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:06,711 INFO L89 Accepts]: Start accepts. Operand has 38 places, 26 transitions, 80 flow [2022-12-06 04:31:06,712 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:06,712 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:06,712 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 26 transitions, 80 flow [2022-12-06 04:31:06,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 26 transitions, 80 flow [2022-12-06 04:31:06,718 INFO L130 PetriNetUnfolder]: 3/34 cut-off events. [2022-12-06 04:31:06,718 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 04:31:06,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 34 events. 3/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 62 event pairs, 1 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 52. Up to 10 conditions per place. [2022-12-06 04:31:06,719 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 26 transitions, 80 flow [2022-12-06 04:31:06,719 INFO L188 LiptonReduction]: Number of co-enabled transitions 304 [2022-12-06 04:31:06,720 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:31:06,720 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 04:31:06,720 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 80 flow [2022-12-06 04:31:06,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:06,721 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:06,721 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:06,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:31:06,721 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:31:06,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:06,721 INFO L85 PathProgramCache]: Analyzing trace with hash -32204889, now seen corresponding path program 1 times [2022-12-06 04:31:06,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:06,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147877022] [2022-12-06 04:31:06,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:06,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:06,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:31:06,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:06,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147877022] [2022-12-06 04:31:06,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147877022] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:06,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:06,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:31:06,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304607561] [2022-12-06 04:31:06,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:06,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:31:06,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:06,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:31:06,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:31:06,858 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 04:31:06,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:06,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:06,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 04:31:06,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:07,436 INFO L130 PetriNetUnfolder]: 3226/4493 cut-off events. [2022-12-06 04:31:07,437 INFO L131 PetriNetUnfolder]: For 1105/1112 co-relation queries the response was YES. [2022-12-06 04:31:07,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10247 conditions, 4493 events. 3226/4493 cut-off events. For 1105/1112 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 21161 event pairs, 594 based on Foata normal form. 63/4551 useless extension candidates. Maximal degree in co-relation 10234. Up to 3703 conditions per place. [2022-12-06 04:31:07,465 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 40 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2022-12-06 04:31:07,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 44 transitions, 213 flow [2022-12-06 04:31:07,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:31:07,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:31:07,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-06 04:31:07,467 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2022-12-06 04:31:07,467 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 80 flow. Second operand 3 states and 44 transitions. [2022-12-06 04:31:07,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 44 transitions, 213 flow [2022-12-06 04:31:07,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 44 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:31:07,469 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 84 flow [2022-12-06 04:31:07,469 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2022-12-06 04:31:07,470 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2022-12-06 04:31:07,471 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:07,471 INFO L89 Accepts]: Start accepts. Operand has 39 places, 26 transitions, 84 flow [2022-12-06 04:31:07,471 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:07,471 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:07,472 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 26 transitions, 84 flow [2022-12-06 04:31:07,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 26 transitions, 84 flow [2022-12-06 04:31:07,479 INFO L130 PetriNetUnfolder]: 3/34 cut-off events. [2022-12-06 04:31:07,479 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 04:31:07,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 34 events. 3/34 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 61 event pairs, 1 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 56. Up to 10 conditions per place. [2022-12-06 04:31:07,480 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 26 transitions, 84 flow [2022-12-06 04:31:07,480 INFO L188 LiptonReduction]: Number of co-enabled transitions 302 [2022-12-06 04:31:07,481 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:31:07,485 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 04:31:07,485 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 84 flow [2022-12-06 04:31:07,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:07,485 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:07,485 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:07,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:31:07,485 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:31:07,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:07,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1332004550, now seen corresponding path program 1 times [2022-12-06 04:31:07,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:07,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583782916] [2022-12-06 04:31:07,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:07,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:07,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:07,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:31:07,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:07,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583782916] [2022-12-06 04:31:07,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583782916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:07,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:07,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:31:07,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816400034] [2022-12-06 04:31:07,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:07,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:31:07,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:07,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:31:07,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:31:07,679 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 04:31:07,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 84 flow. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:07,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:07,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 04:31:07,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:08,818 INFO L130 PetriNetUnfolder]: 6721/9394 cut-off events. [2022-12-06 04:31:08,819 INFO L131 PetriNetUnfolder]: For 3405/3405 co-relation queries the response was YES. [2022-12-06 04:31:08,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21130 conditions, 9394 events. 6721/9394 cut-off events. For 3405/3405 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 47141 event pairs, 2347 based on Foata normal form. 396/9790 useless extension candidates. Maximal degree in co-relation 21116. Up to 3773 conditions per place. [2022-12-06 04:31:08,848 INFO L137 encePairwiseOnDemand]: 20/24 looper letters, 36 selfloop transitions, 3 changer transitions 26/65 dead transitions. [2022-12-06 04:31:08,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 65 transitions, 301 flow [2022-12-06 04:31:08,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:31:08,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:31:08,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-12-06 04:31:08,849 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5583333333333333 [2022-12-06 04:31:08,849 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 84 flow. Second operand 5 states and 67 transitions. [2022-12-06 04:31:08,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 65 transitions, 301 flow [2022-12-06 04:31:08,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 65 transitions, 295 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:31:08,852 INFO L231 Difference]: Finished difference. Result has 44 places, 26 transitions, 97 flow [2022-12-06 04:31:08,852 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=97, PETRI_PLACES=44, PETRI_TRANSITIONS=26} [2022-12-06 04:31:08,853 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2022-12-06 04:31:08,853 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:08,853 INFO L89 Accepts]: Start accepts. Operand has 44 places, 26 transitions, 97 flow [2022-12-06 04:31:08,854 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:08,854 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:08,854 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 26 transitions, 97 flow [2022-12-06 04:31:08,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 26 transitions, 97 flow [2022-12-06 04:31:08,860 INFO L130 PetriNetUnfolder]: 1/44 cut-off events. [2022-12-06 04:31:08,861 INFO L131 PetriNetUnfolder]: For 57/62 co-relation queries the response was YES. [2022-12-06 04:31:08,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 44 events. 1/44 cut-off events. For 57/62 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 1 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 82. Up to 11 conditions per place. [2022-12-06 04:31:08,861 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 26 transitions, 97 flow [2022-12-06 04:31:08,861 INFO L188 LiptonReduction]: Number of co-enabled transitions 296 [2022-12-06 04:31:08,862 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:31:08,863 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 04:31:08,863 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 26 transitions, 97 flow [2022-12-06 04:31:08,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:08,863 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:08,863 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:08,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:31:08,863 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:31:08,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:08,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1482500311, now seen corresponding path program 1 times [2022-12-06 04:31:08,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:08,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143816094] [2022-12-06 04:31:08,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:08,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:09,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:31:09,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:09,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143816094] [2022-12-06 04:31:09,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143816094] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:09,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:09,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:31:09,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052433380] [2022-12-06 04:31:09,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:09,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:31:09,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:09,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:31:09,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:31:09,083 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 04:31:09,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 26 transitions, 97 flow. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:09,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:09,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 04:31:09,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:10,375 INFO L130 PetriNetUnfolder]: 6700/9409 cut-off events. [2022-12-06 04:31:10,375 INFO L131 PetriNetUnfolder]: For 7301/7301 co-relation queries the response was YES. [2022-12-06 04:31:10,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21950 conditions, 9409 events. 6700/9409 cut-off events. For 7301/7301 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 47247 event pairs, 1303 based on Foata normal form. 144/9553 useless extension candidates. Maximal degree in co-relation 21934. Up to 4812 conditions per place. [2022-12-06 04:31:10,398 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 40 selfloop transitions, 4 changer transitions 6/50 dead transitions. [2022-12-06 04:31:10,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 50 transitions, 257 flow [2022-12-06 04:31:10,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:31:10,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:31:10,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-06 04:31:10,399 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.53125 [2022-12-06 04:31:10,399 INFO L175 Difference]: Start difference. First operand has 42 places, 26 transitions, 97 flow. Second operand 4 states and 51 transitions. [2022-12-06 04:31:10,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 50 transitions, 257 flow [2022-12-06 04:31:10,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 50 transitions, 247 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 04:31:10,413 INFO L231 Difference]: Finished difference. Result has 43 places, 26 transitions, 101 flow [2022-12-06 04:31:10,413 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=43, PETRI_TRANSITIONS=26} [2022-12-06 04:31:10,415 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2022-12-06 04:31:10,415 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:10,415 INFO L89 Accepts]: Start accepts. Operand has 43 places, 26 transitions, 101 flow [2022-12-06 04:31:10,416 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:10,416 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:10,416 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 26 transitions, 101 flow [2022-12-06 04:31:10,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 26 transitions, 101 flow [2022-12-06 04:31:10,422 INFO L130 PetriNetUnfolder]: 0/40 cut-off events. [2022-12-06 04:31:10,422 INFO L131 PetriNetUnfolder]: For 35/40 co-relation queries the response was YES. [2022-12-06 04:31:10,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 40 events. 0/40 cut-off events. For 35/40 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 110 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2022-12-06 04:31:10,423 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 26 transitions, 101 flow [2022-12-06 04:31:10,423 INFO L188 LiptonReduction]: Number of co-enabled transitions 246 [2022-12-06 04:31:10,426 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [873] $Ultimate##0-->L858: Formula: (and (= v_~y~0_45 2) (= |v_P3Thread1of1ForFork0_#in~arg.base_5| v_P3Thread1of1ForFork0_~arg.base_5) (= v_P3Thread1of1ForFork0_~arg.offset_5 |v_P3Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|} OutVars{P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_~arg.offset=v_P3Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_45, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|, P3Thread1of1ForFork0_~arg.base=v_P3Thread1of1ForFork0_~arg.base_5} AuxVars[] AssignedVars[P3Thread1of1ForFork0_~arg.offset, ~y~0, P3Thread1of1ForFork0_~arg.base] and [849] $Ultimate##0-->L767: Formula: (and (= |v_P0Thread1of1ForFork3_#in~arg.offset_5| v_P0Thread1of1ForFork3_~arg.offset_5) (= v_P0Thread1of1ForFork3_~arg.base_5 |v_P0Thread1of1ForFork3_#in~arg.base_5|) (= v_~y~0_28 v_~__unbuffered_p0_EAX~0_24)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_5|, ~y~0=v_~y~0_28, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_5|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_5|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_5, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_5, ~y~0=v_~y~0_28, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_5|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_~arg.offset] [2022-12-06 04:31:10,454 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:31:10,455 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-06 04:31:10,455 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 26 transitions, 107 flow [2022-12-06 04:31:10,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:10,455 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:10,455 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:10,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:31:10,455 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:31:10,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:10,459 INFO L85 PathProgramCache]: Analyzing trace with hash 663352248, now seen corresponding path program 1 times [2022-12-06 04:31:10,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:10,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20543960] [2022-12-06 04:31:10,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:10,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:11,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:31:11,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:11,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20543960] [2022-12-06 04:31:11,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20543960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:11,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:11,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:31:11,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065485127] [2022-12-06 04:31:11,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:11,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:31:11,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:11,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:31:11,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:31:11,356 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 04:31:11,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 26 transitions, 107 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:11,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:11,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 04:31:11,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:12,168 INFO L130 PetriNetUnfolder]: 3256/4732 cut-off events. [2022-12-06 04:31:12,169 INFO L131 PetriNetUnfolder]: For 3076/3076 co-relation queries the response was YES. [2022-12-06 04:31:12,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11114 conditions, 4732 events. 3256/4732 cut-off events. For 3076/3076 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 24109 event pairs, 1212 based on Foata normal form. 72/4804 useless extension candidates. Maximal degree in co-relation 11098. Up to 3435 conditions per place. [2022-12-06 04:31:12,187 INFO L137 encePairwiseOnDemand]: 15/25 looper letters, 54 selfloop transitions, 10 changer transitions 0/66 dead transitions. [2022-12-06 04:31:12,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 66 transitions, 373 flow [2022-12-06 04:31:12,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:31:12,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:31:12,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-12-06 04:31:12,189 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.568 [2022-12-06 04:31:12,189 INFO L175 Difference]: Start difference. First operand has 43 places, 26 transitions, 107 flow. Second operand 5 states and 71 transitions. [2022-12-06 04:31:12,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 66 transitions, 373 flow [2022-12-06 04:31:12,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 66 transitions, 335 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-12-06 04:31:12,193 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 160 flow [2022-12-06 04:31:12,193 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=160, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2022-12-06 04:31:12,193 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2022-12-06 04:31:12,193 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:12,193 INFO L89 Accepts]: Start accepts. Operand has 47 places, 34 transitions, 160 flow [2022-12-06 04:31:12,194 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:12,194 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:12,194 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 34 transitions, 160 flow [2022-12-06 04:31:12,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 34 transitions, 160 flow [2022-12-06 04:31:12,271 INFO L130 PetriNetUnfolder]: 329/635 cut-off events. [2022-12-06 04:31:12,272 INFO L131 PetriNetUnfolder]: For 618/662 co-relation queries the response was YES. [2022-12-06 04:31:12,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1518 conditions, 635 events. 329/635 cut-off events. For 618/662 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3488 event pairs, 205 based on Foata normal form. 2/588 useless extension candidates. Maximal degree in co-relation 1503. Up to 463 conditions per place. [2022-12-06 04:31:12,276 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 34 transitions, 160 flow [2022-12-06 04:31:12,276 INFO L188 LiptonReduction]: Number of co-enabled transitions 304 [2022-12-06 04:31:12,459 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [840] $Ultimate##0-->L805: Formula: (and (= v_~x$r_buff1_thd0~0_58 v_~x$r_buff0_thd0~0_58) (= v_~x$r_buff1_thd4~0_52 v_~x$r_buff0_thd4~0_54) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|) (= v_~x$r_buff0_thd3~0_149 v_~x$r_buff1_thd3~0_147) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| 0)) (= v_~x$w_buff0~0_182 v_~x$w_buff1~0_168) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_7| |v_P1Thread1of1ForFork1_~arg#1.offset_7|) (= v_~x$w_buff0_used~0_343 v_~x$w_buff1_used~0_326) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_7| |v_P1Thread1of1ForFork1_~arg#1.base_7|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_326 256) 0)) (not (= (mod v_~x$w_buff0_used~0_342 256) 0)))) 1 0)) (= v_~x$r_buff0_thd2~0_67 1) (= v_~x$r_buff1_thd2~0_50 v_~x$r_buff0_thd2~0_68) (= v_~x$r_buff1_thd1~0_76 v_~x$r_buff0_thd1~0_75) (= v_~x$w_buff0~0_181 1) (= v_~x$w_buff0_used~0_342 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_182, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_58, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_75, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_54, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_149, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_343, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_181, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_58, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_75, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_7|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_168, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_147, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_326, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_76, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_54, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_149, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_67, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_58, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_52, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_342, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$r_buff1_thd4~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] and [783] L841-->L848: Formula: (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_86 256) 0))) (let ((.cse3 (= (mod v_~x$r_buff1_thd3~0_82 256) 0)) (.cse4 (= (mod v_~x$w_buff1_used~0_219 256) 0)) (.cse10 (not (= (mod v_~x$w_buff0_used~0_230 256) 0))) (.cse2 (not .cse9)) (.cse8 (= (mod v_~x$w_buff0_used~0_231 256) 0))) (let ((.cse1 (not .cse8)) (.cse5 (select |v_#memory_int_218| |v_~#x~0.base_158|)) (.cse11 (and .cse10 .cse2)) (.cse6 (not .cse4)) (.cse7 (not .cse3))) (and (let ((.cse0 (= |v_P2_#t~mem30_36| |v_P2Thread1of1ForFork2_#t~mem30_1|))) (or (and .cse0 (= |v_P2_#t~ite32_27| v_~x$w_buff0~0_93) .cse1 (= |v_P2Thread1of1ForFork2_#t~ite31_1| |v_P2_#t~ite31_31|) .cse2) (and (= |v_P2_#t~ite31_31| |v_P2_#t~ite32_27|) (or (and (= |v_P2_#t~ite31_31| |v_P2_#t~mem30_36|) (or .cse3 .cse4) (= |v_P2_#t~mem30_36| (select .cse5 |v_~#x~0.offset_158|))) (and .cse6 .cse0 (= |v_P2_#t~ite31_31| v_~x$w_buff1~0_80) .cse7)) (or .cse8 .cse9)))) (= v_~x$w_buff0_used~0_230 (ite (and .cse1 .cse2) 0 v_~x$w_buff0_used~0_231)) (= v_~x$r_buff1_thd3~0_81 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_218 256) 0)) .cse7) (and .cse10 (not (= (mod v_~x$r_buff0_thd3~0_85 256) 0)))) 0 v_~x$r_buff1_thd3~0_82)) (= (store |v_#memory_int_218| |v_~#x~0.base_158| (store .cse5 |v_~#x~0.offset_158| |v_P2_#t~ite32_27|)) |v_#memory_int_217|) (= (ite .cse11 0 v_~x$r_buff0_thd3~0_86) v_~x$r_buff0_thd3~0_85) (= (ite (or .cse11 (and .cse6 .cse7)) 0 v_~x$w_buff1_used~0_219) v_~x$w_buff1_used~0_218))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_93, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_1|, ~#x~0.offset=|v_~#x~0.offset_158|, ~x$w_buff1~0=v_~x$w_buff1~0_80, #memory_int=|v_#memory_int_218|, ~#x~0.base=|v_~#x~0.base_158|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_82, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_219, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_86, P2Thread1of1ForFork2_#t~mem30=|v_P2Thread1of1ForFork2_#t~mem30_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_231} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_93, ~#x~0.offset=|v_~#x~0.offset_158|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_1|, ~x$w_buff1~0=v_~x$w_buff1~0_80, #memory_int=|v_#memory_int_217|, ~#x~0.base=|v_~#x~0.base_158|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_81, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_218, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_85, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_230} AuxVars[|v_P2_#t~ite31_31|, |v_P2_#t~mem30_36|, |v_P2_#t~ite32_27|] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite32, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~mem30, ~x$w_buff0_used~0] [2022-12-06 04:31:12,908 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [840] $Ultimate##0-->L805: Formula: (and (= v_~x$r_buff1_thd0~0_58 v_~x$r_buff0_thd0~0_58) (= v_~x$r_buff1_thd4~0_52 v_~x$r_buff0_thd4~0_54) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|) (= v_~x$r_buff0_thd3~0_149 v_~x$r_buff1_thd3~0_147) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| 0)) (= v_~x$w_buff0~0_182 v_~x$w_buff1~0_168) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_7| |v_P1Thread1of1ForFork1_~arg#1.offset_7|) (= v_~x$w_buff0_used~0_343 v_~x$w_buff1_used~0_326) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_7| |v_P1Thread1of1ForFork1_~arg#1.base_7|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_326 256) 0)) (not (= (mod v_~x$w_buff0_used~0_342 256) 0)))) 1 0)) (= v_~x$r_buff0_thd2~0_67 1) (= v_~x$r_buff1_thd2~0_50 v_~x$r_buff0_thd2~0_68) (= v_~x$r_buff1_thd1~0_76 v_~x$r_buff0_thd1~0_75) (= v_~x$w_buff0~0_181 1) (= v_~x$w_buff0_used~0_342 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_182, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_58, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_75, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_54, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_149, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_343, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_181, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_58, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_75, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_7|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_168, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_147, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_326, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_76, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_54, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_149, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_67, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_58, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_52, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_342, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$r_buff1_thd4~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] and [844] L3-->L900: Formula: (let ((.cse5 (= (mod v_~x$r_buff0_thd0~0_65 256) 0))) (let ((.cse10 (not .cse5)) (.cse0 (not (= (mod v_~x$w_buff0_used~0_350 256) 0))) (.cse4 (= (mod v_~x$w_buff0_used~0_351 256) 0)) (.cse6 (= (mod v_~x$w_buff1_used~0_333 256) 0)) (.cse7 (= (mod v_~x$r_buff1_thd0~0_65 256) 0))) (let ((.cse1 (not .cse7)) (.cse3 (not .cse6)) (.cse11 (not .cse4)) (.cse8 (select |v_#memory_int_362| |v_~#x~0.base_222|)) (.cse2 (and .cse10 .cse0))) (and (= v_~x$r_buff1_thd0~0_64 (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd0~0_64 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_332 256) 0)) .cse1)) 0 v_~x$r_buff1_thd0~0_65)) (= v_~x$w_buff1_used~0_332 (ite (or .cse2 (and .cse1 .cse3)) 0 v_~x$w_buff1_used~0_333)) (let ((.cse9 (= |v_ULTIMATE.start_main_#t~mem44#1_57| |v_ULTIMATE.start_main_#t~mem44#1_55|))) (or (and (or .cse4 .cse5) (= |v_ULTIMATE.start_main_#t~ite45#1_54| |v_ULTIMATE.start_main_#t~ite46#1_43|) (or (and (= |v_ULTIMATE.start_main_#t~ite45#1_54| |v_ULTIMATE.start_main_#t~mem44#1_55|) (or .cse6 .cse7) (= (select .cse8 |v_~#x~0.offset_222|) |v_ULTIMATE.start_main_#t~mem44#1_55|)) (and (= |v_ULTIMATE.start_main_#t~ite45#1_54| v_~x$w_buff1~0_172) .cse1 .cse3 .cse9))) (and (= |v_ULTIMATE.start_main_#t~ite46#1_43| v_~x$w_buff0~0_187) .cse10 .cse11 (= |v_ULTIMATE.start_main_#t~ite45#1_56| |v_ULTIMATE.start_main_#t~ite45#1_54|) .cse9))) (= (ite (and .cse10 .cse11) 0 v_~x$w_buff0_used~0_351) v_~x$w_buff0_used~0_350) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|) (= (store |v_#memory_int_362| |v_~#x~0.base_222| (store .cse8 |v_~#x~0.offset_222| |v_ULTIMATE.start_main_#t~ite46#1_43|)) |v_#memory_int_361|) (= (ite .cse2 0 v_~x$r_buff0_thd0~0_65) v_~x$r_buff0_thd0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_187, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_57|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_65, ~#x~0.offset=|v_~#x~0.offset_222|, ULTIMATE.start_main_#t~ite45#1=|v_ULTIMATE.start_main_#t~ite45#1_56|, ~x$w_buff1~0=v_~x$w_buff1~0_172, #memory_int=|v_#memory_int_362|, ~#x~0.base=|v_~#x~0.base_222|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_333, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_65, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_351, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_187, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~#x~0.offset=|v_~#x~0.offset_222|, ~x$w_buff1~0=v_~x$w_buff1~0_172, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_332, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_64, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_350, ULTIMATE.start_main_#t~ite46#1=|v_ULTIMATE.start_main_#t~ite46#1_42|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|, #memory_int=|v_#memory_int_361|, ~#x~0.base=|v_~#x~0.base_222|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} AuxVars[|v_ULTIMATE.start_main_#t~ite46#1_43|, |v_ULTIMATE.start_main_#t~mem44#1_55|, |v_ULTIMATE.start_main_#t~ite45#1_54|] AssignedVars[ULTIMATE.start_main_#t~mem44#1, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite46#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite45#1, #memory_int, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] [2022-12-06 04:31:13,371 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [840] $Ultimate##0-->L805: Formula: (and (= v_~x$r_buff1_thd0~0_58 v_~x$r_buff0_thd0~0_58) (= v_~x$r_buff1_thd4~0_52 v_~x$r_buff0_thd4~0_54) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|) (= v_~x$r_buff0_thd3~0_149 v_~x$r_buff1_thd3~0_147) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| 0)) (= v_~x$w_buff0~0_182 v_~x$w_buff1~0_168) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_7| |v_P1Thread1of1ForFork1_~arg#1.offset_7|) (= v_~x$w_buff0_used~0_343 v_~x$w_buff1_used~0_326) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_7| |v_P1Thread1of1ForFork1_~arg#1.base_7|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_326 256) 0)) (not (= (mod v_~x$w_buff0_used~0_342 256) 0)))) 1 0)) (= v_~x$r_buff0_thd2~0_67 1) (= v_~x$r_buff1_thd2~0_50 v_~x$r_buff0_thd2~0_68) (= v_~x$r_buff1_thd1~0_76 v_~x$r_buff0_thd1~0_75) (= v_~x$w_buff0~0_181 1) (= v_~x$w_buff0_used~0_342 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_182, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_58, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_75, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_54, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_149, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_343, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_181, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_58, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_75, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_7|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_168, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_147, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_326, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_76, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_54, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_149, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_67, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_58, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_52, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_342, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$r_buff1_thd4~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] and [789] L858-->L865: Formula: (let ((.cse7 (= (mod v_~x$r_buff0_thd4~0_41 256) 0))) (let ((.cse8 (= (mod v_~x$w_buff0_used~0_223 256) 0)) (.cse2 (= (mod v_~x$r_buff1_thd4~0_37 256) 0)) (.cse9 (not .cse7)) (.cse11 (not (= (mod v_~x$w_buff0_used~0_222 256) 0))) (.cse1 (= (mod v_~x$w_buff1_used~0_211 256) 0))) (let ((.cse5 (not .cse1)) (.cse0 (and .cse9 .cse11)) (.cse4 (not .cse2)) (.cse10 (not .cse8)) (.cse3 (select |v_#memory_int_210| |v_~#x~0.base_152|))) (and (= v_~x$r_buff0_thd4~0_40 (ite .cse0 0 v_~x$r_buff0_thd4~0_41)) (let ((.cse6 (= |v_P3_#t~mem33_34| |v_P3Thread1of1ForFork0_#t~mem33_1|))) (or (and (or (and (or .cse1 .cse2) (= (select .cse3 |v_~#x~0.offset_152|) |v_P3_#t~mem33_34|) (= |v_P3_#t~ite34_33| |v_P3_#t~mem33_34|)) (and .cse4 .cse5 .cse6 (= |v_P3_#t~ite34_33| v_~x$w_buff1~0_74))) (or .cse7 .cse8) (= |v_P3_#t~ite34_33| |v_P3_#t~ite35_25|)) (and .cse9 (= |v_P3_#t~ite34_33| |v_P3Thread1of1ForFork0_#t~ite34_1|) (= |v_P3_#t~ite35_25| v_~x$w_buff0~0_91) .cse10 .cse6))) (= (ite (or (and .cse4 .cse5) .cse0) 0 v_~x$w_buff1_used~0_211) v_~x$w_buff1_used~0_210) (= v_~x$r_buff1_thd4~0_36 (ite (or (and .cse11 (not (= (mod v_~x$r_buff0_thd4~0_40 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_210 256) 0)))) 0 v_~x$r_buff1_thd4~0_37)) (= v_~x$w_buff0_used~0_222 (ite (and .cse9 .cse10) 0 v_~x$w_buff0_used~0_223)) (= (store |v_#memory_int_210| |v_~#x~0.base_152| (store .cse3 |v_~#x~0.offset_152| |v_P3_#t~ite35_25|)) |v_#memory_int_209|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, ~#x~0.offset=|v_~#x~0.offset_152|, ~x$w_buff1~0=v_~x$w_buff1~0_74, #memory_int=|v_#memory_int_210|, ~#x~0.base=|v_~#x~0.base_152|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_211, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_41, P3Thread1of1ForFork0_#t~ite34=|v_P3Thread1of1ForFork0_#t~ite34_1|, P3Thread1of1ForFork0_#t~mem33=|v_P3Thread1of1ForFork0_#t~mem33_1|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_223} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_91, ~#x~0.offset=|v_~#x~0.offset_152|, ~x$w_buff1~0=v_~x$w_buff1~0_74, #memory_int=|v_#memory_int_209|, ~#x~0.base=|v_~#x~0.base_152|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, P3Thread1of1ForFork0_#t~ite35=|v_P3Thread1of1ForFork0_#t~ite35_1|, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_40, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_36, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_222} AuxVars[|v_P3_#t~ite35_25|, |v_P3_#t~ite34_33|, |v_P3_#t~mem33_34|] AssignedVars[#memory_int, ~x$w_buff1_used~0, P3Thread1of1ForFork0_#t~ite35, ~x$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~ite34, P3Thread1of1ForFork0_#t~mem33, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0] [2022-12-06 04:31:14,132 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [840] $Ultimate##0-->L805: Formula: (and (= v_~x$r_buff1_thd0~0_58 v_~x$r_buff0_thd0~0_58) (= v_~x$r_buff1_thd4~0_52 v_~x$r_buff0_thd4~0_54) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|) (= v_~x$r_buff0_thd3~0_149 v_~x$r_buff1_thd3~0_147) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| 0)) (= v_~x$w_buff0~0_182 v_~x$w_buff1~0_168) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_7| |v_P1Thread1of1ForFork1_~arg#1.offset_7|) (= v_~x$w_buff0_used~0_343 v_~x$w_buff1_used~0_326) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_7| |v_P1Thread1of1ForFork1_~arg#1.base_7|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_326 256) 0)) (not (= (mod v_~x$w_buff0_used~0_342 256) 0)))) 1 0)) (= v_~x$r_buff0_thd2~0_67 1) (= v_~x$r_buff1_thd2~0_50 v_~x$r_buff0_thd2~0_68) (= v_~x$r_buff1_thd1~0_76 v_~x$r_buff0_thd1~0_75) (= v_~x$w_buff0~0_181 1) (= v_~x$w_buff0_used~0_342 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_182, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_58, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_75, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_54, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_149, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_343, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_181, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_58, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_75, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_7|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_168, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_147, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_326, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_76, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_54, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_149, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_67, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_58, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_52, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_342, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$r_buff1_thd4~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] and [769] L767-->L783: Formula: (let ((.cse5 (= (mod v_~x$r_buff1_thd1~0_59 256) 0)) (.cse7 (= (mod v_~x$w_buff1_used~0_241 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_253 256) 0)) (.cse14 (= (mod v_~x$r_buff0_thd1~0_60 256) 0))) (let ((.cse0 (= (mod v_~weak$$choice2~0_74 256) 0)) (.cse15 (select |v_#memory_int_248| |v_~#x~0.base_174|)) (.cse6 (not .cse14)) (.cse8 (not .cse16)) (.cse12 (and .cse7 .cse14)) (.cse13 (and .cse5 .cse14))) (let ((.cse10 (or .cse16 .cse12 .cse13)) (.cse9 (and .cse6 .cse8)) (.cse11 (select .cse15 |v_~#x~0.offset_174|)) (.cse1 (not .cse0)) (.cse2 (= (mod v_~x$w_buff1_used~0_240 256) 0)) (.cse4 (= (mod v_~x$w_buff0_used~0_252 256) 0))) (and (or (and (= v_~__unbuffered_p0_EBX~0_24 |v_P0_#t~mem9_32|) (= |v_P0_#t~ite10_29| |v_P0_#t~mem9_32|) .cse0) (and .cse1 (= |v_P0Thread1of1ForFork3_#t~mem9_1| |v_P0_#t~mem9_32|) (= |v_P0_#t~ite10_29| v_~x$mem_tmp~0_38))) (= v_~x$flush_delayed~0_56 0) (= v_~x$r_buff1_thd1~0_58 (ite .cse1 v_~x$r_buff1_thd1~0_59 (ite (let ((.cse3 (= (mod v_~x$r_buff0_thd1~0_59 256) 0))) (or (and .cse2 .cse3) .cse4 (and .cse5 .cse3))) v_~x$r_buff1_thd1~0_59 0))) (or (and (= |v_P0Thread1of1ForFork3_#t~mem6_1| |v_P0_#t~mem6_34|) (or .cse6 (not .cse7)) (or .cse6 (not .cse5)) .cse8 (= v_~__unbuffered_p0_EBX~0_24 (ite .cse9 v_~x$w_buff0~0_114 v_~x$w_buff1~0_101))) (and .cse10 (= .cse11 |v_P0_#t~mem6_34|) (= v_~__unbuffered_p0_EBX~0_24 |v_P0_#t~mem6_34|))) (= v_~weak$$choice2~0_74 |v_P0Thread1of1ForFork3_#t~nondet4_1|) (= v_~weak$$choice0~0_58 |v_P0Thread1of1ForFork3_#t~nondet3_1|) (= (ite .cse1 v_~x$w_buff0_used~0_253 (ite .cse10 v_~x$w_buff0_used~0_253 (ite .cse9 0 v_~x$w_buff0_used~0_253))) v_~x$w_buff0_used~0_252) (= (ite .cse1 v_~x$w_buff1_used~0_241 (ite (or .cse12 .cse13 .cse4) v_~x$w_buff1_used~0_241 0)) v_~x$w_buff1_used~0_240) (= v_~x$mem_tmp~0_38 .cse11) (= v_~x$w_buff1~0_101 v_~x$w_buff1~0_100) (= (ite .cse1 v_~x$r_buff0_thd1~0_60 (ite (or (and .cse2 .cse14) .cse13 .cse4) v_~x$r_buff0_thd1~0_60 (ite (and .cse6 (not .cse4)) 0 v_~x$r_buff0_thd1~0_60))) v_~x$r_buff0_thd1~0_59) (= v_~x$w_buff0~0_114 v_~x$w_buff0~0_113) (= |v_#memory_int_247| (store |v_#memory_int_248| |v_~#x~0.base_174| (store .cse15 |v_~#x~0.offset_174| |v_P0_#t~ite10_29|))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_114, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_60, ~#x~0.offset=|v_~#x~0.offset_174|, ~x$w_buff1~0=v_~x$w_buff1~0_101, P0Thread1of1ForFork3_#t~mem9=|v_P0Thread1of1ForFork3_#t~mem9_1|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_241, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_59, P0Thread1of1ForFork3_#t~mem6=|v_P0Thread1of1ForFork3_#t~mem6_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_253, #memory_int=|v_#memory_int_248|, ~#x~0.base=|v_~#x~0.base_174|, P0Thread1of1ForFork3_#t~nondet3=|v_P0Thread1of1ForFork3_#t~nondet3_1|, P0Thread1of1ForFork3_#t~nondet4=|v_P0Thread1of1ForFork3_#t~nondet4_1|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_113, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_59, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_24, ~x$flush_delayed~0=v_~x$flush_delayed~0_56, ~#x~0.offset=|v_~#x~0.offset_174|, ~x$w_buff1~0=v_~x$w_buff1~0_100, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_240, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_58, ~x$mem_tmp~0=v_~x$mem_tmp~0_38, P0Thread1of1ForFork3_#t~mem8=|v_P0Thread1of1ForFork3_#t~mem8_1|, P0Thread1of1ForFork3_#t~mem5=|v_P0Thread1of1ForFork3_#t~mem5_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_252, ~weak$$choice0~0=v_~weak$$choice0~0_58, P0Thread1of1ForFork3_#t~ite7=|v_P0Thread1of1ForFork3_#t~ite7_1|, #memory_int=|v_#memory_int_247|, ~#x~0.base=|v_~#x~0.base_174|, ~weak$$choice2~0=v_~weak$$choice2~0_74, P0Thread1of1ForFork3_#t~ite10=|v_P0Thread1of1ForFork3_#t~ite10_1|} AuxVars[|v_P0_#t~mem9_32|, |v_P0_#t~ite10_29|, |v_P0_#t~mem6_34|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, P0Thread1of1ForFork3_#t~mem9, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, P0Thread1of1ForFork3_#t~mem8, P0Thread1of1ForFork3_#t~mem5, P0Thread1of1ForFork3_#t~mem6, ~x$w_buff0_used~0, ~weak$$choice0~0, P0Thread1of1ForFork3_#t~ite7, #memory_int, ~weak$$choice2~0, P0Thread1of1ForFork3_#t~nondet3, P0Thread1of1ForFork3_#t~ite10, P0Thread1of1ForFork3_#t~nondet4] [2022-12-06 04:31:14,922 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [840] $Ultimate##0-->L805: Formula: (and (= v_~x$r_buff1_thd0~0_58 v_~x$r_buff0_thd0~0_58) (= v_~x$r_buff1_thd4~0_52 v_~x$r_buff0_thd4~0_54) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|) (= v_~x$r_buff0_thd3~0_149 v_~x$r_buff1_thd3~0_147) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| 0)) (= v_~x$w_buff0~0_182 v_~x$w_buff1~0_168) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_7| |v_P1Thread1of1ForFork1_~arg#1.offset_7|) (= v_~x$w_buff0_used~0_343 v_~x$w_buff1_used~0_326) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_7| |v_P1Thread1of1ForFork1_~arg#1.base_7|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_326 256) 0)) (not (= (mod v_~x$w_buff0_used~0_342 256) 0)))) 1 0)) (= v_~x$r_buff0_thd2~0_67 1) (= v_~x$r_buff1_thd2~0_50 v_~x$r_buff0_thd2~0_68) (= v_~x$r_buff1_thd1~0_76 v_~x$r_buff0_thd1~0_75) (= v_~x$w_buff0~0_181 1) (= v_~x$w_buff0_used~0_342 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_182, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_58, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_75, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_54, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_149, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_343, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_181, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_58, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_75, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_7|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_168, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_147, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_326, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_76, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_54, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_149, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_67, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_58, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_52, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_342, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$r_buff1_thd4~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] and [915] L887-3-->L889-2: Formula: (and (= |v_#pthreadsForks_72| |v_ULTIMATE.start_main_#t~pre42#1_47|) (= |v_#pthreadsForks_71| (+ |v_#pthreadsForks_72| 1)) (= (select |v_#valid_144| |v_ULTIMATE.start_main_~#t2232~0#1.base_38|) 0) (= (store |v_#memory_int_487| |v_ULTIMATE.start_main_~#t2232~0#1.base_38| (store (select |v_#memory_int_487| |v_ULTIMATE.start_main_~#t2232~0#1.base_38|) |v_ULTIMATE.start_main_~#t2232~0#1.offset_34| |v_ULTIMATE.start_main_#t~pre42#1_47|)) |v_#memory_int_486|) (< |v_#StackHeapBarrier_36| |v_ULTIMATE.start_main_~#t2232~0#1.base_38|) (not (= |v_ULTIMATE.start_main_~#t2232~0#1.base_38| 0)) (= |v_ULTIMATE.start_main_~#t2232~0#1.offset_34| 0) (= |v_#valid_143| (store |v_#valid_144| |v_ULTIMATE.start_main_~#t2232~0#1.base_38| 1)) (= (store |v_#length_79| |v_ULTIMATE.start_main_~#t2232~0#1.base_38| 4) |v_#length_78|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_36|, #pthreadsForks=|v_#pthreadsForks_72|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_487|, #length=|v_#length_79|} OutVars{ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_13|, #StackHeapBarrier=|v_#StackHeapBarrier_36|, #pthreadsForks=|v_#pthreadsForks_71|, ULTIMATE.start_main_~#t2232~0#1.base=|v_ULTIMATE.start_main_~#t2232~0#1.base_38|, #valid=|v_#valid_143|, #memory_int=|v_#memory_int_486|, ULTIMATE.start_main_~#t2232~0#1.offset=|v_ULTIMATE.start_main_~#t2232~0#1.offset_34|, #length=|v_#length_78|, ULTIMATE.start_main_#t~pre40#1=|v_ULTIMATE.start_main_#t~pre40#1_21|, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41#1, #pthreadsForks, ULTIMATE.start_main_~#t2232~0#1.base, #valid, #memory_int, ULTIMATE.start_main_~#t2232~0#1.offset, #length, ULTIMATE.start_main_#t~pre40#1, ULTIMATE.start_main_#t~pre42#1] [2022-12-06 04:31:15,088 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:31:15,089 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2896 [2022-12-06 04:31:15,089 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 176 flow [2022-12-06 04:31:15,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:15,089 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:15,089 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:15,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:31:15,090 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:31:15,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:15,090 INFO L85 PathProgramCache]: Analyzing trace with hash -919111872, now seen corresponding path program 1 times [2022-12-06 04:31:15,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:15,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958910621] [2022-12-06 04:31:15,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:15,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:15,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:31:15,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:15,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958910621] [2022-12-06 04:31:15,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958910621] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:15,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:15,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:31:15,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768876776] [2022-12-06 04:31:15,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:15,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:31:15,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:15,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:31:15,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:31:15,238 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 04:31:15,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:15,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:15,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 04:31:15,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:15,865 INFO L130 PetriNetUnfolder]: 2809/4053 cut-off events. [2022-12-06 04:31:15,865 INFO L131 PetriNetUnfolder]: For 4850/4929 co-relation queries the response was YES. [2022-12-06 04:31:15,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12545 conditions, 4053 events. 2809/4053 cut-off events. For 4850/4929 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 19678 event pairs, 439 based on Foata normal form. 383/4427 useless extension candidates. Maximal degree in co-relation 12527. Up to 2746 conditions per place. [2022-12-06 04:31:15,876 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 49 selfloop transitions, 5 changer transitions 37/93 dead transitions. [2022-12-06 04:31:15,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 93 transitions, 656 flow [2022-12-06 04:31:15,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:31:15,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:31:15,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-06 04:31:15,877 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6193548387096774 [2022-12-06 04:31:15,877 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 176 flow. Second operand 5 states and 96 transitions. [2022-12-06 04:31:15,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 93 transitions, 656 flow [2022-12-06 04:31:15,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 93 transitions, 626 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:31:15,880 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 214 flow [2022-12-06 04:31:15,880 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=214, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2022-12-06 04:31:15,880 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2022-12-06 04:31:15,881 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:15,881 INFO L89 Accepts]: Start accepts. Operand has 51 places, 37 transitions, 214 flow [2022-12-06 04:31:15,881 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:15,881 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:15,881 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 37 transitions, 214 flow [2022-12-06 04:31:15,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 37 transitions, 214 flow [2022-12-06 04:31:16,041 INFO L130 PetriNetUnfolder]: 906/1533 cut-off events. [2022-12-06 04:31:16,041 INFO L131 PetriNetUnfolder]: For 2702/2784 co-relation queries the response was YES. [2022-12-06 04:31:16,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4809 conditions, 1533 events. 906/1533 cut-off events. For 2702/2784 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 9120 event pairs, 448 based on Foata normal form. 0/1408 useless extension candidates. Maximal degree in co-relation 4791. Up to 814 conditions per place. [2022-12-06 04:31:16,054 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 37 transitions, 214 flow [2022-12-06 04:31:16,054 INFO L188 LiptonReduction]: Number of co-enabled transitions 326 [2022-12-06 04:31:16,057 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:31:16,058 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 04:31:16,058 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 214 flow [2022-12-06 04:31:16,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:16,059 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:16,059 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:16,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:31:16,059 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:31:16,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:16,059 INFO L85 PathProgramCache]: Analyzing trace with hash -111126547, now seen corresponding path program 1 times [2022-12-06 04:31:16,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:16,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735614144] [2022-12-06 04:31:16,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:16,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:16,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:31:16,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:16,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735614144] [2022-12-06 04:31:16,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735614144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:16,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:16,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:31:16,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718796881] [2022-12-06 04:31:16,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:16,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:31:16,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:16,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:31:16,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:31:16,245 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 04:31:16,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 214 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:16,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:16,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 04:31:16,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:16,699 INFO L130 PetriNetUnfolder]: 1593/2424 cut-off events. [2022-12-06 04:31:16,699 INFO L131 PetriNetUnfolder]: For 4413/4467 co-relation queries the response was YES. [2022-12-06 04:31:16,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9090 conditions, 2424 events. 1593/2424 cut-off events. For 4413/4467 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 11552 event pairs, 147 based on Foata normal form. 275/2690 useless extension candidates. Maximal degree in co-relation 9069. Up to 1185 conditions per place. [2022-12-06 04:31:16,709 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 64 selfloop transitions, 9 changer transitions 36/111 dead transitions. [2022-12-06 04:31:16,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 111 transitions, 834 flow [2022-12-06 04:31:16,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:31:16,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:31:16,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2022-12-06 04:31:16,724 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6129032258064516 [2022-12-06 04:31:16,724 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 214 flow. Second operand 6 states and 114 transitions. [2022-12-06 04:31:16,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 111 transitions, 834 flow [2022-12-06 04:31:16,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 111 transitions, 825 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 04:31:16,733 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 281 flow [2022-12-06 04:31:16,733 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=281, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2022-12-06 04:31:16,734 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places. [2022-12-06 04:31:16,734 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:16,734 INFO L89 Accepts]: Start accepts. Operand has 55 places, 41 transitions, 281 flow [2022-12-06 04:31:16,736 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:16,736 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:16,737 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 41 transitions, 281 flow [2022-12-06 04:31:16,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 41 transitions, 281 flow [2022-12-06 04:31:16,825 INFO L130 PetriNetUnfolder]: 450/864 cut-off events. [2022-12-06 04:31:16,825 INFO L131 PetriNetUnfolder]: For 2219/2282 co-relation queries the response was YES. [2022-12-06 04:31:16,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3401 conditions, 864 events. 450/864 cut-off events. For 2219/2282 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4913 event pairs, 150 based on Foata normal form. 25/831 useless extension candidates. Maximal degree in co-relation 3380. Up to 427 conditions per place. [2022-12-06 04:31:16,831 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 41 transitions, 281 flow [2022-12-06 04:31:16,831 INFO L188 LiptonReduction]: Number of co-enabled transitions 364 [2022-12-06 04:31:16,832 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:31:16,833 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 04:31:16,833 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 281 flow [2022-12-06 04:31:16,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:16,833 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:16,833 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:16,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:31:16,833 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:31:16,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:16,834 INFO L85 PathProgramCache]: Analyzing trace with hash -2044210663, now seen corresponding path program 1 times [2022-12-06 04:31:16,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:16,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314706340] [2022-12-06 04:31:16,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:16,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:17,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:31:17,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:17,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314706340] [2022-12-06 04:31:17,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314706340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:17,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:17,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:31:17,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409004856] [2022-12-06 04:31:17,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:17,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:31:17,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:17,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:31:17,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:31:17,027 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 04:31:17,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 281 flow. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:17,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:17,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 04:31:17,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:17,435 INFO L130 PetriNetUnfolder]: 880/1387 cut-off events. [2022-12-06 04:31:17,435 INFO L131 PetriNetUnfolder]: For 3249/3296 co-relation queries the response was YES. [2022-12-06 04:31:17,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5862 conditions, 1387 events. 880/1387 cut-off events. For 3249/3296 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6126 event pairs, 87 based on Foata normal form. 119/1497 useless extension candidates. Maximal degree in co-relation 5838. Up to 665 conditions per place. [2022-12-06 04:31:17,442 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 71 selfloop transitions, 13 changer transitions 29/115 dead transitions. [2022-12-06 04:31:17,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 115 transitions, 946 flow [2022-12-06 04:31:17,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:31:17,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:31:17,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2022-12-06 04:31:17,443 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5529953917050692 [2022-12-06 04:31:17,443 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 281 flow. Second operand 7 states and 120 transitions. [2022-12-06 04:31:17,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 115 transitions, 946 flow [2022-12-06 04:31:17,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 115 transitions, 880 flow, removed 28 selfloop flow, removed 4 redundant places. [2022-12-06 04:31:17,456 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 331 flow [2022-12-06 04:31:17,457 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=331, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2022-12-06 04:31:17,458 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 15 predicate places. [2022-12-06 04:31:17,458 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:17,458 INFO L89 Accepts]: Start accepts. Operand has 58 places, 45 transitions, 331 flow [2022-12-06 04:31:17,458 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:17,459 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:17,459 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 45 transitions, 331 flow [2022-12-06 04:31:17,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 45 transitions, 331 flow [2022-12-06 04:31:17,510 INFO L130 PetriNetUnfolder]: 222/475 cut-off events. [2022-12-06 04:31:17,510 INFO L131 PetriNetUnfolder]: For 1142/1187 co-relation queries the response was YES. [2022-12-06 04:31:17,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1730 conditions, 475 events. 222/475 cut-off events. For 1142/1187 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2519 event pairs, 51 based on Foata normal form. 25/463 useless extension candidates. Maximal degree in co-relation 1708. Up to 203 conditions per place. [2022-12-06 04:31:17,516 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 45 transitions, 331 flow [2022-12-06 04:31:17,516 INFO L188 LiptonReduction]: Number of co-enabled transitions 342 [2022-12-06 04:31:17,518 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [879] L889-3-->L3: Formula: (and (= v_~main$tmp_guard0~0_30 (ite (= (ite (= v_~__unbuffered_cnt~0_81 4) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_30 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_11|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_27|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet43#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [931] $Ultimate##0-->L900: Formula: (let ((.cse5 (= (mod v_~x$r_buff0_thd0~0_121 256) 0))) (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_572 256) 0))) (.cse2 (not .cse5))) (let ((.cse1 (and .cse3 .cse2)) (.cse4 (= (mod v_~x$w_buff0_used~0_574 256) 0)) (.cse0 (select |v_#memory_int_661| |v_~#x~0.base_317|))) (and (= v_~x$r_buff0_thd2~0_130 v_~x$r_buff1_thd2~0_107) (= v_~x$r_buff0_thd3~0_250 v_~x$r_buff1_thd3~0_249) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| 0)) (= |v_#memory_int_660| (store |v_#memory_int_661| |v_~#x~0.base_317| (store .cse0 |v_~#x~0.offset_317| |v_ULTIMATE.start_main_#t~ite46#1_96|))) (= v_~x$r_buff0_thd4~0_113 v_~x$r_buff1_thd4~0_107) (= v_~x$r_buff0_thd0~0_120 (ite .cse1 0 v_~x$r_buff0_thd0~0_121)) (= v_~x$r_buff0_thd2~0_129 1) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_22| |v_P1Thread1of1ForFork1_~arg#1.base_22|) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_22| |v_P1Thread1of1ForFork1_~arg#1.offset_22|) (= v_~x$r_buff1_thd0~0_129 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_539 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd0~0_120 256) 0)))) 0 v_~x$r_buff0_thd0~0_121)) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_24| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_24|) (= v_~x$w_buff1_used~0_539 (ite (or .cse1 (and (not .cse4) .cse2)) 0 v_~x$w_buff0_used~0_574)) (= (ite .cse2 0 1) v_~x$w_buff0_used~0_572) (= v_~x$w_buff0~0_356 v_~x$w_buff1~0_318) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_65|) (= (ite .cse4 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_24|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_24| 0)) (or (and (= |v_ULTIMATE.start_main_#t~ite45#1_115| |v_ULTIMATE.start_main_#t~ite46#1_96|) (= (select .cse0 |v_~#x~0.offset_317|) |v_ULTIMATE.start_main_#t~mem44#1_116|) (= |v_ULTIMATE.start_main_#t~ite45#1_115| |v_ULTIMATE.start_main_#t~mem44#1_116|) .cse5) (and (= |v_ULTIMATE.start_main_#t~ite46#1_96| v_~x$w_buff0~0_355) .cse2 (= |v_ULTIMATE.start_main_#t~mem44#1_118| |v_ULTIMATE.start_main_#t~mem44#1_116|) (= |v_ULTIMATE.start_main_#t~ite45#1_117| |v_ULTIMATE.start_main_#t~ite45#1_115|))) (= v_~x$w_buff0~0_355 1) (= v_~x$r_buff0_thd1~0_167 v_~x$r_buff1_thd1~0_175))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_356, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_121, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_167, ~#x~0.offset=|v_~#x~0.offset_317|, ULTIMATE.start_main_#t~ite45#1=|v_ULTIMATE.start_main_#t~ite45#1_117|, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_113, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_250, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_130, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_574, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_22|, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_118|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_22|, #memory_int=|v_#memory_int_661|, ~#x~0.base=|v_~#x~0.base_317|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_65|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_355, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_167, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_22|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_249, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_175, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_250, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_22|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_22|, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_24|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_59|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_120, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_22|, ~#x~0.offset=|v_~#x~0.offset_317|, ~x$w_buff1~0=v_~x$w_buff1~0_318, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_539, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_113, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_129, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_129, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_107, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_24|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_572, ULTIMATE.start_main_#t~ite46#1=|v_ULTIMATE.start_main_#t~ite46#1_95|, #memory_int=|v_#memory_int_660|, ~#x~0.base=|v_~#x~0.base_317|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_65|} AuxVars[|v_ULTIMATE.start_main_#t~ite46#1_96|, |v_ULTIMATE.start_main_#t~ite45#1_115|, |v_ULTIMATE.start_main_#t~mem44#1_116|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ULTIMATE.start_main_#t~ite45#1, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd4~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~mem44#1, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite46#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int] [2022-12-06 04:31:17,833 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:31:17,834 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 376 [2022-12-06 04:31:17,834 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 337 flow [2022-12-06 04:31:17,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:17,834 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:17,834 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:17,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:31:17,834 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:31:17,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:17,835 INFO L85 PathProgramCache]: Analyzing trace with hash 785710495, now seen corresponding path program 1 times [2022-12-06 04:31:17,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:17,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766478049] [2022-12-06 04:31:17,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:17,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:18,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:31:18,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:18,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766478049] [2022-12-06 04:31:18,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766478049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:18,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:18,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:31:18,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482191770] [2022-12-06 04:31:18,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:18,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:31:18,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:18,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:31:18,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:31:18,071 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 04:31:18,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 337 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:18,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:18,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 04:31:18,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:18,392 INFO L130 PetriNetUnfolder]: 695/1075 cut-off events. [2022-12-06 04:31:18,392 INFO L131 PetriNetUnfolder]: For 2135/2181 co-relation queries the response was YES. [2022-12-06 04:31:18,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4376 conditions, 1075 events. 695/1075 cut-off events. For 2135/2181 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4454 event pairs, 82 based on Foata normal form. 31/1097 useless extension candidates. Maximal degree in co-relation 4351. Up to 530 conditions per place. [2022-12-06 04:31:18,396 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 58 selfloop transitions, 17 changer transitions 21/97 dead transitions. [2022-12-06 04:31:18,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 97 transitions, 805 flow [2022-12-06 04:31:18,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:31:18,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:31:18,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2022-12-06 04:31:18,398 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4153225806451613 [2022-12-06 04:31:18,398 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 337 flow. Second operand 8 states and 103 transitions. [2022-12-06 04:31:18,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 97 transitions, 805 flow [2022-12-06 04:31:18,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 97 transitions, 697 flow, removed 27 selfloop flow, removed 8 redundant places. [2022-12-06 04:31:18,407 INFO L231 Difference]: Finished difference. Result has 58 places, 42 transitions, 278 flow [2022-12-06 04:31:18,407 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=278, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2022-12-06 04:31:18,407 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 15 predicate places. [2022-12-06 04:31:18,407 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:18,408 INFO L89 Accepts]: Start accepts. Operand has 58 places, 42 transitions, 278 flow [2022-12-06 04:31:18,408 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:18,408 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:18,409 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 42 transitions, 278 flow [2022-12-06 04:31:18,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 42 transitions, 278 flow [2022-12-06 04:31:18,429 INFO L130 PetriNetUnfolder]: 96/211 cut-off events. [2022-12-06 04:31:18,429 INFO L131 PetriNetUnfolder]: For 271/281 co-relation queries the response was YES. [2022-12-06 04:31:18,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 211 events. 96/211 cut-off events. For 271/281 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 860 event pairs, 21 based on Foata normal form. 3/195 useless extension candidates. Maximal degree in co-relation 631. Up to 86 conditions per place. [2022-12-06 04:31:18,430 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 42 transitions, 278 flow [2022-12-06 04:31:18,430 INFO L188 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-06 04:31:19,815 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [849] $Ultimate##0-->L767: Formula: (and (= |v_P0Thread1of1ForFork3_#in~arg.offset_5| v_P0Thread1of1ForFork3_~arg.offset_5) (= v_P0Thread1of1ForFork3_~arg.base_5 |v_P0Thread1of1ForFork3_#in~arg.base_5|) (= v_~y~0_28 v_~__unbuffered_p0_EAX~0_24)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_5|, ~y~0=v_~y~0_28, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_5|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_5|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_5, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_5, ~y~0=v_~y~0_28, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_5|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_~arg.offset] and [934] $Ultimate##0-->L783: Formula: (let ((.cse9 (= (mod v_~x$w_buff0_used~0_592 256) 0)) (.cse1 (= (mod v_~x$r_buff0_thd1~0_174 256) 0)) (.cse10 (= (mod v_~weak$$choice2~0_155 256) 0)) (.cse6 (select |v_#memory_int_673| |v_~#x~0.base_323|))) (let ((.cse4 (= (mod v_~x$w_buff1_used~0_551 256) 0)) (.cse3 (= (mod v_~x$w_buff0_used~0_590 256) 0)) (.cse7 (select .cse6 |v_~#x~0.offset_323|)) (.cse0 (not .cse10)) (.cse8 (and .cse9 .cse1)) (.cse5 (not .cse1))) (and (= v_~x$w_buff0~0_367 1) (= v_~x$r_buff0_thd2~0_144 v_~x$r_buff1_thd2~0_115) (= v_~x$r_buff0_thd4~0_121 v_~x$r_buff1_thd4~0_115) (= v_~x$r_buff0_thd2~0_143 1) (= (ite .cse0 v_~x$r_buff0_thd1~0_174 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd1~0_173 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2))) v_~x$r_buff0_thd1~0_174 0)) v_~x$r_buff1_thd1~0_181) (= (ite .cse0 v_~x$r_buff0_thd1~0_174 (ite (or .cse3 .cse1 (and .cse4 .cse1)) v_~x$r_buff0_thd1~0_174 (ite (and .cse5 (not .cse3)) 0 v_~x$r_buff0_thd1~0_174))) v_~x$r_buff0_thd1~0_173) (= (store |v_#memory_int_673| |v_~#x~0.base_323| (store .cse6 |v_~#x~0.offset_323| |v_P0_#t~ite10_69|)) |v_#memory_int_672|) (= v_~x$w_buff0~0_369 v_~x$w_buff1~0_324) (= .cse7 v_~x$mem_tmp~0_123) (= v_~x$r_buff0_thd3~0_256 v_~x$r_buff1_thd3~0_255) (= (ite .cse0 v_~x$w_buff0_used~0_592 (ite (or .cse3 .cse1 .cse8) v_~x$w_buff0_used~0_592 0)) v_~x$w_buff1_used~0_551) (= (ite .cse9 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_30|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_30| 0)) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_30| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_30|) (= v_~x$flush_delayed~0_145 0) (or (and .cse10 (= |v_P0_#t~ite10_69| |v_P0_#t~mem9_72|) (= v_~__unbuffered_p0_EBX~0_123 |v_P0_#t~mem9_72|)) (and .cse0 (= |v_P0_#t~ite10_69| v_~x$mem_tmp~0_123) (= |v_P0Thread1of1ForFork3_#t~mem9_80| |v_P0_#t~mem9_72|))) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_28| |v_P1Thread1of1ForFork1_~arg#1.base_28|) (or (and (= v_~__unbuffered_p0_EBX~0_123 |v_P0_#t~mem6_74|) (= .cse7 |v_P0_#t~mem6_74|) .cse1) (and (= |v_P0Thread1of1ForFork3_#t~mem6_80| |v_P0_#t~mem6_74|) (= v_~__unbuffered_p0_EBX~0_123 (ite .cse5 v_~x$w_buff0~0_367 v_~x$w_buff1~0_324)) .cse5)) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_28| |v_P1Thread1of1ForFork1_~arg#1.offset_28|) (= (ite .cse0 1 (ite (or .cse1 .cse8) 1 (ite .cse5 0 1))) v_~x$w_buff0_used~0_590) (= |v_P0Thread1of1ForFork3_#t~nondet3_80| v_~weak$$choice0~0_147) (= |v_P0Thread1of1ForFork3_#t~nondet4_80| v_~weak$$choice2~0_155) (= v_~x$r_buff0_thd0~0_128 v_~x$r_buff1_thd0~0_137)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_369, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_128, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_174, ~#x~0.offset=|v_~#x~0.offset_323|, P0Thread1of1ForFork3_#t~mem9=|v_P0Thread1of1ForFork3_#t~mem9_80|, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_121, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_256, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_144, P0Thread1of1ForFork3_#t~mem6=|v_P0Thread1of1ForFork3_#t~mem6_80|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_592, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_28|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_28|, #memory_int=|v_#memory_int_673|, ~#x~0.base=|v_~#x~0.base_323|, P0Thread1of1ForFork3_#t~nondet3=|v_P0Thread1of1ForFork3_#t~nondet3_80|, P0Thread1of1ForFork3_#t~nondet4=|v_P0Thread1of1ForFork3_#t~nondet4_80|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_367, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_173, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_28|, ~x$flush_delayed~0=v_~x$flush_delayed~0_145, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_255, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_181, ~x$mem_tmp~0=v_~x$mem_tmp~0_123, P0Thread1of1ForFork3_#t~mem8=|v_P0Thread1of1ForFork3_#t~mem8_42|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_256, P0Thread1of1ForFork3_#t~mem5=|v_P0Thread1of1ForFork3_#t~mem5_42|, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_28|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_28|, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_30|, P0Thread1of1ForFork3_#t~ite10=|v_P0Thread1of1ForFork3_#t~ite10_42|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_128, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_123, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_28|, ~#x~0.offset=|v_~#x~0.offset_323|, ~x$w_buff1~0=v_~x$w_buff1~0_324, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_551, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_121, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_143, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_137, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_115, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_30|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_590, ~weak$$choice0~0=v_~weak$$choice0~0_147, P0Thread1of1ForFork3_#t~ite7=|v_P0Thread1of1ForFork3_#t~ite7_42|, #memory_int=|v_#memory_int_672|, ~#x~0.base=|v_~#x~0.base_323|, ~weak$$choice2~0=v_~weak$$choice2~0_155} AuxVars[|v_P0_#t~mem6_74|, |v_P0_#t~mem9_72|, |v_P0_#t~ite10_69|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P1Thread1of1ForFork1_~arg#1.base, ~x$flush_delayed~0, P0Thread1of1ForFork3_#t~mem9, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, P0Thread1of1ForFork3_#t~mem8, P0Thread1of1ForFork3_#t~mem5, P0Thread1of1ForFork3_#t~mem6, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork3_#t~ite10, ~__unbuffered_p0_EBX~0, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$r_buff1_thd4~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~weak$$choice0~0, P0Thread1of1ForFork3_#t~ite7, #memory_int, ~weak$$choice2~0, P0Thread1of1ForFork3_#t~nondet3, P0Thread1of1ForFork3_#t~nondet4] [2022-12-06 04:31:22,917 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 04:31:22,918 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4511 [2022-12-06 04:31:22,918 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 277 flow [2022-12-06 04:31:22,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:22,919 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:22,919 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:22,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:31:22,919 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:31:22,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:22,920 INFO L85 PathProgramCache]: Analyzing trace with hash 588803551, now seen corresponding path program 1 times [2022-12-06 04:31:22,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:22,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133110393] [2022-12-06 04:31:22,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:22,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:24,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:31:24,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:24,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133110393] [2022-12-06 04:31:24,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133110393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:24,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:24,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:31:24,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81778157] [2022-12-06 04:31:24,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:24,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:31:24,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:24,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:31:24,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:31:24,198 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 04:31:24,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 277 flow. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:24,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:24,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 04:31:24,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:24,512 INFO L130 PetriNetUnfolder]: 559/909 cut-off events. [2022-12-06 04:31:24,513 INFO L131 PetriNetUnfolder]: For 2077/2077 co-relation queries the response was YES. [2022-12-06 04:31:24,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3724 conditions, 909 events. 559/909 cut-off events. For 2077/2077 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3959 event pairs, 28 based on Foata normal form. 2/911 useless extension candidates. Maximal degree in co-relation 3701. Up to 419 conditions per place. [2022-12-06 04:31:24,518 INFO L137 encePairwiseOnDemand]: 11/26 looper letters, 97 selfloop transitions, 22 changer transitions 16/135 dead transitions. [2022-12-06 04:31:24,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 135 transitions, 1269 flow [2022-12-06 04:31:24,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:31:24,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:31:24,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-12-06 04:31:24,524 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4230769230769231 [2022-12-06 04:31:24,524 INFO L175 Difference]: Start difference. First operand has 52 places, 38 transitions, 277 flow. Second operand 7 states and 77 transitions. [2022-12-06 04:31:24,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 135 transitions, 1269 flow [2022-12-06 04:31:24,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 135 transitions, 991 flow, removed 70 selfloop flow, removed 9 redundant places. [2022-12-06 04:31:24,531 INFO L231 Difference]: Finished difference. Result has 53 places, 55 transitions, 375 flow [2022-12-06 04:31:24,531 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=375, PETRI_PLACES=53, PETRI_TRANSITIONS=55} [2022-12-06 04:31:24,531 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 10 predicate places. [2022-12-06 04:31:24,531 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:24,532 INFO L89 Accepts]: Start accepts. Operand has 53 places, 55 transitions, 375 flow [2022-12-06 04:31:24,532 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:24,532 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:24,532 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 55 transitions, 375 flow [2022-12-06 04:31:24,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 55 transitions, 375 flow [2022-12-06 04:31:24,567 INFO L130 PetriNetUnfolder]: 191/407 cut-off events. [2022-12-06 04:31:24,567 INFO L131 PetriNetUnfolder]: For 1308/1367 co-relation queries the response was YES. [2022-12-06 04:31:24,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1328 conditions, 407 events. 191/407 cut-off events. For 1308/1367 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2228 event pairs, 10 based on Foata normal form. 24/408 useless extension candidates. Maximal degree in co-relation 1309. Up to 128 conditions per place. [2022-12-06 04:31:24,569 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 55 transitions, 375 flow [2022-12-06 04:31:24,569 INFO L188 LiptonReduction]: Number of co-enabled transitions 396 [2022-12-06 04:31:24,570 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:31:24,570 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-06 04:31:24,571 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 55 transitions, 375 flow [2022-12-06 04:31:24,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:24,571 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:24,571 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:24,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:31:24,571 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:31:24,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:24,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1595530029, now seen corresponding path program 2 times [2022-12-06 04:31:24,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:24,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895575710] [2022-12-06 04:31:24,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:24,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:31:24,641 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:31:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:31:24,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:31:24,745 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:31:24,746 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 04:31:24,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 04:31:24,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 04:31:24,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 04:31:24,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 04:31:24,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 04:31:24,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 04:31:24,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:31:24,748 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:24,751 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:31:24,752 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:31:24,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:31:24 BasicIcfg [2022-12-06 04:31:24,845 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:31:24,845 INFO L158 Benchmark]: Toolchain (without parser) took 45155.91ms. Allocated memory was 200.3MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 166.1MB in the beginning and 1.1GB in the end (delta: -899.7MB). Peak memory consumption was 350.2MB. Max. memory is 8.0GB. [2022-12-06 04:31:24,845 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 200.3MB. Free memory is still 177.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:31:24,845 INFO L158 Benchmark]: CACSL2BoogieTranslator took 514.83ms. Allocated memory is still 200.3MB. Free memory was 166.1MB in the beginning and 136.8MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-06 04:31:24,846 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.41ms. Allocated memory is still 200.3MB. Free memory was 136.8MB in the beginning and 134.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:31:24,846 INFO L158 Benchmark]: Boogie Preprocessor took 26.70ms. Allocated memory is still 200.3MB. Free memory was 134.2MB in the beginning and 131.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:31:24,846 INFO L158 Benchmark]: RCFGBuilder took 965.58ms. Allocated memory is still 200.3MB. Free memory was 131.5MB in the beginning and 151.4MB in the end (delta: -19.9MB). Peak memory consumption was 73.5MB. Max. memory is 8.0GB. [2022-12-06 04:31:24,846 INFO L158 Benchmark]: TraceAbstraction took 43605.70ms. Allocated memory was 200.3MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 150.9MB in the beginning and 1.1GB in the end (delta: -915.0MB). Peak memory consumption was 333.3MB. Max. memory is 8.0GB. [2022-12-06 04:31:24,847 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 200.3MB. Free memory is still 177.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 514.83ms. Allocated memory is still 200.3MB. Free memory was 166.1MB in the beginning and 136.8MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.41ms. Allocated memory is still 200.3MB. Free memory was 136.8MB in the beginning and 134.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.70ms. Allocated memory is still 200.3MB. Free memory was 134.2MB in the beginning and 131.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 965.58ms. Allocated memory is still 200.3MB. Free memory was 131.5MB in the beginning and 151.4MB in the end (delta: -19.9MB). Peak memory consumption was 73.5MB. Max. memory is 8.0GB. * TraceAbstraction took 43605.70ms. Allocated memory was 200.3MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 150.9MB in the beginning and 1.1GB in the end (delta: -915.0MB). Peak memory consumption was 333.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.5s, 152 PlacesBefore, 43 PlacesAfterwards, 141 TransitionsBefore, 31 TransitionsAfterwards, 2664 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 61 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 115 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1877, independent: 1817, independent conditional: 1817, independent unconditional: 0, dependent: 60, dependent conditional: 60, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1877, independent: 1817, independent conditional: 0, independent unconditional: 1817, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1877, independent: 1817, independent conditional: 0, independent unconditional: 1817, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1877, independent: 1817, independent conditional: 0, independent unconditional: 1817, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1625, independent: 1578, independent conditional: 0, independent unconditional: 1578, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1625, independent: 1553, independent conditional: 0, independent unconditional: 1553, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 72, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 465, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 436, dependent conditional: 0, dependent unconditional: 436, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1877, independent: 239, independent conditional: 0, independent unconditional: 239, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 1625, unknown conditional: 0, unknown unconditional: 1625] , Statistics on independence cache: Total cache size (in pairs): 2387, Positive cache size: 2340, Positive conditional cache size: 0, Positive unconditional cache size: 2340, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 35 PlacesBefore, 35 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, independent: 58, independent conditional: 58, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 80, independent: 58, independent conditional: 5, independent unconditional: 53, dependent: 22, dependent conditional: 1, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 80, independent: 58, independent conditional: 5, independent unconditional: 53, dependent: 22, dependent conditional: 1, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 80, independent: 58, independent conditional: 5, independent unconditional: 53, dependent: 22, dependent conditional: 1, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 76, independent: 56, independent conditional: 5, independent unconditional: 51, dependent: 20, dependent conditional: 1, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 76, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 20, dependent conditional: 1, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 189, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 185, dependent conditional: 10, dependent unconditional: 175, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 80, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 76, unknown conditional: 6, unknown unconditional: 70] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 56, Positive conditional cache size: 5, Positive unconditional cache size: 51, Negative cache size: 20, Negative conditional cache size: 1, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 306 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, independent: 61, independent conditional: 61, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 80, independent: 61, independent conditional: 2, independent unconditional: 59, dependent: 19, dependent conditional: 1, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 80, independent: 61, independent conditional: 0, independent unconditional: 61, dependent: 19, dependent conditional: 1, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 80, independent: 61, independent conditional: 0, independent unconditional: 61, dependent: 19, dependent conditional: 1, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 1, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 80, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 7, unknown conditional: 1, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 61, Positive conditional cache size: 5, Positive unconditional cache size: 56, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 304 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 77, independent: 59, independent conditional: 59, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 77, independent: 59, independent conditional: 9, independent unconditional: 50, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 77, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 18, dependent conditional: 1, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 77, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 18, dependent conditional: 1, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 77, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 18, dependent conditional: 1, dependent unconditional: 17, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 63, Positive conditional cache size: 5, Positive unconditional cache size: 58, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, independent: 49, independent conditional: 49, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 66, independent: 49, independent conditional: 18, independent unconditional: 31, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, independent: 49, independent conditional: 0, independent unconditional: 49, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, independent: 49, independent conditional: 0, independent unconditional: 49, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, independent: 49, independent conditional: 0, independent unconditional: 49, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 63, Positive conditional cache size: 5, Positive unconditional cache size: 58, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 296 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 69, independent: 51, independent conditional: 51, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 69, independent: 51, independent conditional: 4, independent unconditional: 47, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 69, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 69, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 69, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 63, Positive conditional cache size: 5, Positive unconditional cache size: 58, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 246 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 134, independent: 94, independent conditional: 94, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 134, independent: 94, independent conditional: 44, independent unconditional: 50, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 134, independent: 94, independent conditional: 0, independent unconditional: 94, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 134, independent: 94, independent conditional: 0, independent unconditional: 94, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 134, independent: 89, independent conditional: 0, independent unconditional: 89, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 69, Positive conditional cache size: 5, Positive unconditional cache size: 64, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 44, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 47 PlacesBefore, 46 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 304 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 156, independent: 140, independent conditional: 140, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 156, independent: 140, independent conditional: 110, independent unconditional: 30, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 156, independent: 140, independent conditional: 74, independent unconditional: 66, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 156, independent: 140, independent conditional: 74, independent unconditional: 66, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 18, independent conditional: 10, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 156, independent: 122, independent conditional: 64, independent unconditional: 58, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 19, unknown conditional: 10, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 127, Positive cache size: 104, Positive conditional cache size: 15, Positive unconditional cache size: 89, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 326 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 127, Positive cache size: 104, Positive conditional cache size: 15, Positive unconditional cache size: 89, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 127, Positive cache size: 104, Positive conditional cache size: 15, Positive unconditional cache size: 89, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 56 PlacesBefore, 56 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 342 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 1, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 109, Positive conditional cache size: 16, Positive unconditional cache size: 93, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 56 PlacesBefore, 52 PlacesAfterwards, 42 TransitionsBefore, 38 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42, independent: 42, independent conditional: 12, independent unconditional: 30, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 12, independent unconditional: 30, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 42, independent: 36, independent conditional: 12, independent unconditional: 24, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 130, Positive conditional cache size: 16, Positive unconditional cache size: 114, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 30, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 396 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 130, Positive conditional cache size: 16, Positive unconditional cache size: 114, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p0_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L718] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L719] 0 int __unbuffered_p2_EAX$mem_tmp; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L727] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L728] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L729] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L730] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L731] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L732] 0 int __unbuffered_p2_EAX$w_buff0; [L733] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L734] 0 int __unbuffered_p2_EAX$w_buff1; [L735] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L740] 0 _Bool x$flush_delayed; [L741] 0 int x$mem_tmp; [L742] 0 _Bool x$r_buff0_thd0; [L743] 0 _Bool x$r_buff0_thd1; [L744] 0 _Bool x$r_buff0_thd2; [L745] 0 _Bool x$r_buff0_thd3; [L746] 0 _Bool x$r_buff0_thd4; [L747] 0 _Bool x$r_buff1_thd0; [L748] 0 _Bool x$r_buff1_thd1; [L749] 0 _Bool x$r_buff1_thd2; [L750] 0 _Bool x$r_buff1_thd3; [L751] 0 _Bool x$r_buff1_thd4; [L752] 0 _Bool x$read_delayed; [L753] 0 int *x$read_delayed_var; [L754] 0 int x$w_buff0; [L755] 0 _Bool x$w_buff0_used; [L756] 0 int x$w_buff1; [L757] 0 _Bool x$w_buff1_used; [L759] 0 int y = 0; [L760] 0 _Bool weak$$choice0; [L761] 0 _Bool weak$$choice1; [L762] 0 _Bool weak$$choice2; [L882] 0 pthread_t t2229; [L883] FCALL, FORK 0 pthread_create(&t2229, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2229, ((void *)0), P0, ((void *)0))=-3, t2229={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L884] 0 pthread_t t2230; [L885] FCALL, FORK 0 pthread_create(&t2230, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2230, ((void *)0), P1, ((void *)0))=-2, t2229={7:0}, t2230={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L886] 0 pthread_t t2231; [L887] FCALL, FORK 0 pthread_create(&t2231, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2231, ((void *)0), P2, ((void *)0))=-1, t2229={7:0}, t2230={8:0}, t2231={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L888] 0 pthread_t t2232; [L821] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 3 x$flush_delayed = weak$$choice2 [L824] EXPR 3 \read(x) [L824] 3 x$mem_tmp = x [L825] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L826] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L826] EXPR 3 \read(x) [L826] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L826] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L827] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L828] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L829] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L830] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L831] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L832] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L833] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L834] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L835] EXPR 3 \read(x) [L835] 3 __unbuffered_p2_EAX = x [L836] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L836] 3 x = x$flush_delayed ? x$mem_tmp : x [L837] 3 x$flush_delayed = (_Bool)0 [L840] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L889] FCALL, FORK 0 pthread_create(&t2232, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2232, ((void *)0), P3, ((void *)0))=0, t2229={7:0}, t2230={8:0}, t2231={5:0}, t2232={6:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L843] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L843] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L843] EXPR 3 \read(x) [L843] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L843] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L843] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L844] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L845] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L846] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L847] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L857] 4 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, 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$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 1 __unbuffered_p0_EAX = y [L769] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 1 x$flush_delayed = weak$$choice2 [L772] EXPR 1 \read(x) [L772] 1 x$mem_tmp = x [L773] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L773] EXPR 1 \read(x) [L773] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L773] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L774] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L775] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L776] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L777] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L778] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L779] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 1 \read(x) [L780] 1 __unbuffered_p0_EBX = x [L781] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L781] 1 x = x$flush_delayed ? x$mem_tmp : x [L782] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, 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=2, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L794] 2 x$w_buff1 = x$w_buff0 [L795] 2 x$w_buff0 = 1 [L796] 2 x$w_buff1_used = x$w_buff0_used [L797] 2 x$w_buff0_used = (_Bool)1 [L798] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L798] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L799] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L800] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L801] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L802] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L803] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L804] 2 x$r_buff0_thd2 = (_Bool)1 [L860] EXPR 2 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L860] EXPR 2 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L860] EXPR 2 \read(x) [L860] EXPR 2 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L860] EXPR 2 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L860] 2 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L861] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L862] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L863] 2 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L864] 2 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, 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=2, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L807] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L807] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L808] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L809] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L810] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L811] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L814] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L816] 2 return 0; [L850] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L852] 3 return 0; [L867] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L869] 4 return 0; [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L891] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L893] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L893] RET 0 assume_abort_if_not(main$tmp_guard0) [L895] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L895] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L895] EXPR 0 \read(x) [L895] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L895] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L895] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L896] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L897] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L898] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L899] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L902] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L903] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L903] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L903] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L903] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L903] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L903] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L904] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L906] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 885]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 887]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 889]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 883]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 178 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 43.4s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 21.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 463 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 463 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1313 IncrementalHoareTripleChecker+Invalid, 1386 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 3 mSDtfsCounter, 1313 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=375occurred in iteration=12, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 1069 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:31:24,886 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...