/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/rfi009_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:23:32,017 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:23:32,019 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:23:32,039 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:23:32,039 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:23:32,040 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:23:32,041 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:23:32,042 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:23:32,043 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:23:32,044 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:23:32,044 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:23:32,045 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:23:32,045 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:23:32,046 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:23:32,047 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:23:32,048 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:23:32,048 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:23:32,049 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:23:32,050 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:23:32,051 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:23:32,052 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:23:32,053 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:23:32,053 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:23:32,054 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:23:32,056 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:23:32,057 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:23:32,057 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:23:32,057 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:23:32,058 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:23:32,058 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:23:32,058 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:23:32,059 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:23:32,059 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:23:32,060 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:23:32,061 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:23:32,061 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:23:32,061 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:23:32,062 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:23:32,062 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:23:32,062 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:23:32,063 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:23:32,064 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:23:32,089 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:23:32,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:23:32,092 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:23:32,092 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:23:32,092 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:23:32,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:23:32,093 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:23:32,093 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:23:32,093 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:23:32,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:23:32,094 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:23:32,094 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:23:32,094 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:23:32,094 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:23:32,094 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:23:32,094 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:23:32,094 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:23:32,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:23:32,095 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:23:32,095 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:23:32,095 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:23:32,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:23:32,095 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:23:32,095 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:23:32,095 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:23:32,096 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:23:32,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:23:32,096 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:23:32,096 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:23:32,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:23:32,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:23:32,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:23:32,382 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:23:32,382 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:23:32,383 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi009_rmo.oepc.i [2022-12-06 04:23:33,404 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:23:33,615 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:23:33,616 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi009_rmo.oepc.i [2022-12-06 04:23:33,628 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc6823c51/7546ba3ff24c4f2986f7df0a9af059fe/FLAGaea9d6679 [2022-12-06 04:23:33,642 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc6823c51/7546ba3ff24c4f2986f7df0a9af059fe [2022-12-06 04:23:33,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:23:33,645 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:23:33,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:23:33,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:23:33,648 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:23:33,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:23:33" (1/1) ... [2022-12-06 04:23:33,649 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61985afe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:33, skipping insertion in model container [2022-12-06 04:23:33,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:23:33" (1/1) ... [2022-12-06 04:23:33,654 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:23:33,689 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:23:33,799 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/rfi009_rmo.oepc.i[992,1005] [2022-12-06 04:23:33,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:33,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:33,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:33,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:33,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:33,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:33,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:33,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:33,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:33,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:33,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:33,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:33,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:33,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:33,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:33,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:33,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:33,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:33,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:33,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:33,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:33,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:33,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:33,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:33,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:34,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:34,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:34,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:34,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:34,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:34,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:23:34,019 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:23:34,029 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/rfi009_rmo.oepc.i[992,1005] [2022-12-06 04:23:34,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:34,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:34,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:34,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:34,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:34,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:34,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:34,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:34,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:34,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:34,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:34,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:34,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:34,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:34,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:34,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:34,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:34,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:34,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:34,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:34,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:34,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:34,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:34,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:34,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:34,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:34,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:34,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:34,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:34,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:34,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:23:34,132 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:23:34,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:34 WrapperNode [2022-12-06 04:23:34,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:23:34,134 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:23:34,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:23:34,134 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:23:34,155 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:23:34" (1/1) ... [2022-12-06 04:23:34,180 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:23:34" (1/1) ... [2022-12-06 04:23:34,209 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2022-12-06 04:23:34,210 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:23:34,210 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:23:34,210 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:23:34,210 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:23:34,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:34" (1/1) ... [2022-12-06 04:23:34,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:34" (1/1) ... [2022-12-06 04:23:34,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:34" (1/1) ... [2022-12-06 04:23:34,234 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:34" (1/1) ... [2022-12-06 04:23:34,242 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:34" (1/1) ... [2022-12-06 04:23:34,260 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:34" (1/1) ... [2022-12-06 04:23:34,262 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:34" (1/1) ... [2022-12-06 04:23:34,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:34" (1/1) ... [2022-12-06 04:23:34,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:23:34,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:23:34,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:23:34,267 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:23:34,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:34" (1/1) ... [2022-12-06 04:23:34,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:23:34,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:23:34,313 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:23:34,333 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:23:34,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:23:34,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:23:34,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:23:34,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:23:34,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:23:34,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:23:34,352 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:23:34,352 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:23:34,352 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:23:34,352 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:23:34,352 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:23:34,352 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:23:34,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:23:34,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:23:34,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:23:34,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:23:34,356 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:23:34,541 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:23:34,543 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:23:34,893 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:23:35,153 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:23:35,154 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:23:35,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:23:35 BoogieIcfgContainer [2022-12-06 04:23:35,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:23:35,160 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:23:35,160 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:23:35,162 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:23:35,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:23:33" (1/3) ... [2022-12-06 04:23:35,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56952587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:23:35, skipping insertion in model container [2022-12-06 04:23:35,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:34" (2/3) ... [2022-12-06 04:23:35,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56952587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:23:35, skipping insertion in model container [2022-12-06 04:23:35,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:23:35" (3/3) ... [2022-12-06 04:23:35,165 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi009_rmo.oepc.i [2022-12-06 04:23:35,179 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:23:35,179 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 04:23:35,179 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:23:35,290 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:23:35,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-12-06 04:23:35,379 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-06 04:23:35,380 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:23:35,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2022-12-06 04:23:35,386 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2022-12-06 04:23:35,390 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 110 transitions, 229 flow [2022-12-06 04:23:35,391 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:23:35,406 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 110 transitions, 229 flow [2022-12-06 04:23:35,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 110 transitions, 229 flow [2022-12-06 04:23:35,433 INFO L130 PetriNetUnfolder]: 1/110 cut-off events. [2022-12-06 04:23:35,433 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:23:35,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 1/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 37 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2022-12-06 04:23:35,435 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 110 transitions, 229 flow [2022-12-06 04:23:35,435 INFO L188 LiptonReduction]: Number of co-enabled transitions 1152 [2022-12-06 04:23:42,032 INFO L203 LiptonReduction]: Total number of compositions: 92 [2022-12-06 04:23:42,045 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:23:42,050 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;@7ee34867, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:23:42,050 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 04:23:42,054 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2022-12-06 04:23:42,054 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:23:42,054 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:23:42,054 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:23:42,055 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:23:42,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:23:42,058 INFO L85 PathProgramCache]: Analyzing trace with hash 346503967, now seen corresponding path program 1 times [2022-12-06 04:23:42,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:23:42,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545387873] [2022-12-06 04:23:42,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:23:42,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:23:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:23:42,274 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:23:42,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:23:42,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545387873] [2022-12-06 04:23:42,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545387873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:23:42,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:23:42,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:23:42,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687058654] [2022-12-06 04:23:42,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:23:42,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 04:23:42,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:23:42,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 04:23:42,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 04:23:42,317 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 04:23:42,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 49 flow. Second operand has 2 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:23:42,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:23:42,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 04:23:42,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:23:42,519 INFO L130 PetriNetUnfolder]: 407/637 cut-off events. [2022-12-06 04:23:42,519 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 04:23:42,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1304 conditions, 637 events. 407/637 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2557 event pairs, 407 based on Foata normal form. 0/633 useless extension candidates. Maximal degree in co-relation 1293. Up to 631 conditions per place. [2022-12-06 04:23:42,530 INFO L137 encePairwiseOnDemand]: 19/20 looper letters, 17 selfloop transitions, 0 changer transitions 0/19 dead transitions. [2022-12-06 04:23:42,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 19 transitions, 81 flow [2022-12-06 04:23:42,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 04:23:42,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 04:23:42,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 22 transitions. [2022-12-06 04:23:42,541 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 04:23:42,543 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 49 flow. Second operand 2 states and 22 transitions. [2022-12-06 04:23:42,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 19 transitions, 81 flow [2022-12-06 04:23:42,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 19 transitions, 78 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:23:42,546 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 44 flow [2022-12-06 04:23:42,547 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=27, PETRI_TRANSITIONS=19} [2022-12-06 04:23:42,551 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -2 predicate places. [2022-12-06 04:23:42,551 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:23:42,552 INFO L89 Accepts]: Start accepts. Operand has 27 places, 19 transitions, 44 flow [2022-12-06 04:23:42,554 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:23:42,554 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:23:42,555 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 19 transitions, 44 flow [2022-12-06 04:23:42,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 19 transitions, 44 flow [2022-12-06 04:23:42,570 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 04:23:42,570 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:23:42,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 19 events. 0/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-06 04:23:42,571 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 19 transitions, 44 flow [2022-12-06 04:23:42,571 INFO L188 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-06 04:23:42,718 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:23:42,720 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 04:23:42,721 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 44 flow [2022-12-06 04:23:42,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 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:23:42,721 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:23:42,721 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:23:42,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:23:42,724 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:23:42,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:23:42,724 INFO L85 PathProgramCache]: Analyzing trace with hash -2017116428, now seen corresponding path program 1 times [2022-12-06 04:23:42,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:23:42,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045841835] [2022-12-06 04:23:42,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:23:42,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:23:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:23:42,975 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:23:42,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:23:42,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045841835] [2022-12-06 04:23:42,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045841835] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:23:42,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:23:42,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:23:42,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845211382] [2022-12-06 04:23:42,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:23:42,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:23:42,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:23:42,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:23:42,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:23:42,977 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:23:42,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:23:42,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:23:42,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:23:42,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:23:43,133 INFO L130 PetriNetUnfolder]: 463/717 cut-off events. [2022-12-06 04:23:43,133 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:23:43,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1473 conditions, 717 events. 463/717 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2946 event pairs, 157 based on Foata normal form. 24/740 useless extension candidates. Maximal degree in co-relation 1465. Up to 493 conditions per place. [2022-12-06 04:23:43,137 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 25 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2022-12-06 04:23:43,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 28 transitions, 118 flow [2022-12-06 04:23:43,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:23:43,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:23:43,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-12-06 04:23:43,139 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.543859649122807 [2022-12-06 04:23:43,139 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 44 flow. Second operand 3 states and 31 transitions. [2022-12-06 04:23:43,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 28 transitions, 118 flow [2022-12-06 04:23:43,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 28 transitions, 118 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:23:43,141 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 52 flow [2022-12-06 04:23:43,141 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2022-12-06 04:23:43,142 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2022-12-06 04:23:43,142 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:23:43,142 INFO L89 Accepts]: Start accepts. Operand has 29 places, 19 transitions, 52 flow [2022-12-06 04:23:43,143 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:23:43,143 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:23:43,143 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 19 transitions, 52 flow [2022-12-06 04:23:43,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 19 transitions, 52 flow [2022-12-06 04:23:43,147 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 04:23:43,147 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:23:43,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 19 events. 0/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:23:43,147 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 19 transitions, 52 flow [2022-12-06 04:23:43,147 INFO L188 LiptonReduction]: Number of co-enabled transitions 162 [2022-12-06 04:23:43,174 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:23:43,175 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-06 04:23:43,175 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 18 transitions, 50 flow [2022-12-06 04:23:43,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:23:43,175 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:23:43,176 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:23:43,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:23:43,176 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:23:43,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:23:43,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1981552988, now seen corresponding path program 1 times [2022-12-06 04:23:43,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:23:43,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493561895] [2022-12-06 04:23:43,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:23:43,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:23:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:23:43,398 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:23:43,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:23:43,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493561895] [2022-12-06 04:23:43,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493561895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:23:43,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:23:43,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:23:43,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118529991] [2022-12-06 04:23:43,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:23:43,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:23:43,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:23:43,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:23:43,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:23:43,400 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-06 04:23:43,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 18 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:23:43,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:23:43,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-06 04:23:43,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:23:43,508 INFO L130 PetriNetUnfolder]: 349/606 cut-off events. [2022-12-06 04:23:43,509 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-12-06 04:23:43,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1299 conditions, 606 events. 349/606 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2683 event pairs, 75 based on Foata normal form. 12/618 useless extension candidates. Maximal degree in co-relation 1288. Up to 427 conditions per place. [2022-12-06 04:23:43,512 INFO L137 encePairwiseOnDemand]: 15/18 looper letters, 27 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2022-12-06 04:23:43,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 30 transitions, 139 flow [2022-12-06 04:23:43,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:23:43,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:23:43,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-06 04:23:43,513 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2022-12-06 04:23:43,514 INFO L175 Difference]: Start difference. First operand has 28 places, 18 transitions, 50 flow. Second operand 3 states and 33 transitions. [2022-12-06 04:23:43,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 30 transitions, 139 flow [2022-12-06 04:23:43,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 30 transitions, 133 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:23:43,515 INFO L231 Difference]: Finished difference. Result has 29 places, 18 transitions, 54 flow [2022-12-06 04:23:43,515 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=29, PETRI_TRANSITIONS=18} [2022-12-06 04:23:43,515 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2022-12-06 04:23:43,516 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:23:43,516 INFO L89 Accepts]: Start accepts. Operand has 29 places, 18 transitions, 54 flow [2022-12-06 04:23:43,516 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:23:43,516 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:23:43,516 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 18 transitions, 54 flow [2022-12-06 04:23:43,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 18 transitions, 54 flow [2022-12-06 04:23:43,531 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-06 04:23:43,531 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 04:23:43,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 18 events. 0/18 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:23:43,532 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 18 transitions, 54 flow [2022-12-06 04:23:43,532 INFO L188 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-06 04:23:43,576 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:23:43,577 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-06 04:23:43,577 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 54 flow [2022-12-06 04:23:43,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:23:43,577 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:23:43,577 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:23:43,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:23:43,578 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:23:43,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:23:43,578 INFO L85 PathProgramCache]: Analyzing trace with hash -422717686, now seen corresponding path program 1 times [2022-12-06 04:23:43,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:23:43,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265992082] [2022-12-06 04:23:43,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:23:43,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:23:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:23:44,420 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:23:44,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:23:44,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265992082] [2022-12-06 04:23:44,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265992082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:23:44,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:23:44,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:23:44,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090562002] [2022-12-06 04:23:44,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:23:44,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:23:44,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:23:44,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:23:44,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:23:44,422 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-06 04:23:44,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 18 transitions, 54 flow. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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:23:44,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:23:44,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-06 04:23:44,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:23:44,597 INFO L130 PetriNetUnfolder]: 416/679 cut-off events. [2022-12-06 04:23:44,597 INFO L131 PetriNetUnfolder]: For 129/129 co-relation queries the response was YES. [2022-12-06 04:23:44,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1610 conditions, 679 events. 416/679 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 52 based on Foata normal form. 6/685 useless extension candidates. Maximal degree in co-relation 1598. Up to 415 conditions per place. [2022-12-06 04:23:44,601 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 30 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2022-12-06 04:23:44,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 37 transitions, 177 flow [2022-12-06 04:23:44,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:23:44,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:23:44,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 04:23:44,602 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2022-12-06 04:23:44,602 INFO L175 Difference]: Start difference. First operand has 29 places, 18 transitions, 54 flow. Second operand 4 states and 41 transitions. [2022-12-06 04:23:44,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 37 transitions, 177 flow [2022-12-06 04:23:44,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 37 transitions, 171 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:23:44,603 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 88 flow [2022-12-06 04:23:44,603 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=88, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2022-12-06 04:23:44,604 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2022-12-06 04:23:44,604 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:23:44,604 INFO L89 Accepts]: Start accepts. Operand has 32 places, 22 transitions, 88 flow [2022-12-06 04:23:44,605 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:23:44,605 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:23:44,605 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 22 transitions, 88 flow [2022-12-06 04:23:44,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 22 transitions, 88 flow [2022-12-06 04:23:44,611 INFO L130 PetriNetUnfolder]: 3/39 cut-off events. [2022-12-06 04:23:44,611 INFO L131 PetriNetUnfolder]: For 9/10 co-relation queries the response was YES. [2022-12-06 04:23:44,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 39 events. 3/39 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 125 event pairs, 0 based on Foata normal form. 1/40 useless extension candidates. Maximal degree in co-relation 74. Up to 8 conditions per place. [2022-12-06 04:23:44,611 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 22 transitions, 88 flow [2022-12-06 04:23:44,611 INFO L188 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-06 04:23:44,730 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:23:44,731 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-06 04:23:44,731 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 88 flow [2022-12-06 04:23:44,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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:23:44,731 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:23:44,731 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:23:44,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:23:44,732 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:23:44,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:23:44,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1679085916, now seen corresponding path program 2 times [2022-12-06 04:23:44,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:23:44,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680813018] [2022-12-06 04:23:44,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:23:44,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:23:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:23:45,432 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:23:45,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:23:45,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680813018] [2022-12-06 04:23:45,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680813018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:23:45,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:23:45,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:23:45,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304075790] [2022-12-06 04:23:45,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:23:45,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:23:45,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:23:45,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:23:45,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:23:45,434 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-06 04:23:45,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 88 flow. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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:23:45,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:23:45,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-06 04:23:45,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:23:45,649 INFO L130 PetriNetUnfolder]: 411/662 cut-off events. [2022-12-06 04:23:45,649 INFO L131 PetriNetUnfolder]: For 286/286 co-relation queries the response was YES. [2022-12-06 04:23:45,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1789 conditions, 662 events. 411/662 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2790 event pairs, 62 based on Foata normal form. 2/663 useless extension candidates. Maximal degree in co-relation 1775. Up to 541 conditions per place. [2022-12-06 04:23:45,690 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 33 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2022-12-06 04:23:45,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 41 transitions, 236 flow [2022-12-06 04:23:45,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:23:45,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:23:45,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 04:23:45,693 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 04:23:45,693 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 88 flow. Second operand 4 states and 40 transitions. [2022-12-06 04:23:45,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 41 transitions, 236 flow [2022-12-06 04:23:45,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 230 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:23:45,696 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 140 flow [2022-12-06 04:23:45,696 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2022-12-06 04:23:45,697 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2022-12-06 04:23:45,698 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:23:45,698 INFO L89 Accepts]: Start accepts. Operand has 36 places, 28 transitions, 140 flow [2022-12-06 04:23:45,699 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:23:45,699 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:23:45,699 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 28 transitions, 140 flow [2022-12-06 04:23:45,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 28 transitions, 140 flow [2022-12-06 04:23:45,708 INFO L130 PetriNetUnfolder]: 9/57 cut-off events. [2022-12-06 04:23:45,708 INFO L131 PetriNetUnfolder]: For 54/61 co-relation queries the response was YES. [2022-12-06 04:23:45,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 57 events. 9/57 cut-off events. For 54/61 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 207 event pairs, 0 based on Foata normal form. 2/58 useless extension candidates. Maximal degree in co-relation 136. Up to 12 conditions per place. [2022-12-06 04:23:45,710 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 28 transitions, 140 flow [2022-12-06 04:23:45,710 INFO L188 LiptonReduction]: Number of co-enabled transitions 206 [2022-12-06 04:23:45,811 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:23:45,812 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 114 [2022-12-06 04:23:45,812 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 140 flow [2022-12-06 04:23:45,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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:23:45,813 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:23:45,813 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:23:45,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:23:45,813 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:23:45,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:23:45,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1601870627, now seen corresponding path program 1 times [2022-12-06 04:23:45,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:23:45,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882961798] [2022-12-06 04:23:45,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:23:45,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:23:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:23:45,956 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:23:45,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:23:45,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882961798] [2022-12-06 04:23:45,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882961798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:23:45,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:23:45,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:23:45,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154968338] [2022-12-06 04:23:45,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:23:45,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:23:45,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:23:45,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:23:45,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:23:45,958 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-06 04:23:45,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 140 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:23:45,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:23:45,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-06 04:23:45,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:23:46,083 INFO L130 PetriNetUnfolder]: 357/608 cut-off events. [2022-12-06 04:23:46,083 INFO L131 PetriNetUnfolder]: For 551/551 co-relation queries the response was YES. [2022-12-06 04:23:46,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1829 conditions, 608 events. 357/608 cut-off events. For 551/551 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2606 event pairs, 51 based on Foata normal form. 56/662 useless extension candidates. Maximal degree in co-relation 1812. Up to 380 conditions per place. [2022-12-06 04:23:46,087 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 41 selfloop transitions, 4 changer transitions 30/76 dead transitions. [2022-12-06 04:23:46,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 76 transitions, 519 flow [2022-12-06 04:23:46,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:23:46,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:23:46,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-12-06 04:23:46,088 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2022-12-06 04:23:46,088 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 140 flow. Second operand 5 states and 53 transitions. [2022-12-06 04:23:46,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 76 transitions, 519 flow [2022-12-06 04:23:46,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 76 transitions, 519 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:23:46,091 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 176 flow [2022-12-06 04:23:46,091 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2022-12-06 04:23:46,091 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 14 predicate places. [2022-12-06 04:23:46,092 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:23:46,092 INFO L89 Accepts]: Start accepts. Operand has 43 places, 31 transitions, 176 flow [2022-12-06 04:23:46,092 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:23:46,092 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:23:46,093 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 31 transitions, 176 flow [2022-12-06 04:23:46,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 31 transitions, 176 flow [2022-12-06 04:23:46,108 INFO L130 PetriNetUnfolder]: 48/142 cut-off events. [2022-12-06 04:23:46,108 INFO L131 PetriNetUnfolder]: For 175/192 co-relation queries the response was YES. [2022-12-06 04:23:46,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 142 events. 48/142 cut-off events. For 175/192 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 649 event pairs, 17 based on Foata normal form. 2/136 useless extension candidates. Maximal degree in co-relation 425. Up to 75 conditions per place. [2022-12-06 04:23:46,109 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 31 transitions, 176 flow [2022-12-06 04:23:46,109 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-06 04:23:46,111 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:23:46,111 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 04:23:46,112 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 176 flow [2022-12-06 04:23:46,112 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:23:46,112 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:23:46,112 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:23:46,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:23:46,112 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:23:46,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:23:46,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1074350588, now seen corresponding path program 1 times [2022-12-06 04:23:46,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:23:46,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036069933] [2022-12-06 04:23:46,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:23:46,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:23:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:23:47,007 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:23:47,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:23:47,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036069933] [2022-12-06 04:23:47,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036069933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:23:47,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:23:47,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:23:47,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315809550] [2022-12-06 04:23:47,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:23:47,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 04:23:47,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:23:47,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 04:23:47,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-06 04:23:47,008 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-06 04:23:47,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 176 flow. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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:23:47,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:23:47,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-06 04:23:47,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:23:47,184 INFO L130 PetriNetUnfolder]: 265/462 cut-off events. [2022-12-06 04:23:47,184 INFO L131 PetriNetUnfolder]: For 637/637 co-relation queries the response was YES. [2022-12-06 04:23:47,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1759 conditions, 462 events. 265/462 cut-off events. For 637/637 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1912 event pairs, 43 based on Foata normal form. 3/464 useless extension candidates. Maximal degree in co-relation 1737. Up to 279 conditions per place. [2022-12-06 04:23:47,188 INFO L137 encePairwiseOnDemand]: 14/18 looper letters, 36 selfloop transitions, 9 changer transitions 0/46 dead transitions. [2022-12-06 04:23:47,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 46 transitions, 337 flow [2022-12-06 04:23:47,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:23:47,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:23:47,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-06 04:23:47,190 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2022-12-06 04:23:47,190 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 176 flow. Second operand 4 states and 39 transitions. [2022-12-06 04:23:47,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 46 transitions, 337 flow [2022-12-06 04:23:47,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 324 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 04:23:47,194 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 202 flow [2022-12-06 04:23:47,194 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2022-12-06 04:23:47,194 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 14 predicate places. [2022-12-06 04:23:47,195 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:23:47,195 INFO L89 Accepts]: Start accepts. Operand has 43 places, 32 transitions, 202 flow [2022-12-06 04:23:47,195 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:23:47,195 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:23:47,195 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 32 transitions, 202 flow [2022-12-06 04:23:47,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 32 transitions, 202 flow [2022-12-06 04:23:47,212 INFO L130 PetriNetUnfolder]: 48/138 cut-off events. [2022-12-06 04:23:47,212 INFO L131 PetriNetUnfolder]: For 226/245 co-relation queries the response was YES. [2022-12-06 04:23:47,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 422 conditions, 138 events. 48/138 cut-off events. For 226/245 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 597 event pairs, 17 based on Foata normal form. 2/132 useless extension candidates. Maximal degree in co-relation 402. Up to 75 conditions per place. [2022-12-06 04:23:47,214 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 32 transitions, 202 flow [2022-12-06 04:23:47,214 INFO L188 LiptonReduction]: Number of co-enabled transitions 220 [2022-12-06 04:23:47,216 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:23:47,218 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-06 04:23:47,218 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 202 flow [2022-12-06 04:23:47,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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:23:47,218 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:23:47,218 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:23:47,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:23:47,218 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:23:47,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:23:47,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1769064040, now seen corresponding path program 1 times [2022-12-06 04:23:47,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:23:47,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620596477] [2022-12-06 04:23:47,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:23:47,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:23:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:23:47,335 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:23:47,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:23:47,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620596477] [2022-12-06 04:23:47,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620596477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:23:47,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:23:47,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:23:47,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822677446] [2022-12-06 04:23:47,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:23:47,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:23:47,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:23:47,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:23:47,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:23:47,337 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 04:23:47,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 202 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:23:47,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:23:47,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 04:23:47,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:23:47,485 INFO L130 PetriNetUnfolder]: 496/853 cut-off events. [2022-12-06 04:23:47,486 INFO L131 PetriNetUnfolder]: For 1535/1535 co-relation queries the response was YES. [2022-12-06 04:23:47,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3176 conditions, 853 events. 496/853 cut-off events. For 1535/1535 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3877 event pairs, 75 based on Foata normal form. 14/867 useless extension candidates. Maximal degree in co-relation 3153. Up to 465 conditions per place. [2022-12-06 04:23:47,490 INFO L137 encePairwiseOnDemand]: 15/18 looper letters, 51 selfloop transitions, 2 changer transitions 13/66 dead transitions. [2022-12-06 04:23:47,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 66 transitions, 529 flow [2022-12-06 04:23:47,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:23:47,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:23:47,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-06 04:23:47,492 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2022-12-06 04:23:47,492 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 202 flow. Second operand 4 states and 39 transitions. [2022-12-06 04:23:47,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 66 transitions, 529 flow [2022-12-06 04:23:47,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 66 transitions, 513 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-06 04:23:47,534 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 206 flow [2022-12-06 04:23:47,535 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=206, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2022-12-06 04:23:47,536 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 18 predicate places. [2022-12-06 04:23:47,536 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:23:47,536 INFO L89 Accepts]: Start accepts. Operand has 47 places, 33 transitions, 206 flow [2022-12-06 04:23:47,537 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:23:47,537 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:23:47,537 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 33 transitions, 206 flow [2022-12-06 04:23:47,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 33 transitions, 206 flow [2022-12-06 04:23:47,564 INFO L130 PetriNetUnfolder]: 86/235 cut-off events. [2022-12-06 04:23:47,565 INFO L131 PetriNetUnfolder]: For 321/340 co-relation queries the response was YES. [2022-12-06 04:23:47,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 696 conditions, 235 events. 86/235 cut-off events. For 321/340 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1245 event pairs, 33 based on Foata normal form. 3/218 useless extension candidates. Maximal degree in co-relation 674. Up to 140 conditions per place. [2022-12-06 04:23:47,567 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 33 transitions, 206 flow [2022-12-06 04:23:47,567 INFO L188 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-06 04:23:48,043 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [647] $Ultimate##0-->L813: Formula: (let ((.cse3 (= (mod v_~x$r_buff1_thd2~0_142 256) 0)) (.cse6 (= (mod v_~x$w_buff1_used~0_465 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_469 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd2~0_135 256) 0))) (let ((.cse0 (= (mod v_~weak$$choice2~0_174 256) 0)) (.cse15 (select |v_#memory_int_590| |v_~#x~0.base_269|)) (.cse2 (not .cse10)) (.cse4 (not .cse16)) (.cse14 (and .cse10 .cse6)) (.cse12 (and .cse10 .cse3))) (let ((.cse11 (= (mod v_~x$w_buff1_used~0_464 256) 0)) (.cse7 (or .cse14 .cse12 .cse16)) (.cse5 (and .cse2 .cse4)) (.cse8 (select .cse15 |v_~#x~0.offset_269|)) (.cse1 (not .cse0)) (.cse9 (= (mod v_~x$w_buff0_used~0_468 256) 0))) (and (or (and (= v_~__unbuffered_p1_EBX~0_116 |v_P1_#t~mem17_81|) .cse0 (= |v_P1_#t~ite18_73| |v_P1_#t~mem17_81|)) (and .cse1 (= |v_P1_#t~ite18_73| v_~x$mem_tmp~0_126) (= |v_P1Thread1of1ForFork0_#t~mem17_82| |v_P1_#t~mem17_81|))) (or (and (or .cse2 (not .cse3)) .cse4 (= |v_P1Thread1of1ForFork0_#t~mem14_82| |v_P1_#t~mem14_71|) (= v_~__unbuffered_p1_EBX~0_116 (ite .cse5 v_~x$w_buff0~0_285 v_~x$w_buff1~0_297)) (or .cse2 (not .cse6))) (and (= v_~__unbuffered_p1_EBX~0_116 |v_P1_#t~mem14_71|) .cse7 (= |v_P1_#t~mem14_71| .cse8))) (= v_P1Thread1of1ForFork0_~arg.base_21 |v_P1Thread1of1ForFork0_#in~arg.base_21|) (= v_~y~0_64 1) (= v_~x$w_buff1~0_297 v_~x$w_buff1~0_296) (= (ite .cse1 v_~x$r_buff0_thd2~0_135 (ite (or .cse9 (and .cse10 .cse11) .cse12) v_~x$r_buff0_thd2~0_135 (ite (and .cse2 (not .cse9)) 0 v_~x$r_buff0_thd2~0_135))) v_~x$r_buff0_thd2~0_134) (= |v_P1Thread1of1ForFork0_#t~nondet11_81| v_~weak$$choice0~0_108) (= (ite .cse1 v_~x$r_buff1_thd2~0_142 (ite (let ((.cse13 (= (mod v_~x$r_buff0_thd2~0_134 256) 0))) (or .cse9 (and .cse13 .cse11) (and .cse13 .cse3))) v_~x$r_buff1_thd2~0_142 0)) v_~x$r_buff1_thd2~0_141) (= v_~x$flush_delayed~0_164 0) (= v_~y~0_64 v_~__unbuffered_p1_EAX~0_79) (= v_~weak$$choice2~0_174 |v_P1Thread1of1ForFork0_#t~nondet12_82|) (= (ite .cse1 v_~x$w_buff0_used~0_469 (ite .cse7 v_~x$w_buff0_used~0_469 (ite .cse5 0 v_~x$w_buff0_used~0_469))) v_~x$w_buff0_used~0_468) (= .cse8 v_~x$mem_tmp~0_126) (= |v_P1Thread1of1ForFork0_#in~arg.offset_21| v_P1Thread1of1ForFork0_~arg.offset_21) (= (ite .cse1 v_~x$w_buff1_used~0_465 (ite (or .cse9 .cse14 .cse12) v_~x$w_buff1_used~0_465 0)) v_~x$w_buff1_used~0_464) (= |v_#memory_int_589| (store |v_#memory_int_590| |v_~#x~0.base_269| (store .cse15 |v_~#x~0.offset_269| |v_P1_#t~ite18_73|))) (= v_~x$w_buff0~0_285 v_~x$w_buff0~0_284))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_285, P1Thread1of1ForFork0_#t~mem14=|v_P1Thread1of1ForFork0_#t~mem14_82|, ~#x~0.offset=|v_~#x~0.offset_269|, ~x$w_buff1~0=v_~x$w_buff1~0_297, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_142, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_465, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_135, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_469, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_21|, #memory_int=|v_#memory_int_590|, ~#x~0.base=|v_~#x~0.base_269|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_21|, P1Thread1of1ForFork0_#t~mem17=|v_P1Thread1of1ForFork0_#t~mem17_82|, P1Thread1of1ForFork0_#t~nondet12=|v_P1Thread1of1ForFork0_#t~nondet12_82|, P1Thread1of1ForFork0_#t~nondet11=|v_P1Thread1of1ForFork0_#t~nondet11_81|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_284, ~x$flush_delayed~0=v_~x$flush_delayed~0_164, ~x$mem_tmp~0=v_~x$mem_tmp~0_126, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_79, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_21|, ~y~0=v_~y~0_64, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_116, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_21, ~#x~0.offset=|v_~#x~0.offset_269|, ~x$w_buff1~0=v_~x$w_buff1~0_296, P1Thread1of1ForFork0_#t~mem13=|v_P1Thread1of1ForFork0_#t~mem13_43|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_141, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_464, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_134, P1Thread1of1ForFork0_#t~ite15=|v_P1Thread1of1ForFork0_#t~ite15_43|, P1Thread1of1ForFork0_#t~ite18=|v_P1Thread1of1ForFork0_#t~ite18_43|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_468, ~weak$$choice0~0=v_~weak$$choice0~0_108, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_21, #memory_int=|v_#memory_int_589|, ~#x~0.base=|v_~#x~0.base_269|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_21|, P1Thread1of1ForFork0_#t~mem16=|v_P1Thread1of1ForFork0_#t~mem16_43|, ~weak$$choice2~0=v_~weak$$choice2~0_174} AuxVars[|v_P1_#t~mem14_71|, |v_P1_#t~ite18_73|, |v_P1_#t~mem17_81|] AssignedVars[~x$w_buff0~0, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0_#t~mem14, ~x$flush_delayed~0, ~x$w_buff1~0, P1Thread1of1ForFork0_#t~mem13, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$mem_tmp~0, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~ite15, P1Thread1of1ForFork0_#t~ite18, ~x$w_buff0_used~0, ~weak$$choice0~0, P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, #memory_int, P1Thread1of1ForFork0_#t~mem16, P1Thread1of1ForFork0_#t~mem17, ~y~0, ~weak$$choice2~0, P1Thread1of1ForFork0_#t~nondet12, P1Thread1of1ForFork0_#t~nondet11] and [528] L779-->L782: Formula: (= v_~__unbuffered_p0_EBX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~y~0=v_~y~0_1, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EBX~0] [2022-12-06 04:23:48,506 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:23:48,507 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 971 [2022-12-06 04:23:48,507 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 214 flow [2022-12-06 04:23:48,507 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:23:48,507 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:23:48,507 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:23:48,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:23:48,507 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:23:48,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:23:48,508 INFO L85 PathProgramCache]: Analyzing trace with hash -560608438, now seen corresponding path program 2 times [2022-12-06 04:23:48,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:23:48,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691742249] [2022-12-06 04:23:48,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:23:48,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:23:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:23:48,636 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:23:48,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:23:48,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691742249] [2022-12-06 04:23:48,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691742249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:23:48,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:23:48,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:23:48,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076764761] [2022-12-06 04:23:48,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:23:48,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:23:48,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:23:48,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:23:48,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:23:48,637 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:23:48,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 214 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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:23:48,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:23:48,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:23:48,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:23:48,768 INFO L130 PetriNetUnfolder]: 292/552 cut-off events. [2022-12-06 04:23:48,769 INFO L131 PetriNetUnfolder]: For 918/919 co-relation queries the response was YES. [2022-12-06 04:23:48,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2087 conditions, 552 events. 292/552 cut-off events. For 918/919 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2535 event pairs, 31 based on Foata normal form. 56/596 useless extension candidates. Maximal degree in co-relation 2062. Up to 234 conditions per place. [2022-12-06 04:23:48,771 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 47 selfloop transitions, 7 changer transitions 22/78 dead transitions. [2022-12-06 04:23:48,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 78 transitions, 608 flow [2022-12-06 04:23:48,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:23:48,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:23:48,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-12-06 04:23:48,772 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5614035087719298 [2022-12-06 04:23:48,773 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 214 flow. Second operand 6 states and 64 transitions. [2022-12-06 04:23:48,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 78 transitions, 608 flow [2022-12-06 04:23:48,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 78 transitions, 597 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:23:48,775 INFO L231 Difference]: Finished difference. Result has 52 places, 33 transitions, 231 flow [2022-12-06 04:23:48,775 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=52, PETRI_TRANSITIONS=33} [2022-12-06 04:23:48,776 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 23 predicate places. [2022-12-06 04:23:48,776 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:23:48,776 INFO L89 Accepts]: Start accepts. Operand has 52 places, 33 transitions, 231 flow [2022-12-06 04:23:48,777 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:23:48,778 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:23:48,778 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 33 transitions, 231 flow [2022-12-06 04:23:48,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 33 transitions, 231 flow [2022-12-06 04:23:48,792 INFO L130 PetriNetUnfolder]: 36/141 cut-off events. [2022-12-06 04:23:48,792 INFO L131 PetriNetUnfolder]: For 333/376 co-relation queries the response was YES. [2022-12-06 04:23:48,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 141 events. 36/141 cut-off events. For 333/376 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 658 event pairs, 4 based on Foata normal form. 8/143 useless extension candidates. Maximal degree in co-relation 538. Up to 76 conditions per place. [2022-12-06 04:23:48,793 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 33 transitions, 231 flow [2022-12-06 04:23:48,793 INFO L188 LiptonReduction]: Number of co-enabled transitions 200 [2022-12-06 04:23:48,794 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:23:48,795 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 04:23:48,795 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 33 transitions, 231 flow [2022-12-06 04:23:48,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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:23:48,795 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:23:48,795 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:23:48,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:23:48,795 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:23:48,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:23:48,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1543519666, now seen corresponding path program 1 times [2022-12-06 04:23:48,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:23:48,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486415525] [2022-12-06 04:23:48,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:23:48,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:23:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:23:48,988 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:23:48,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:23:48,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486415525] [2022-12-06 04:23:48,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486415525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:23:48,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:23:48,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:23:48,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508294464] [2022-12-06 04:23:48,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:23:48,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:23:48,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:23:48,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:23:48,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:23:48,990 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-06 04:23:48,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 33 transitions, 231 flow. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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:23:48,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:23:48,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-06 04:23:48,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:23:49,141 INFO L130 PetriNetUnfolder]: 194/376 cut-off events. [2022-12-06 04:23:49,142 INFO L131 PetriNetUnfolder]: For 890/890 co-relation queries the response was YES. [2022-12-06 04:23:49,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1633 conditions, 376 events. 194/376 cut-off events. For 890/890 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1620 event pairs, 26 based on Foata normal form. 18/383 useless extension candidates. Maximal degree in co-relation 1606. Up to 157 conditions per place. [2022-12-06 04:23:49,144 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 43 selfloop transitions, 10 changer transitions 12/66 dead transitions. [2022-12-06 04:23:49,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 66 transitions, 552 flow [2022-12-06 04:23:49,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:23:49,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:23:49,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2022-12-06 04:23:49,145 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2022-12-06 04:23:49,145 INFO L175 Difference]: Start difference. First operand has 50 places, 33 transitions, 231 flow. Second operand 7 states and 57 transitions. [2022-12-06 04:23:49,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 66 transitions, 552 flow [2022-12-06 04:23:49,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 66 transitions, 484 flow, removed 18 selfloop flow, removed 7 redundant places. [2022-12-06 04:23:49,148 INFO L231 Difference]: Finished difference. Result has 52 places, 32 transitions, 209 flow [2022-12-06 04:23:49,148 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=209, PETRI_PLACES=52, PETRI_TRANSITIONS=32} [2022-12-06 04:23:49,149 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 23 predicate places. [2022-12-06 04:23:49,149 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:23:49,149 INFO L89 Accepts]: Start accepts. Operand has 52 places, 32 transitions, 209 flow [2022-12-06 04:23:49,150 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:23:49,150 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:23:49,150 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 32 transitions, 209 flow [2022-12-06 04:23:49,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 32 transitions, 209 flow [2022-12-06 04:23:49,159 INFO L130 PetriNetUnfolder]: 17/79 cut-off events. [2022-12-06 04:23:49,159 INFO L131 PetriNetUnfolder]: For 126/136 co-relation queries the response was YES. [2022-12-06 04:23:49,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 79 events. 17/79 cut-off events. For 126/136 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 295 event pairs, 0 based on Foata normal form. 4/80 useless extension candidates. Maximal degree in co-relation 246. Up to 21 conditions per place. [2022-12-06 04:23:49,160 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 32 transitions, 209 flow [2022-12-06 04:23:49,160 INFO L188 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-06 04:23:51,761 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 04:23:51,762 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2613 [2022-12-06 04:23:51,762 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 29 transitions, 207 flow [2022-12-06 04:23:51,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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:23:51,762 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:23:51,762 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:23:51,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:23:51,779 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:23:51,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:23:51,780 INFO L85 PathProgramCache]: Analyzing trace with hash 123208010, now seen corresponding path program 1 times [2022-12-06 04:23:51,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:23:51,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515997038] [2022-12-06 04:23:51,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:23:51,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:23:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:23:51,854 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:23:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:23:51,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:23:51,958 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:23:51,959 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 04:23:51,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 04:23:51,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 04:23:51,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 04:23:51,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:23:51,962 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:23:51,967 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:23:51,967 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:23:52,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:23:52 BasicIcfg [2022-12-06 04:23:52,070 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:23:52,070 INFO L158 Benchmark]: Toolchain (without parser) took 18425.37ms. Allocated memory was 213.9MB in the beginning and 619.7MB in the end (delta: 405.8MB). Free memory was 170.4MB in the beginning and 506.2MB in the end (delta: -335.8MB). Peak memory consumption was 70.5MB. Max. memory is 8.0GB. [2022-12-06 04:23:52,071 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 213.9MB. Free memory was 190.6MB in the beginning and 190.6MB in the end (delta: 83.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:23:52,071 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.40ms. Allocated memory is still 213.9MB. Free memory was 169.9MB in the beginning and 143.2MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 04:23:52,071 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.65ms. Allocated memory is still 213.9MB. Free memory was 143.2MB in the beginning and 140.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:23:52,071 INFO L158 Benchmark]: Boogie Preprocessor took 55.88ms. Allocated memory is still 213.9MB. Free memory was 140.6MB in the beginning and 138.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:23:52,071 INFO L158 Benchmark]: RCFGBuilder took 891.16ms. Allocated memory is still 213.9MB. Free memory was 138.5MB in the beginning and 80.8MB in the end (delta: 57.7MB). Peak memory consumption was 57.7MB. Max. memory is 8.0GB. [2022-12-06 04:23:52,071 INFO L158 Benchmark]: TraceAbstraction took 16910.46ms. Allocated memory was 213.9MB in the beginning and 619.7MB in the end (delta: 405.8MB). Free memory was 80.3MB in the beginning and 506.2MB in the end (delta: -426.0MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:23:52,072 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 213.9MB. Free memory was 190.6MB in the beginning and 190.6MB in the end (delta: 83.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 487.40ms. Allocated memory is still 213.9MB. Free memory was 169.9MB in the beginning and 143.2MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 75.65ms. Allocated memory is still 213.9MB. Free memory was 143.2MB in the beginning and 140.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.88ms. Allocated memory is still 213.9MB. Free memory was 140.6MB in the beginning and 138.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 891.16ms. Allocated memory is still 213.9MB. Free memory was 138.5MB in the beginning and 80.8MB in the end (delta: 57.7MB). Peak memory consumption was 57.7MB. Max. memory is 8.0GB. * TraceAbstraction took 16910.46ms. Allocated memory was 213.9MB in the beginning and 619.7MB in the end (delta: 405.8MB). Free memory was 80.3MB in the beginning and 506.2MB in the end (delta: -426.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.6s, 119 PlacesBefore, 29 PlacesAfterwards, 110 TransitionsBefore, 20 TransitionsAfterwards, 1152 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 58 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 92 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 813, independent: 768, independent conditional: 768, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 813, independent: 768, independent conditional: 0, independent unconditional: 768, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 813, independent: 768, independent conditional: 0, independent unconditional: 768, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 813, independent: 768, independent conditional: 0, independent unconditional: 768, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 680, independent: 651, independent conditional: 0, independent unconditional: 651, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 680, independent: 638, independent conditional: 0, independent unconditional: 638, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 243, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 233, dependent conditional: 0, dependent unconditional: 233, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 813, independent: 117, independent conditional: 0, independent unconditional: 117, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 680, unknown conditional: 0, unknown unconditional: 680] , Statistics on independence cache: Total cache size (in pairs): 989, Positive cache size: 960, Positive conditional cache size: 0, Positive unconditional cache size: 960, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 26 PlacesBefore, 26 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 166 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, independent: 46, independent conditional: 46, 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: 64, independent: 46, independent conditional: 0, independent unconditional: 46, 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: 64, independent: 46, independent conditional: 0, independent unconditional: 46, 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: 64, independent: 46, independent conditional: 0, independent unconditional: 46, 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: 59, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 59, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 142, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 64, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 59, unknown conditional: 0, unknown unconditional: 59] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 43, Positive conditional cache size: 0, Positive unconditional cache size: 43, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, 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, 29 PlacesBefore, 28 PlacesAfterwards, 19 TransitionsBefore, 18 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 128, independent: 99, independent conditional: 99, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 128, independent: 99, independent conditional: 13, independent unconditional: 86, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 128, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 128, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 128, independent: 77, independent conditional: 0, independent unconditional: 77, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 24, unknown conditional: 0, unknown unconditional: 24] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 68, Positive conditional cache size: 0, Positive unconditional cache size: 68, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 29 PlacesBefore, 29 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 44, independent: 31, independent conditional: 2, independent unconditional: 29, dependent: 13, dependent conditional: 2, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 44, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 44, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 42, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 44, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 70, Positive conditional cache size: 0, Positive unconditional cache size: 70, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, 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.1s, 32 PlacesBefore, 32 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 51, independent: 38, independent conditional: 16, independent unconditional: 22, dependent: 13, dependent conditional: 2, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 51, independent: 38, independent conditional: 16, independent unconditional: 22, dependent: 13, dependent conditional: 2, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 51, independent: 38, independent conditional: 16, independent unconditional: 22, dependent: 13, dependent conditional: 2, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 116, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 93, dependent conditional: 42, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 51, independent: 34, independent conditional: 14, independent unconditional: 20, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 8, unknown conditional: 4, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 74, Positive conditional cache size: 2, Positive unconditional cache size: 72, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, 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.1s, 36 PlacesBefore, 36 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 206 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, independent: 60, independent conditional: 60, 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: 76, independent: 60, independent conditional: 23, independent unconditional: 37, 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: 76, independent: 60, independent conditional: 23, independent unconditional: 37, 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: 76, independent: 60, independent conditional: 23, independent unconditional: 37, 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: 11, independent: 9, independent conditional: 5, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 98, independent: 77, independent conditional: 77, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 76, independent: 51, independent conditional: 18, independent unconditional: 33, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 11, unknown conditional: 5, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 83, Positive conditional cache size: 7, Positive unconditional cache size: 76, Negative cache size: 31, Negative conditional cache size: 2, Negative unconditional cache size: 29, 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, 41 PlacesBefore, 41 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 44, independent: 33, independent conditional: 11, independent unconditional: 22, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 44, independent: 33, independent conditional: 11, independent unconditional: 22, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 44, independent: 33, independent conditional: 11, independent unconditional: 22, dependent: 11, dependent conditional: 0, dependent unconditional: 11, 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: 44, independent: 33, independent conditional: 11, independent unconditional: 22, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 83, Positive conditional cache size: 7, Positive unconditional cache size: 76, Negative cache size: 31, Negative conditional cache size: 2, Negative unconditional cache size: 29, 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, 43 PlacesBefore, 43 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 220 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 29, independent: 17, independent conditional: 7, independent unconditional: 10, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 29, independent: 17, independent conditional: 7, independent unconditional: 10, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 29, independent: 17, independent conditional: 7, independent unconditional: 10, dependent: 12, dependent conditional: 0, dependent unconditional: 12, 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: 29, independent: 17, independent conditional: 7, independent unconditional: 10, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 83, Positive conditional cache size: 7, Positive unconditional cache size: 76, Negative cache size: 31, Negative conditional cache size: 2, Negative unconditional cache size: 29, 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.9s, 47 PlacesBefore, 47 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 51, independent: 41, independent conditional: 33, independent unconditional: 8, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 51, independent: 41, independent conditional: 33, independent unconditional: 8, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 51, independent: 41, independent conditional: 33, independent unconditional: 8, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 2, independent unconditional: 4, 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: 51, independent: 35, independent conditional: 31, independent unconditional: 4, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 6, unknown conditional: 2, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 123, Positive cache size: 92, Positive conditional cache size: 9, Positive unconditional cache size: 83, Negative cache size: 31, Negative conditional cache size: 2, Negative unconditional cache size: 29, 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, 50 PlacesBefore, 50 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, 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: 12, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 123, Positive cache size: 92, Positive conditional cache size: 9, Positive unconditional cache size: 83, Negative cache size: 31, Negative conditional cache size: 2, Negative unconditional cache size: 29, 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: 2.6s, 49 PlacesBefore, 46 PlacesAfterwards, 32 TransitionsBefore, 29 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 47, independent: 35, independent conditional: 23, independent unconditional: 12, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, independent: 35, independent conditional: 23, independent unconditional: 12, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, independent: 35, independent conditional: 23, independent unconditional: 12, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 24, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, independent: 35, independent conditional: 23, independent unconditional: 12, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 104, Positive conditional cache size: 10, Positive unconditional cache size: 94, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p1_EAX = 0; [L734] 0 int __unbuffered_p1_EBX = 0; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L739] 0 _Bool x$flush_delayed; [L740] 0 int x$mem_tmp; [L741] 0 _Bool x$r_buff0_thd0; [L742] 0 _Bool x$r_buff0_thd1; [L743] 0 _Bool x$r_buff0_thd2; [L744] 0 _Bool x$r_buff0_thd3; [L745] 0 _Bool x$r_buff1_thd0; [L746] 0 _Bool x$r_buff1_thd1; [L747] 0 _Bool x$r_buff1_thd2; [L748] 0 _Bool x$r_buff1_thd3; [L749] 0 _Bool x$read_delayed; [L750] 0 int *x$read_delayed_var; [L751] 0 int x$w_buff0; [L752] 0 _Bool x$w_buff0_used; [L753] 0 int x$w_buff1; [L754] 0 _Bool x$w_buff1_used; [L756] 0 int y = 0; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L849] 0 pthread_t t1749; [L850] FCALL, FORK 0 pthread_create(&t1749, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1749, ((void *)0), P0, ((void *)0))=-3, t1749={6: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L851] 0 pthread_t t1750; [L852] FCALL, FORK 0 pthread_create(&t1750, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1750, ((void *)0), P1, ((void *)0))=-2, t1749={6:0}, t1750={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L853] 0 pthread_t t1751; [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 x$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(x) [L766] 1 x$mem_tmp = x [L767] 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) [L767] EXPR 1 \read(x) [L767] 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) [L767] 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) [L768] 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)) [L769] 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)) [L770] 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)) [L771] 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)) [L772] 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)) [L773] 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)) [L774] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L775] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L776] EXPR 1 \read(x) [L776] 1 __unbuffered_p0_EAX = x [L777] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L777] 1 x = x$flush_delayed ? x$mem_tmp : x [L778] 1 x$flush_delayed = (_Bool)0 [L781] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L854] FCALL, FORK 0 pthread_create(&t1751, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1751, ((void *)0), P2, ((void *)0))=-1, t1749={6:0}, t1750={7:0}, t1751={5:0}, weak$$choice0=3, weak$$choice1=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L793] 2 y = 1 [L796] 2 __unbuffered_p1_EAX = y [L799] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L800] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L801] 2 x$flush_delayed = weak$$choice2 [L802] EXPR 2 \read(x) [L802] 2 x$mem_tmp = x [L803] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] EXPR 2 \read(x) [L803] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L804] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L805] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L806] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L807] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L808] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L809] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L810] EXPR 2 \read(x) [L810] 2 __unbuffered_p1_EBX = x [L811] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L811] 2 x = x$flush_delayed ? x$mem_tmp : x [L812] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L824] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L827] 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) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] 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) [L827] 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) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 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 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 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_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L786] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 1 return 0; [L817] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 2 return 0; [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 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) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] 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) [L860] 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) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 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 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 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 [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L868] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L868] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L869] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] - UnprovableResult [Line: 852]: 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: 854]: 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: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 149 locations, 4 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: 16.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 204 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 204 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 628 IncrementalHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 2 mSDtfsCounter, 628 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=231occurred in iteration=9, InterpolantAutomatonStates: 42, 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.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 1071 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:23:52,108 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...