/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-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix051_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 03:08:47,857 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 03:08:47,859 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 03:08:47,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 03:08:47,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 03:08:47,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 03:08:47,895 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 03:08:47,897 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 03:08:47,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 03:08:47,905 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 03:08:47,906 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 03:08:47,908 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 03:08:47,908 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 03:08:47,910 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 03:08:47,910 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 03:08:47,913 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 03:08:47,914 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 03:08:47,914 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 03:08:47,916 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 03:08:47,920 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 03:08:47,920 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 03:08:47,921 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 03:08:47,922 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 03:08:47,923 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 03:08:47,928 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 03:08:47,928 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 03:08:47,928 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 03:08:47,929 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 03:08:47,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 03:08:47,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 03:08:47,930 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 03:08:47,931 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 03:08:47,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 03:08:47,933 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 03:08:47,934 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 03:08:47,934 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 03:08:47,934 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 03:08:47,934 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 03:08:47,934 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 03:08:47,935 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 03:08:47,935 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 03:08:47,936 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-RepeatedSemanticLbe.epf [2022-12-13 03:08:47,961 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 03:08:47,961 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 03:08:47,962 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 03:08:47,963 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 03:08:47,963 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 03:08:47,963 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 03:08:47,963 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 03:08:47,963 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 03:08:47,964 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 03:08:47,964 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 03:08:47,964 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 03:08:47,964 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 03:08:47,964 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 03:08:47,965 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 03:08:47,965 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 03:08:47,965 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 03:08:47,965 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 03:08:47,965 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 03:08:47,965 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 03:08:47,965 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 03:08:47,965 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 03:08:47,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:08:47,965 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 03:08:47,966 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 03:08:47,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 03:08:47,966 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 03:08:47,966 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 03:08:47,966 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 03:08:47,966 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-13 03:08:48,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 03:08:48,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 03:08:48,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 03:08:48,252 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 03:08:48,252 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 03:08:48,253 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_tso.oepc.i [2022-12-13 03:08:49,336 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 03:08:49,552 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 03:08:49,553 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_tso.oepc.i [2022-12-13 03:08:49,563 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63e00182f/489233bfb02943d1a9bc84c8c5e4825c/FLAGb52febc11 [2022-12-13 03:08:49,575 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63e00182f/489233bfb02943d1a9bc84c8c5e4825c [2022-12-13 03:08:49,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 03:08:49,578 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 03:08:49,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 03:08:49,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 03:08:49,581 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 03:08:49,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:08:49" (1/1) ... [2022-12-13 03:08:49,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bb42a09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:08:49, skipping insertion in model container [2022-12-13 03:08:49,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:08:49" (1/1) ... [2022-12-13 03:08:49,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 03:08:49,620 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 03:08:49,711 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/mix051_tso.oepc.i[949,962] [2022-12-13 03:08:49,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:08:49,878 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 03:08:49,886 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/mix051_tso.oepc.i[949,962] [2022-12-13 03:08:49,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:08:49,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:08:49,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:08:50,013 INFO L208 MainTranslator]: Completed translation [2022-12-13 03:08:50,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:08:50 WrapperNode [2022-12-13 03:08:50,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 03:08:50,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 03:08:50,016 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 03:08:50,016 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 03:08:50,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:08:50" (1/1) ... [2022-12-13 03:08:50,045 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:08:50" (1/1) ... [2022-12-13 03:08:50,065 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2022-12-13 03:08:50,066 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 03:08:50,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 03:08:50,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 03:08:50,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 03:08:50,076 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:08:50" (1/1) ... [2022-12-13 03:08:50,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:08:50" (1/1) ... [2022-12-13 03:08:50,079 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:08:50" (1/1) ... [2022-12-13 03:08:50,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:08:50" (1/1) ... [2022-12-13 03:08:50,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:08:50" (1/1) ... [2022-12-13 03:08:50,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:08:50" (1/1) ... [2022-12-13 03:08:50,094 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:08:50" (1/1) ... [2022-12-13 03:08:50,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:08:50" (1/1) ... [2022-12-13 03:08:50,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 03:08:50,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 03:08:50,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 03:08:50,098 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 03:08:50,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:08:50" (1/1) ... [2022-12-13 03:08:50,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:08:50,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:08:50,131 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 03:08:50,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 03:08:50,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 03:08:50,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 03:08:50,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 03:08:50,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 03:08:50,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 03:08:50,164 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 03:08:50,164 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 03:08:50,164 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 03:08:50,164 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 03:08:50,164 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 03:08:50,165 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 03:08:50,165 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 03:08:50,165 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 03:08:50,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 03:08:50,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 03:08:50,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 03:08:50,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 03:08:50,166 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 03:08:50,331 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 03:08:50,333 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 03:08:50,611 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 03:08:50,705 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 03:08:50,705 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 03:08:50,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:08:50 BoogieIcfgContainer [2022-12-13 03:08:50,707 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 03:08:50,709 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 03:08:50,709 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 03:08:50,711 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 03:08:50,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:08:49" (1/3) ... [2022-12-13 03:08:50,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38825c94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:08:50, skipping insertion in model container [2022-12-13 03:08:50,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:08:50" (2/3) ... [2022-12-13 03:08:50,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38825c94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:08:50, skipping insertion in model container [2022-12-13 03:08:50,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:08:50" (3/3) ... [2022-12-13 03:08:50,713 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_tso.oepc.i [2022-12-13 03:08:50,726 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 03:08:50,726 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 03:08:50,726 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 03:08:50,773 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 03:08:50,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2022-12-13 03:08:50,867 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-13 03:08:50,868 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:08:50,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-13 03:08:50,875 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2022-12-13 03:08:50,878 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2022-12-13 03:08:50,880 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:08:50,894 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-13 03:08:50,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2022-12-13 03:08:50,919 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-13 03:08:50,919 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:08:50,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-13 03:08:50,922 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-13 03:08:50,922 INFO L226 LiptonReduction]: Number of co-enabled transitions 3044 [2022-12-13 03:08:59,864 INFO L241 LiptonReduction]: Total number of compositions: 98 [2022-12-13 03:08:59,884 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 03:08:59,893 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;@7ebf2b24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 03:08:59,894 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 03:08:59,904 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-13 03:08:59,904 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:08:59,904 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:08:59,905 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 03:08:59,905 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 03:08:59,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:08:59,909 INFO L85 PathProgramCache]: Analyzing trace with hash 542769457, now seen corresponding path program 1 times [2022-12-13 03:08:59,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:08:59,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238157884] [2022-12-13 03:08:59,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:08:59,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:09:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:09:00,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:09:00,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:09:00,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238157884] [2022-12-13 03:09:00,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238157884] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:09:00,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:09:00,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:09:00,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101141044] [2022-12-13 03:09:00,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:09:00,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:09:00,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:09:00,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:09:00,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:09:00,395 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 76 [2022-12-13 03:09:00,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 76 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:09:00,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:09:00,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 76 [2022-12-13 03:09:00,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:09:08,033 INFO L130 PetriNetUnfolder]: 57424/81312 cut-off events. [2022-12-13 03:09:08,033 INFO L131 PetriNetUnfolder]: For 146/146 co-relation queries the response was YES. [2022-12-13 03:09:08,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157465 conditions, 81312 events. 57424/81312 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 3873. Compared 590231 event pairs, 22678 based on Foata normal form. 0/51074 useless extension candidates. Maximal degree in co-relation 157453. Up to 63597 conditions per place. [2022-12-13 03:09:08,251 INFO L137 encePairwiseOnDemand]: 72/76 looper letters, 44 selfloop transitions, 2 changer transitions 64/125 dead transitions. [2022-12-13 03:09:08,252 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 125 transitions, 488 flow [2022-12-13 03:09:08,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:09:08,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:09:08,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2022-12-13 03:09:08,261 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6929824561403509 [2022-12-13 03:09:08,263 INFO L295 CegarLoopForPetriNet]: 89 programPoint places, 0 predicate places. [2022-12-13 03:09:08,263 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 125 transitions, 488 flow [2022-12-13 03:09:08,358 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 61 transitions, 232 flow [2022-12-13 03:09:08,804 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:09:08,805 INFO L89 Accepts]: Start accepts. Operand has 57 places, 61 transitions, 232 flow [2022-12-13 03:09:08,809 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:09:08,809 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:09:08,809 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 61 transitions, 232 flow [2022-12-13 03:09:08,816 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 61 transitions, 232 flow [2022-12-13 03:09:08,816 INFO L226 LiptonReduction]: Number of co-enabled transitions 948 [2022-12-13 03:09:09,805 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:09:09,806 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1002 [2022-12-13 03:09:09,807 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 61 transitions, 232 flow [2022-12-13 03:09:09,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:09:09,807 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:09:09,807 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:09:09,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 03:09:09,807 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 03:09:09,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:09:09,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1693439064, now seen corresponding path program 1 times [2022-12-13 03:09:09,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:09:09,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631287728] [2022-12-13 03:09:09,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:09:09,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:09:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:09:10,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:09:10,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:09:10,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631287728] [2022-12-13 03:09:10,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631287728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:09:10,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:09:10,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:09:10,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610600457] [2022-12-13 03:09:10,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:09:10,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:09:10,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:09:10,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:09:10,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:09:10,447 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2022-12-13 03:09:10,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 61 transitions, 232 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:09:10,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:09:10,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2022-12-13 03:09:10,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:09:11,558 INFO L130 PetriNetUnfolder]: 9609/14106 cut-off events. [2022-12-13 03:09:11,558 INFO L131 PetriNetUnfolder]: For 1010/1071 co-relation queries the response was YES. [2022-12-13 03:09:11,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39814 conditions, 14106 events. 9609/14106 cut-off events. For 1010/1071 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 89433 event pairs, 821 based on Foata normal form. 65/11689 useless extension candidates. Maximal degree in co-relation 39799. Up to 12458 conditions per place. [2022-12-13 03:09:11,651 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 62 selfloop transitions, 3 changer transitions 0/79 dead transitions. [2022-12-13 03:09:11,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 79 transitions, 441 flow [2022-12-13 03:09:11,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:09:11,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:09:11,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2022-12-13 03:09:11,652 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2022-12-13 03:09:11,653 INFO L295 CegarLoopForPetriNet]: 89 programPoint places, -30 predicate places. [2022-12-13 03:09:11,653 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 79 transitions, 441 flow [2022-12-13 03:09:11,710 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 79 transitions, 441 flow [2022-12-13 03:09:11,802 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:09:11,802 INFO L89 Accepts]: Start accepts. Operand has 59 places, 79 transitions, 441 flow [2022-12-13 03:09:11,803 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:09:11,803 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:09:11,803 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 79 transitions, 441 flow [2022-12-13 03:09:11,807 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 79 transitions, 441 flow [2022-12-13 03:09:11,807 INFO L226 LiptonReduction]: Number of co-enabled transitions 1046 [2022-12-13 03:09:11,964 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:09:11,965 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-13 03:09:11,965 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 79 transitions, 441 flow [2022-12-13 03:09:11,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:09:11,965 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:09:11,965 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:09:11,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 03:09:11,966 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 03:09:11,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:09:11,966 INFO L85 PathProgramCache]: Analyzing trace with hash -957005152, now seen corresponding path program 1 times [2022-12-13 03:09:11,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:09:11,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350639263] [2022-12-13 03:09:11,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:09:11,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:09:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:09:12,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:09:12,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:09:12,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350639263] [2022-12-13 03:09:12,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350639263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:09:12,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:09:12,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:09:12,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259121632] [2022-12-13 03:09:12,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:09:12,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:09:12,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:09:12,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:09:12,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:09:12,560 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2022-12-13 03:09:12,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 79 transitions, 441 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:09:12,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:09:12,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2022-12-13 03:09:12,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:09:14,211 INFO L130 PetriNetUnfolder]: 9577/13687 cut-off events. [2022-12-13 03:09:14,212 INFO L131 PetriNetUnfolder]: For 1006/1162 co-relation queries the response was YES. [2022-12-13 03:09:14,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52212 conditions, 13687 events. 9577/13687 cut-off events. For 1006/1162 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 79242 event pairs, 2459 based on Foata normal form. 68/11275 useless extension candidates. Maximal degree in co-relation 52194. Up to 12701 conditions per place. [2022-12-13 03:09:14,329 INFO L137 encePairwiseOnDemand]: 35/42 looper letters, 80 selfloop transitions, 9 changer transitions 0/103 dead transitions. [2022-12-13 03:09:14,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 103 transitions, 768 flow [2022-12-13 03:09:14,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:09:14,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:09:14,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2022-12-13 03:09:14,332 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6726190476190477 [2022-12-13 03:09:14,332 INFO L295 CegarLoopForPetriNet]: 89 programPoint places, -27 predicate places. [2022-12-13 03:09:14,332 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 103 transitions, 768 flow [2022-12-13 03:09:14,415 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 103 transitions, 768 flow [2022-12-13 03:09:14,513 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:09:14,514 INFO L89 Accepts]: Start accepts. Operand has 62 places, 103 transitions, 768 flow [2022-12-13 03:09:14,515 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:09:14,515 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:09:14,515 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 103 transitions, 768 flow [2022-12-13 03:09:14,518 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 103 transitions, 768 flow [2022-12-13 03:09:14,518 INFO L226 LiptonReduction]: Number of co-enabled transitions 1284 [2022-12-13 03:09:14,625 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:09:14,626 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-13 03:09:14,626 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 103 transitions, 768 flow [2022-12-13 03:09:14,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:09:14,627 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:09:14,627 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:09:14,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 03:09:14,627 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 03:09:14,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:09:14,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1384178421, now seen corresponding path program 1 times [2022-12-13 03:09:14,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:09:14,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560342682] [2022-12-13 03:09:14,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:09:14,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:09:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:09:14,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:09:14,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:09:14,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560342682] [2022-12-13 03:09:14,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560342682] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:09:14,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:09:14,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:09:14,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452216453] [2022-12-13 03:09:14,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:09:14,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:09:14,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:09:14,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:09:14,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:09:14,859 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2022-12-13 03:09:14,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 103 transitions, 768 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:09:14,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:09:14,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2022-12-13 03:09:14,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:09:16,448 INFO L130 PetriNetUnfolder]: 9806/14029 cut-off events. [2022-12-13 03:09:16,448 INFO L131 PetriNetUnfolder]: For 1813/1981 co-relation queries the response was YES. [2022-12-13 03:09:16,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66661 conditions, 14029 events. 9806/14029 cut-off events. For 1813/1981 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 81309 event pairs, 2591 based on Foata normal form. 109/11626 useless extension candidates. Maximal degree in co-relation 66640. Up to 13003 conditions per place. [2022-12-13 03:09:16,584 INFO L137 encePairwiseOnDemand]: 34/42 looper letters, 96 selfloop transitions, 11 changer transitions 0/121 dead transitions. [2022-12-13 03:09:16,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 121 transitions, 1135 flow [2022-12-13 03:09:16,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:09:16,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:09:16,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-12-13 03:09:16,586 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7321428571428571 [2022-12-13 03:09:16,586 INFO L295 CegarLoopForPetriNet]: 89 programPoint places, -24 predicate places. [2022-12-13 03:09:16,587 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 121 transitions, 1135 flow [2022-12-13 03:09:16,682 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 121 transitions, 1135 flow [2022-12-13 03:09:16,808 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:09:16,809 INFO L89 Accepts]: Start accepts. Operand has 65 places, 121 transitions, 1135 flow [2022-12-13 03:09:16,810 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:09:16,810 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:09:16,811 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 121 transitions, 1135 flow [2022-12-13 03:09:16,816 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 121 transitions, 1135 flow [2022-12-13 03:09:16,816 INFO L226 LiptonReduction]: Number of co-enabled transitions 1456 [2022-12-13 03:09:16,915 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:09:16,916 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-13 03:09:16,916 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 121 transitions, 1135 flow [2022-12-13 03:09:16,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:09:16,917 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:09:16,917 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:09:16,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 03:09:16,917 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 03:09:16,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:09:16,918 INFO L85 PathProgramCache]: Analyzing trace with hash 442434921, now seen corresponding path program 2 times [2022-12-13 03:09:16,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:09:16,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771386618] [2022-12-13 03:09:16,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:09:16,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:09:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:09:17,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:09:17,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:09:17,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771386618] [2022-12-13 03:09:17,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771386618] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:09:17,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:09:17,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:09:17,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651777780] [2022-12-13 03:09:17,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:09:17,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:09:17,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:09:17,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:09:17,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:09:17,269 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2022-12-13 03:09:17,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 121 transitions, 1135 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:09:17,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:09:17,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2022-12-13 03:09:17,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:09:19,281 INFO L130 PetriNetUnfolder]: 9843/14079 cut-off events. [2022-12-13 03:09:19,281 INFO L131 PetriNetUnfolder]: For 2571/2749 co-relation queries the response was YES. [2022-12-13 03:09:19,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80176 conditions, 14079 events. 9843/14079 cut-off events. For 2571/2749 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 81801 event pairs, 2591 based on Foata normal form. 93/11650 useless extension candidates. Maximal degree in co-relation 80152. Up to 13057 conditions per place. [2022-12-13 03:09:19,375 INFO L137 encePairwiseOnDemand]: 34/42 looper letters, 100 selfloop transitions, 17 changer transitions 0/131 dead transitions. [2022-12-13 03:09:19,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 131 transitions, 1469 flow [2022-12-13 03:09:19,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:09:19,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:09:19,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2022-12-13 03:09:19,376 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7476190476190476 [2022-12-13 03:09:19,377 INFO L295 CegarLoopForPetriNet]: 89 programPoint places, -20 predicate places. [2022-12-13 03:09:19,377 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 131 transitions, 1469 flow [2022-12-13 03:09:19,452 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 131 transitions, 1469 flow [2022-12-13 03:09:19,534 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:09:19,535 INFO L89 Accepts]: Start accepts. Operand has 69 places, 131 transitions, 1469 flow [2022-12-13 03:09:19,535 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:09:19,535 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:09:19,535 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 131 transitions, 1469 flow [2022-12-13 03:09:19,538 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 131 transitions, 1469 flow [2022-12-13 03:09:19,538 INFO L226 LiptonReduction]: Number of co-enabled transitions 1546 [2022-12-13 03:09:19,602 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:09:19,603 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-13 03:09:19,603 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 131 transitions, 1469 flow [2022-12-13 03:09:19,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:09:19,604 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:09:19,604 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:09:19,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 03:09:19,604 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 03:09:19,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:09:19,604 INFO L85 PathProgramCache]: Analyzing trace with hash 40138205, now seen corresponding path program 1 times [2022-12-13 03:09:19,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:09:19,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801931467] [2022-12-13 03:09:19,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:09:19,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:09:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:09:20,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:09:20,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:09:20,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801931467] [2022-12-13 03:09:20,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801931467] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:09:20,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:09:20,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:09:20,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489747603] [2022-12-13 03:09:20,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:09:20,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:09:20,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:09:20,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:09:20,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 03:09:20,101 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2022-12-13 03:09:20,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 131 transitions, 1469 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:09:20,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:09:20,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2022-12-13 03:09:20,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:09:21,474 INFO L130 PetriNetUnfolder]: 9801/14019 cut-off events. [2022-12-13 03:09:21,474 INFO L131 PetriNetUnfolder]: For 4510/4711 co-relation queries the response was YES. [2022-12-13 03:09:21,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93071 conditions, 14019 events. 9801/14019 cut-off events. For 4510/4711 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 81141 event pairs, 2591 based on Foata normal form. 205/11735 useless extension candidates. Maximal degree in co-relation 93044. Up to 13006 conditions per place. [2022-12-13 03:09:21,586 INFO L137 encePairwiseOnDemand]: 34/42 looper letters, 114 selfloop transitions, 18 changer transitions 0/146 dead transitions. [2022-12-13 03:09:21,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 146 transitions, 1919 flow [2022-12-13 03:09:21,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:09:21,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:09:21,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2022-12-13 03:09:21,587 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7285714285714285 [2022-12-13 03:09:21,588 INFO L295 CegarLoopForPetriNet]: 89 programPoint places, -16 predicate places. [2022-12-13 03:09:21,588 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 146 transitions, 1919 flow [2022-12-13 03:09:21,678 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 146 transitions, 1919 flow [2022-12-13 03:09:21,785 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:09:21,785 INFO L89 Accepts]: Start accepts. Operand has 73 places, 146 transitions, 1919 flow [2022-12-13 03:09:21,786 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:09:21,786 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:09:21,786 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 146 transitions, 1919 flow [2022-12-13 03:09:21,789 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 146 transitions, 1919 flow [2022-12-13 03:09:21,789 INFO L226 LiptonReduction]: Number of co-enabled transitions 1704 [2022-12-13 03:09:23,032 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:09:23,032 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1247 [2022-12-13 03:09:23,033 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 146 transitions, 1919 flow [2022-12-13 03:09:23,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:09:23,033 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:09:23,033 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:09:23,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 03:09:23,033 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 03:09:23,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:09:23,033 INFO L85 PathProgramCache]: Analyzing trace with hash 832801643, now seen corresponding path program 1 times [2022-12-13 03:09:23,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:09:23,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363132440] [2022-12-13 03:09:23,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:09:23,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:09:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:09:23,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:09:23,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:09:23,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363132440] [2022-12-13 03:09:23,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363132440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:09:23,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:09:23,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:09:23,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630524639] [2022-12-13 03:09:23,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:09:23,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:09:23,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:09:23,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:09:23,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:09:23,354 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2022-12-13 03:09:23,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 146 transitions, 1919 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:09:23,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:09:23,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2022-12-13 03:09:23,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:09:24,903 INFO L130 PetriNetUnfolder]: 10869/15589 cut-off events. [2022-12-13 03:09:24,903 INFO L131 PetriNetUnfolder]: For 7019/7201 co-relation queries the response was YES. [2022-12-13 03:09:24,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118311 conditions, 15589 events. 10869/15589 cut-off events. For 7019/7201 co-relation queries the response was YES. Maximal size of possible extension queue 723. Compared 92425 event pairs, 2591 based on Foata normal form. 245/13065 useless extension candidates. Maximal degree in co-relation 118281. Up to 14496 conditions per place. [2022-12-13 03:09:25,040 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 137 selfloop transitions, 12 changer transitions 0/163 dead transitions. [2022-12-13 03:09:25,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 163 transitions, 2461 flow [2022-12-13 03:09:25,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:09:25,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:09:25,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2022-12-13 03:09:25,041 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6372093023255814 [2022-12-13 03:09:25,042 INFO L295 CegarLoopForPetriNet]: 89 programPoint places, -12 predicate places. [2022-12-13 03:09:25,042 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 163 transitions, 2461 flow [2022-12-13 03:09:25,161 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 163 transitions, 2461 flow [2022-12-13 03:09:25,286 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:09:25,286 INFO L89 Accepts]: Start accepts. Operand has 77 places, 163 transitions, 2461 flow [2022-12-13 03:09:25,287 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:09:25,287 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:09:25,287 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 163 transitions, 2461 flow [2022-12-13 03:09:25,291 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 163 transitions, 2461 flow [2022-12-13 03:09:25,291 INFO L226 LiptonReduction]: Number of co-enabled transitions 1928 [2022-12-13 03:09:25,445 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:09:25,446 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-13 03:09:25,446 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 163 transitions, 2461 flow [2022-12-13 03:09:25,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:09:25,447 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:09:25,447 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:09:25,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 03:09:25,447 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 03:09:25,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:09:25,447 INFO L85 PathProgramCache]: Analyzing trace with hash -559061281, now seen corresponding path program 1 times [2022-12-13 03:09:25,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:09:25,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290221265] [2022-12-13 03:09:25,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:09:25,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:09:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:09:25,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:09:25,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:09:25,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290221265] [2022-12-13 03:09:25,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290221265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:09:25,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:09:25,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:09:25,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71688249] [2022-12-13 03:09:25,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:09:25,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:09:25,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:09:25,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:09:25,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:09:25,548 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2022-12-13 03:09:25,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 163 transitions, 2461 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:09:25,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:09:25,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2022-12-13 03:09:25,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:09:29,032 INFO L130 PetriNetUnfolder]: 19132/26426 cut-off events. [2022-12-13 03:09:29,033 INFO L131 PetriNetUnfolder]: For 132828/136818 co-relation queries the response was YES. [2022-12-13 03:09:29,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208607 conditions, 26426 events. 19132/26426 cut-off events. For 132828/136818 co-relation queries the response was YES. Maximal size of possible extension queue 1212. Compared 158348 event pairs, 3163 based on Foata normal form. 347/22792 useless extension candidates. Maximal degree in co-relation 208574. Up to 24700 conditions per place. [2022-12-13 03:09:29,345 INFO L137 encePairwiseOnDemand]: 29/43 looper letters, 201 selfloop transitions, 37 changer transitions 0/252 dead transitions. [2022-12-13 03:09:29,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 252 transitions, 4335 flow [2022-12-13 03:09:29,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:09:29,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:09:29,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2022-12-13 03:09:29,347 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7131782945736435 [2022-12-13 03:09:29,348 INFO L295 CegarLoopForPetriNet]: 89 programPoint places, -10 predicate places. [2022-12-13 03:09:29,348 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 252 transitions, 4335 flow [2022-12-13 03:09:29,579 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 252 transitions, 4335 flow [2022-12-13 03:09:29,824 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:09:29,824 INFO L89 Accepts]: Start accepts. Operand has 79 places, 252 transitions, 4335 flow [2022-12-13 03:09:29,825 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:09:29,825 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:09:29,826 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 252 transitions, 4335 flow [2022-12-13 03:09:29,832 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 252 transitions, 4335 flow [2022-12-13 03:09:29,832 INFO L226 LiptonReduction]: Number of co-enabled transitions 2206 [2022-12-13 03:09:30,027 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:09:30,028 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 204 [2022-12-13 03:09:30,028 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 252 transitions, 4335 flow [2022-12-13 03:09:30,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:09:30,028 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:09:30,028 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:09:30,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 03:09:30,029 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 03:09:30,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:09:30,029 INFO L85 PathProgramCache]: Analyzing trace with hash 666457834, now seen corresponding path program 1 times [2022-12-13 03:09:30,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:09:30,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441414972] [2022-12-13 03:09:30,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:09:30,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:09:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:09:30,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:09:30,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:09:30,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441414972] [2022-12-13 03:09:30,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441414972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:09:30,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:09:30,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:09:30,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555638959] [2022-12-13 03:09:30,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:09:30,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:09:30,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:09:30,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:09:30,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:09:30,136 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2022-12-13 03:09:30,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 252 transitions, 4335 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:09:30,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:09:30,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2022-12-13 03:09:30,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:09:32,364 INFO L130 PetriNetUnfolder]: 12220/17733 cut-off events. [2022-12-13 03:09:32,364 INFO L131 PetriNetUnfolder]: For 87028/89596 co-relation queries the response was YES. [2022-12-13 03:09:32,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157550 conditions, 17733 events. 12220/17733 cut-off events. For 87028/89596 co-relation queries the response was YES. Maximal size of possible extension queue 884. Compared 109703 event pairs, 1245 based on Foata normal form. 833/15929 useless extension candidates. Maximal degree in co-relation 157514. Up to 16371 conditions per place. [2022-12-13 03:09:32,555 INFO L137 encePairwiseOnDemand]: 29/43 looper letters, 214 selfloop transitions, 73 changer transitions 0/301 dead transitions. [2022-12-13 03:09:32,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 301 transitions, 5747 flow [2022-12-13 03:09:32,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:09:32,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:09:32,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-12-13 03:09:32,557 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7383720930232558 [2022-12-13 03:09:32,557 INFO L295 CegarLoopForPetriNet]: 89 programPoint places, -7 predicate places. [2022-12-13 03:09:32,557 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 301 transitions, 5747 flow [2022-12-13 03:09:32,709 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 301 transitions, 5747 flow [2022-12-13 03:09:32,886 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:09:32,887 INFO L89 Accepts]: Start accepts. Operand has 82 places, 301 transitions, 5747 flow [2022-12-13 03:09:32,889 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:09:32,889 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:09:32,889 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 301 transitions, 5747 flow [2022-12-13 03:09:32,902 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 301 transitions, 5747 flow [2022-12-13 03:09:32,902 INFO L226 LiptonReduction]: Number of co-enabled transitions 2506 [2022-12-13 03:09:33,029 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:09:33,030 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-13 03:09:33,030 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 301 transitions, 5747 flow [2022-12-13 03:09:33,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:09:33,030 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:09:33,030 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:09:33,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 03:09:33,030 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 03:09:33,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:09:33,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1640134128, now seen corresponding path program 1 times [2022-12-13 03:09:33,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:09:33,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407702144] [2022-12-13 03:09:33,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:09:33,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:09:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:09:33,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:09:33,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:09:33,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407702144] [2022-12-13 03:09:33,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407702144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:09:33,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:09:33,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:09:33,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525883999] [2022-12-13 03:09:33,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:09:33,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:09:33,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:09:33,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:09:33,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:09:33,195 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2022-12-13 03:09:33,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 301 transitions, 5747 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:09:33,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:09:33,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2022-12-13 03:09:33,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:09:34,821 INFO L130 PetriNetUnfolder]: 7069/10711 cut-off events. [2022-12-13 03:09:34,822 INFO L131 PetriNetUnfolder]: For 66234/68334 co-relation queries the response was YES. [2022-12-13 03:09:34,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105197 conditions, 10711 events. 7069/10711 cut-off events. For 66234/68334 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 65454 event pairs, 183 based on Foata normal form. 949/10013 useless extension candidates. Maximal degree in co-relation 105158. Up to 9592 conditions per place. [2022-12-13 03:09:34,911 INFO L137 encePairwiseOnDemand]: 29/43 looper letters, 205 selfloop transitions, 97 changer transitions 0/316 dead transitions. [2022-12-13 03:09:34,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 316 transitions, 6598 flow [2022-12-13 03:09:34,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:09:34,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:09:34,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2022-12-13 03:09:34,912 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7441860465116279 [2022-12-13 03:09:34,913 INFO L295 CegarLoopForPetriNet]: 89 programPoint places, -3 predicate places. [2022-12-13 03:09:34,913 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 316 transitions, 6598 flow [2022-12-13 03:09:34,984 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 316 transitions, 6598 flow [2022-12-13 03:09:35,067 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:09:35,068 INFO L89 Accepts]: Start accepts. Operand has 86 places, 316 transitions, 6598 flow [2022-12-13 03:09:35,069 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:09:35,070 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:09:35,070 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 316 transitions, 6598 flow [2022-12-13 03:09:35,079 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 316 transitions, 6598 flow [2022-12-13 03:09:35,079 INFO L226 LiptonReduction]: Number of co-enabled transitions 2494 [2022-12-13 03:09:35,133 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:09:35,133 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-13 03:09:35,134 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 316 transitions, 6598 flow [2022-12-13 03:09:35,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:09:35,134 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:09:35,134 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:09:35,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 03:09:35,134 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 03:09:35,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:09:35,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1464126146, now seen corresponding path program 1 times [2022-12-13 03:09:35,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:09:35,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978508911] [2022-12-13 03:09:35,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:09:35,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:09:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:09:35,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:09:35,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:09:35,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978508911] [2022-12-13 03:09:35,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978508911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:09:35,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:09:35,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:09:35,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59057725] [2022-12-13 03:09:35,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:09:35,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:09:35,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:09:35,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:09:35,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:09:35,250 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2022-12-13 03:09:35,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 316 transitions, 6598 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:09:35,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:09:35,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2022-12-13 03:09:35,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:09:37,453 INFO L130 PetriNetUnfolder]: 12389/18733 cut-off events. [2022-12-13 03:09:37,453 INFO L131 PetriNetUnfolder]: For 181510/185535 co-relation queries the response was YES. [2022-12-13 03:09:37,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196010 conditions, 18733 events. 12389/18733 cut-off events. For 181510/185535 co-relation queries the response was YES. Maximal size of possible extension queue 750. Compared 124418 event pairs, 275 based on Foata normal form. 789/16459 useless extension candidates. Maximal degree in co-relation 195968. Up to 16510 conditions per place. [2022-12-13 03:09:37,591 INFO L137 encePairwiseOnDemand]: 39/43 looper letters, 469 selfloop transitions, 19 changer transitions 57/574 dead transitions. [2022-12-13 03:09:37,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 574 transitions, 13407 flow [2022-12-13 03:09:37,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:09:37,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:09:37,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2022-12-13 03:09:37,592 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7034883720930233 [2022-12-13 03:09:37,593 INFO L295 CegarLoopForPetriNet]: 89 programPoint places, 0 predicate places. [2022-12-13 03:09:37,593 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 574 transitions, 13407 flow [2022-12-13 03:09:37,693 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 517 transitions, 12030 flow [2022-12-13 03:09:37,931 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:09:37,931 INFO L89 Accepts]: Start accepts. Operand has 89 places, 517 transitions, 12030 flow [2022-12-13 03:09:37,935 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:09:37,935 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:09:37,935 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 517 transitions, 12030 flow [2022-12-13 03:09:37,970 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 517 transitions, 12030 flow [2022-12-13 03:09:37,971 INFO L226 LiptonReduction]: Number of co-enabled transitions 3284 [2022-12-13 03:09:38,081 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:09:38,082 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 151 [2022-12-13 03:09:38,082 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 517 transitions, 12030 flow [2022-12-13 03:09:38,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:09:38,082 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:09:38,083 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:09:38,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 03:09:38,083 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 03:09:38,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:09:38,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1145982274, now seen corresponding path program 1 times [2022-12-13 03:09:38,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:09:38,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951793990] [2022-12-13 03:09:38,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:09:38,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:09:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:09:38,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:09:38,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:09:38,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951793990] [2022-12-13 03:09:38,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951793990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:09:38,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:09:38,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 03:09:38,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11247457] [2022-12-13 03:09:38,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:09:38,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:09:38,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:09:38,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:09:38,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 03:09:38,275 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2022-12-13 03:09:38,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 517 transitions, 12030 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:09:38,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:09:38,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2022-12-13 03:09:38,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:09:40,033 INFO L130 PetriNetUnfolder]: 7177/10850 cut-off events. [2022-12-13 03:09:40,033 INFO L131 PetriNetUnfolder]: For 136568/139738 co-relation queries the response was YES. [2022-12-13 03:09:40,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122440 conditions, 10850 events. 7177/10850 cut-off events. For 136568/139738 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 66012 event pairs, 26 based on Foata normal form. 919/10003 useless extension candidates. Maximal degree in co-relation 122395. Up to 9054 conditions per place. [2022-12-13 03:09:40,121 INFO L137 encePairwiseOnDemand]: 29/43 looper letters, 193 selfloop transitions, 109 changer transitions 195/511 dead transitions. [2022-12-13 03:09:40,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 511 transitions, 12878 flow [2022-12-13 03:09:40,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 03:09:40,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 03:09:40,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2022-12-13 03:09:40,122 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6550387596899225 [2022-12-13 03:09:40,123 INFO L295 CegarLoopForPetriNet]: 89 programPoint places, 4 predicate places. [2022-12-13 03:09:40,123 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 511 transitions, 12878 flow [2022-12-13 03:09:40,193 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 316 transitions, 7782 flow [2022-12-13 03:09:40,492 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:09:40,492 INFO L89 Accepts]: Start accepts. Operand has 92 places, 316 transitions, 7782 flow [2022-12-13 03:09:40,506 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:09:40,507 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:09:40,507 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 316 transitions, 7782 flow [2022-12-13 03:09:40,522 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 316 transitions, 7782 flow [2022-12-13 03:09:40,522 INFO L226 LiptonReduction]: Number of co-enabled transitions 2004 [2022-12-13 03:09:42,398 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 03:09:42,399 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1908 [2022-12-13 03:09:42,399 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 315 transitions, 7756 flow [2022-12-13 03:09:42,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:09:42,400 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:09:42,400 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:09:42,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 03:09:42,400 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 03:09:42,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:09:42,400 INFO L85 PathProgramCache]: Analyzing trace with hash 507587894, now seen corresponding path program 1 times [2022-12-13 03:09:42,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:09:42,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592921546] [2022-12-13 03:09:42,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:09:42,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:09:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:09:42,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:09:42,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:09:42,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592921546] [2022-12-13 03:09:42,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592921546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:09:42,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:09:42,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:09:42,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036302234] [2022-12-13 03:09:42,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:09:42,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:09:42,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:09:42,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:09:42,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:09:42,568 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2022-12-13 03:09:42,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 315 transitions, 7756 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:09:42,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:09:42,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2022-12-13 03:09:42,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:09:44,194 INFO L130 PetriNetUnfolder]: 8998/13379 cut-off events. [2022-12-13 03:09:44,194 INFO L131 PetriNetUnfolder]: For 190609/193882 co-relation queries the response was YES. [2022-12-13 03:09:44,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159830 conditions, 13379 events. 8998/13379 cut-off events. For 190609/193882 co-relation queries the response was YES. Maximal size of possible extension queue 699. Compared 82881 event pairs, 44 based on Foata normal form. 307/11194 useless extension candidates. Maximal degree in co-relation 159782. Up to 11488 conditions per place. [2022-12-13 03:09:44,270 INFO L137 encePairwiseOnDemand]: 41/44 looper letters, 272 selfloop transitions, 12 changer transitions 272/584 dead transitions. [2022-12-13 03:09:44,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 584 transitions, 15875 flow [2022-12-13 03:09:44,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:09:44,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:09:44,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2022-12-13 03:09:44,271 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7159090909090909 [2022-12-13 03:09:44,272 INFO L295 CegarLoopForPetriNet]: 89 programPoint places, 5 predicate places. [2022-12-13 03:09:44,272 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 584 transitions, 15875 flow [2022-12-13 03:09:44,326 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 312 transitions, 8204 flow [2022-12-13 03:09:44,464 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:09:44,464 INFO L89 Accepts]: Start accepts. Operand has 92 places, 312 transitions, 8204 flow [2022-12-13 03:09:44,466 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:09:44,467 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:09:44,467 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 312 transitions, 8204 flow [2022-12-13 03:09:44,478 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 312 transitions, 8204 flow [2022-12-13 03:09:44,478 INFO L226 LiptonReduction]: Number of co-enabled transitions 1840 [2022-12-13 03:09:44,667 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:09:44,668 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 204 [2022-12-13 03:09:44,668 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 312 transitions, 8204 flow [2022-12-13 03:09:44,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:09:44,668 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:09:44,669 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:09:44,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 03:09:44,669 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 03:09:44,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:09:44,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1602544660, now seen corresponding path program 1 times [2022-12-13 03:09:44,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:09:44,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120590147] [2022-12-13 03:09:44,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:09:44,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:09:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:09:44,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:09:44,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:09:44,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120590147] [2022-12-13 03:09:44,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120590147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:09:44,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:09:44,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:09:44,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490074765] [2022-12-13 03:09:44,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:09:44,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:09:44,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:09:44,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:09:44,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:09:44,807 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2022-12-13 03:09:44,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 312 transitions, 8204 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:09:44,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:09:44,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2022-12-13 03:09:44,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:09:46,745 INFO L130 PetriNetUnfolder]: 8683/13316 cut-off events. [2022-12-13 03:09:46,745 INFO L131 PetriNetUnfolder]: For 207778/210943 co-relation queries the response was YES. [2022-12-13 03:09:46,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168020 conditions, 13316 events. 8683/13316 cut-off events. For 207778/210943 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 85384 event pairs, 65 based on Foata normal form. 300/10860 useless extension candidates. Maximal degree in co-relation 167969. Up to 11577 conditions per place. [2022-12-13 03:09:46,819 INFO L137 encePairwiseOnDemand]: 41/44 looper letters, 168 selfloop transitions, 4 changer transitions 350/547 dead transitions. [2022-12-13 03:09:46,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 547 transitions, 15796 flow [2022-12-13 03:09:46,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:09:46,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:09:46,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2022-12-13 03:09:46,820 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.625 [2022-12-13 03:09:46,821 INFO L295 CegarLoopForPetriNet]: 89 programPoint places, 6 predicate places. [2022-12-13 03:09:46,821 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 547 transitions, 15796 flow [2022-12-13 03:09:46,868 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 197 transitions, 5382 flow [2022-12-13 03:09:47,057 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:09:47,058 INFO L89 Accepts]: Start accepts. Operand has 88 places, 197 transitions, 5382 flow [2022-12-13 03:09:47,059 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:09:47,059 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:09:47,059 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 197 transitions, 5382 flow [2022-12-13 03:09:47,065 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 197 transitions, 5382 flow [2022-12-13 03:09:47,065 INFO L226 LiptonReduction]: Number of co-enabled transitions 766 [2022-12-13 03:09:47,094 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:09:47,094 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-13 03:09:47,095 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 197 transitions, 5382 flow [2022-12-13 03:09:47,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:09:47,095 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:09:47,095 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:09:47,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 03:09:47,095 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 03:09:47,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:09:47,095 INFO L85 PathProgramCache]: Analyzing trace with hash -897468962, now seen corresponding path program 1 times [2022-12-13 03:09:47,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:09:47,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636518933] [2022-12-13 03:09:47,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:09:47,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:09:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 03:09:47,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 03:09:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 03:09:47,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 03:09:47,197 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 03:09:47,198 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 03:09:47,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 03:09:47,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 03:09:47,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 03:09:47,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 03:09:47,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 03:09:47,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 03:09:47,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 03:09:47,202 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:09:47,207 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 03:09:47,207 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 03:09:47,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:09:47 BasicIcfg [2022-12-13 03:09:47,277 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 03:09:47,278 INFO L158 Benchmark]: Toolchain (without parser) took 57699.81ms. Allocated memory was 255.9MB in the beginning and 5.3GB in the end (delta: 5.0GB). Free memory was 231.2MB in the beginning and 3.3GB in the end (delta: -3.1GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2022-12-13 03:09:47,278 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 255.9MB. Free memory is still 231.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 03:09:47,278 INFO L158 Benchmark]: CACSL2BoogieTranslator took 435.97ms. Allocated memory is still 255.9MB. Free memory was 230.7MB in the beginning and 202.9MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-13 03:09:47,278 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.00ms. Allocated memory is still 255.9MB. Free memory was 202.9MB in the beginning and 200.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 03:09:47,279 INFO L158 Benchmark]: Boogie Preprocessor took 31.42ms. Allocated memory is still 255.9MB. Free memory was 200.3MB in the beginning and 198.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 03:09:47,279 INFO L158 Benchmark]: RCFGBuilder took 609.27ms. Allocated memory is still 255.9MB. Free memory was 198.2MB in the beginning and 159.9MB in the end (delta: 38.3MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2022-12-13 03:09:47,279 INFO L158 Benchmark]: TraceAbstraction took 56568.19ms. Allocated memory was 255.9MB in the beginning and 5.3GB in the end (delta: 5.0GB). Free memory was 158.4MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-12-13 03:09:47,280 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.09ms. Allocated memory is still 255.9MB. Free memory is still 231.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 435.97ms. Allocated memory is still 255.9MB. Free memory was 230.7MB in the beginning and 202.9MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.00ms. Allocated memory is still 255.9MB. Free memory was 202.9MB in the beginning and 200.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.42ms. Allocated memory is still 255.9MB. Free memory was 200.3MB in the beginning and 198.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 609.27ms. Allocated memory is still 255.9MB. Free memory was 198.2MB in the beginning and 159.9MB in the end (delta: 38.3MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * TraceAbstraction took 56568.19ms. Allocated memory was 255.9MB in the beginning and 5.3GB in the end (delta: 5.0GB). Free memory was 158.4MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.9s, 136 PlacesBefore, 89 PlacesAfterwards, 125 TransitionsBefore, 76 TransitionsAfterwards, 3044 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 52 ConcurrentYvCompositions, 2 ChoiceCompositions, 98 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4861, independent: 4661, independent conditional: 4661, independent unconditional: 0, dependent: 200, dependent conditional: 200, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4861, independent: 4661, independent conditional: 0, independent unconditional: 4661, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4861, independent: 4661, independent conditional: 0, independent unconditional: 4661, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4861, independent: 4661, independent conditional: 0, independent unconditional: 4661, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2495, independent: 2414, independent conditional: 0, independent unconditional: 2414, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2495, independent: 2400, independent conditional: 0, independent unconditional: 2400, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 95, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 382, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 374, dependent conditional: 0, dependent unconditional: 374, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4861, independent: 2247, independent conditional: 0, independent unconditional: 2247, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 2495, unknown conditional: 0, unknown unconditional: 2495] , Statistics on independence cache: Total cache size (in pairs): 5131, Positive cache size: 5050, Positive conditional cache size: 0, Positive unconditional cache size: 5050, Negative cache size: 81, Negative conditional cache size: 0, Negative unconditional cache size: 81, 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: 1.0s, 57 PlacesBefore, 57 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 948 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 138, independent: 128, independent conditional: 128, 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: 138, independent: 128, independent conditional: 42, independent unconditional: 86, dependent: 10, dependent conditional: 6, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 138, independent: 128, independent conditional: 9, independent unconditional: 119, 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: 138, independent: 128, independent conditional: 9, independent unconditional: 119, 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: 81, independent: 74, independent conditional: 6, independent unconditional: 68, 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: 81, independent: 74, independent conditional: 0, independent unconditional: 74, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 138, independent: 54, independent conditional: 3, independent unconditional: 51, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 81, unknown conditional: 6, unknown unconditional: 75] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 74, Positive conditional cache size: 6, Positive unconditional cache size: 68, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 39, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 59 PlacesBefore, 59 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 1046 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 148, independent: 137, independent conditional: 137, 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: 148, independent: 137, independent conditional: 55, independent unconditional: 82, dependent: 11, dependent conditional: 10, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 158, independent: 137, independent conditional: 20, independent unconditional: 117, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 158, independent: 137, independent conditional: 20, independent unconditional: 117, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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: 158, independent: 132, independent conditional: 16, independent unconditional: 116, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 79, Positive conditional cache size: 10, Positive unconditional cache size: 69, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 55, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 62 PlacesBefore, 62 PlacesAfterwards, 103 TransitionsBefore, 103 TransitionsAfterwards, 1284 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 387, independent: 366, independent conditional: 366, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 387, independent: 366, independent conditional: 165, independent unconditional: 201, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 423, independent: 366, independent conditional: 42, independent unconditional: 324, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 423, independent: 366, independent conditional: 42, independent unconditional: 324, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 39, independent: 38, independent conditional: 3, independent unconditional: 35, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 39, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 423, independent: 328, independent conditional: 39, independent unconditional: 289, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 39, unknown conditional: 3, unknown unconditional: 36] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 117, Positive conditional cache size: 13, Positive unconditional cache size: 104, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 180, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 65 PlacesBefore, 65 PlacesAfterwards, 121 TransitionsBefore, 121 TransitionsAfterwards, 1456 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 449, independent: 424, independent conditional: 424, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 449, independent: 424, independent conditional: 214, independent unconditional: 210, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 515, independent: 424, independent conditional: 61, independent unconditional: 363, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 515, independent: 424, independent conditional: 61, independent unconditional: 363, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 515, independent: 420, independent conditional: 59, independent unconditional: 361, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 130, Positive cache size: 121, Positive conditional cache size: 15, Positive unconditional cache size: 106, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 244, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 69 PlacesBefore, 69 PlacesAfterwards, 131 TransitionsBefore, 131 TransitionsAfterwards, 1546 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 555, independent: 525, independent conditional: 525, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 555, independent: 525, independent conditional: 283, independent unconditional: 242, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 659, independent: 525, independent conditional: 73, independent unconditional: 452, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 659, independent: 525, independent conditional: 73, independent unconditional: 452, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 659, independent: 519, independent conditional: 73, independent unconditional: 446, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 127, Positive conditional cache size: 15, Positive unconditional cache size: 112, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 344, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 73 PlacesBefore, 73 PlacesAfterwards, 146 TransitionsBefore, 146 TransitionsAfterwards, 1704 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 484, independent: 410, independent conditional: 410, independent unconditional: 0, dependent: 74, dependent conditional: 74, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 484, independent: 410, independent conditional: 210, independent unconditional: 200, dependent: 74, dependent conditional: 30, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 634, independent: 410, independent conditional: 90, independent unconditional: 320, dependent: 224, dependent conditional: 0, dependent unconditional: 224, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 634, independent: 410, independent conditional: 90, independent unconditional: 320, dependent: 224, dependent conditional: 0, dependent unconditional: 224, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 14, independent conditional: 5, independent unconditional: 9, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 634, independent: 396, independent conditional: 85, independent unconditional: 311, dependent: 221, dependent conditional: 0, dependent unconditional: 221, unknown: 17, unknown conditional: 5, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 141, Positive conditional cache size: 20, Positive unconditional cache size: 121, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 300, Maximal queried relation: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 77 PlacesBefore, 77 PlacesAfterwards, 163 TransitionsBefore, 163 TransitionsAfterwards, 1928 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 729, independent: 687, independent conditional: 687, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 729, independent: 687, independent conditional: 539, independent unconditional: 148, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 933, independent: 687, independent conditional: 209, independent unconditional: 478, dependent: 246, dependent conditional: 8, dependent unconditional: 238, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 933, independent: 687, independent conditional: 209, independent unconditional: 478, dependent: 246, dependent conditional: 8, dependent unconditional: 238, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 933, independent: 682, independent conditional: 204, independent unconditional: 478, dependent: 243, dependent conditional: 5, dependent unconditional: 238, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 146, Positive conditional cache size: 25, Positive unconditional cache size: 121, Negative cache size: 15, Negative conditional cache size: 3, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 568, Maximal queried relation: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 79 PlacesBefore, 79 PlacesAfterwards, 252 TransitionsBefore, 252 TransitionsAfterwards, 2206 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1130, independent: 1064, independent conditional: 1064, independent unconditional: 0, dependent: 66, dependent conditional: 66, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1130, independent: 1064, independent conditional: 912, independent unconditional: 152, dependent: 66, dependent conditional: 66, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1542, independent: 1064, independent conditional: 366, independent unconditional: 698, dependent: 478, dependent conditional: 0, dependent unconditional: 478, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1542, independent: 1064, independent conditional: 366, independent unconditional: 698, dependent: 478, dependent conditional: 0, dependent unconditional: 478, 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: 1542, independent: 1064, independent conditional: 366, independent unconditional: 698, dependent: 478, dependent conditional: 0, dependent unconditional: 478, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 146, Positive conditional cache size: 25, Positive unconditional cache size: 121, Negative cache size: 15, Negative conditional cache size: 3, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1024, Maximal queried relation: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 82 PlacesBefore, 82 PlacesAfterwards, 301 TransitionsBefore, 301 TransitionsAfterwards, 2506 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1228, independent: 1149, independent conditional: 1149, independent unconditional: 0, dependent: 79, dependent conditional: 79, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1228, independent: 1149, independent conditional: 850, independent unconditional: 299, dependent: 79, dependent conditional: 79, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1484, independent: 1149, independent conditional: 175, independent unconditional: 974, dependent: 335, dependent conditional: 47, dependent unconditional: 288, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1484, independent: 1149, independent conditional: 175, independent unconditional: 974, dependent: 335, dependent conditional: 47, dependent unconditional: 288, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1484, independent: 1137, independent conditional: 175, independent unconditional: 962, dependent: 332, dependent conditional: 44, dependent unconditional: 288, unknown: 15, unknown conditional: 3, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 158, Positive conditional cache size: 25, Positive unconditional cache size: 133, Negative cache size: 18, Negative conditional cache size: 6, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 963, Maximal queried relation: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 86 PlacesBefore, 86 PlacesAfterwards, 316 TransitionsBefore, 316 TransitionsAfterwards, 2494 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1298, independent: 1212, independent conditional: 1212, independent unconditional: 0, dependent: 86, dependent conditional: 86, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1298, independent: 1212, independent conditional: 1004, independent unconditional: 208, dependent: 86, dependent conditional: 86, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1604, independent: 1212, independent conditional: 534, independent unconditional: 678, dependent: 392, dependent conditional: 52, dependent unconditional: 340, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1604, independent: 1212, independent conditional: 534, independent unconditional: 678, dependent: 392, dependent conditional: 52, dependent unconditional: 340, 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: 2, dependent unconditional: 0, 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: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1604, independent: 1212, independent conditional: 534, independent unconditional: 678, dependent: 390, dependent conditional: 50, dependent unconditional: 340, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 158, Positive conditional cache size: 25, Positive unconditional cache size: 133, Negative cache size: 20, Negative conditional cache size: 8, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 810, Maximal queried relation: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 89 PlacesBefore, 89 PlacesAfterwards, 517 TransitionsBefore, 517 TransitionsAfterwards, 3284 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 210, independent: 105, independent conditional: 105, independent unconditional: 0, dependent: 105, dependent conditional: 105, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 210, independent: 105, independent conditional: 36, independent unconditional: 69, dependent: 105, dependent conditional: 105, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 975, independent: 105, independent conditional: 36, independent unconditional: 69, dependent: 870, dependent conditional: 0, dependent unconditional: 870, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 975, independent: 105, independent conditional: 36, independent unconditional: 69, dependent: 870, dependent conditional: 0, dependent unconditional: 870, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 975, independent: 103, independent conditional: 34, independent unconditional: 69, dependent: 870, dependent conditional: 0, dependent unconditional: 870, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 180, Positive cache size: 160, Positive conditional cache size: 27, Positive unconditional cache size: 133, Negative cache size: 20, Negative conditional cache size: 8, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 870, Maximal queried relation: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 92 PlacesBefore, 91 PlacesAfterwards, 316 TransitionsBefore, 315 TransitionsAfterwards, 2004 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1090, independent: 984, independent conditional: 984, independent unconditional: 0, dependent: 106, dependent conditional: 106, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1090, independent: 984, independent conditional: 896, independent unconditional: 88, dependent: 106, dependent conditional: 106, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2030, independent: 984, independent conditional: 558, independent unconditional: 426, dependent: 1046, dependent conditional: 0, dependent unconditional: 1046, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2030, independent: 984, independent conditional: 558, independent unconditional: 426, dependent: 1046, dependent conditional: 0, dependent unconditional: 1046, 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: 2030, independent: 978, independent conditional: 556, independent unconditional: 422, dependent: 1046, dependent conditional: 0, dependent unconditional: 1046, unknown: 6, unknown conditional: 2, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 186, Positive cache size: 166, Positive conditional cache size: 29, Positive unconditional cache size: 137, Negative cache size: 20, Negative conditional cache size: 8, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1384, Maximal queried relation: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 92 PlacesBefore, 92 PlacesAfterwards, 312 TransitionsBefore, 312 TransitionsAfterwards, 1840 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1930, independent: 1890, independent conditional: 1890, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1930, independent: 1890, independent conditional: 1804, independent unconditional: 86, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2130, independent: 1890, independent conditional: 844, independent unconditional: 1046, dependent: 240, dependent conditional: 0, dependent unconditional: 240, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2130, independent: 1890, independent conditional: 844, independent unconditional: 1046, dependent: 240, dependent conditional: 0, dependent unconditional: 240, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 4, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 2130, independent: 1882, independent conditional: 840, independent unconditional: 1042, dependent: 240, dependent conditional: 0, dependent unconditional: 240, unknown: 8, unknown conditional: 4, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 197, Positive cache size: 177, Positive conditional cache size: 33, Positive unconditional cache size: 144, Negative cache size: 20, Negative conditional cache size: 8, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1200, Maximal queried relation: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 88 PlacesBefore, 88 PlacesAfterwards, 197 TransitionsBefore, 197 TransitionsAfterwards, 766 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 205, Positive cache size: 185, Positive conditional cache size: 37, Positive unconditional cache size: 148, Negative cache size: 20, Negative conditional cache size: 8, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1377; [L849] FCALL, FORK 0 pthread_create(&t1377, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1377, ((void *)0), P0, ((void *)0))=-3, t1377={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t1378; [L851] FCALL, FORK 0 pthread_create(&t1378, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1378, ((void *)0), P1, ((void *)0))=-2, t1377={5:0}, t1378={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L852] 0 pthread_t t1379; [L853] FCALL, FORK 0 pthread_create(&t1379, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1379, ((void *)0), P2, ((void *)0))=-1, t1377={5:0}, t1378={6:0}, t1379={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L854] 0 pthread_t t1380; [L855] FCALL, FORK 0 pthread_create(&t1380, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1380, ((void *)0), P3, ((void *)0))=0, t1377={5:0}, t1378={6:0}, t1379={7:0}, t1380={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L820] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L823] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L826] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L827] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L828] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L829] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L830] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L806] 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) [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 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 [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 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) [L862] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L863] 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 [L864] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L865] 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 [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 x$flush_delayed = weak$$choice2 [L871] 0 x$mem_tmp = x [L872] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L873] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L874] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L875] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L876] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L878] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L880] 0 x = x$flush_delayed ? x$mem_tmp : x [L881] 0 x$flush_delayed = (_Bool)0 [L883] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 165 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 56.4s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 33.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 555 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 555 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 155 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1665 IncrementalHoareTripleChecker+Invalid, 1820 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 155 mSolverCounterUnsat, 10 mSDtfsCounter, 1665 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12030occurred in iteration=11, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 246 NumberOfCodeBlocks, 246 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 207 ConstructedInterpolants, 0 QuantifiedInterpolants, 1592 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 03:09:47,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...