/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-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix053_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 21:39:25,840 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 21:39:25,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 21:39:25,877 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 21:39:25,879 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 21:39:25,882 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 21:39:25,884 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 21:39:25,888 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 21:39:25,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 21:39:25,895 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 21:39:25,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 21:39:25,897 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 21:39:25,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 21:39:25,897 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 21:39:25,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 21:39:25,899 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 21:39:25,899 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 21:39:25,900 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 21:39:25,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 21:39:25,902 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 21:39:25,902 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 21:39:25,907 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 21:39:25,908 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 21:39:25,910 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 21:39:25,917 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 21:39:25,917 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 21:39:25,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 21:39:25,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 21:39:25,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 21:39:25,920 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 21:39:25,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 21:39:25,922 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 21:39:25,923 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 21:39:25,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 21:39:25,924 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 21:39:25,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 21:39:25,924 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 21:39:25,924 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 21:39:25,925 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 21:39:25,925 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 21:39:25,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 21:39:25,927 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-SemanticLbe.epf [2022-12-12 21:39:25,956 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 21:39:25,956 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 21:39:25,957 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 21:39:25,957 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 21:39:25,958 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 21:39:25,958 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 21:39:25,958 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 21:39:25,959 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 21:39:25,959 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 21:39:25,959 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 21:39:25,959 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 21:39:25,960 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 21:39:25,960 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 21:39:25,960 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 21:39:25,960 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 21:39:25,960 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 21:39:25,960 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 21:39:25,960 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 21:39:25,960 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 21:39:25,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 21:39:25,961 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 21:39:25,961 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 21:39:25,961 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 21:39:25,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:39:25,961 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 21:39:25,961 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 21:39:25,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 21:39:25,961 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 21:39:25,961 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 21:39:25,962 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 21:39:25,962 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-12 21:39:26,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 21:39:26,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 21:39:26,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 21:39:26,258 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 21:39:26,258 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 21:39:26,259 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053_tso.oepc.i [2022-12-12 21:39:27,308 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 21:39:27,599 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 21:39:27,600 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_tso.oepc.i [2022-12-12 21:39:27,610 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99952a19b/c160559a3f4940289d13ac6fffb4dd7d/FLAG473b53f06 [2022-12-12 21:39:27,625 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99952a19b/c160559a3f4940289d13ac6fffb4dd7d [2022-12-12 21:39:27,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 21:39:27,630 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 21:39:27,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 21:39:27,631 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 21:39:27,633 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 21:39:27,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:39:27" (1/1) ... [2022-12-12 21:39:27,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@300a40bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:27, skipping insertion in model container [2022-12-12 21:39:27,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:39:27" (1/1) ... [2022-12-12 21:39:27,639 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 21:39:27,691 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 21:39:27,816 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/mix053_tso.oepc.i[949,962] [2022-12-12 21:39:27,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:27,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:27,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:27,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:27,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:27,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:27,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:27,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:27,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:27,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:27,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:27,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:27,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:27,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:27,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:27,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:27,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:27,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:27,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:27,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:27,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:27,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:27,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:27,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:27,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:27,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:27,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:27,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:27,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:27,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:27,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:27,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:27,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:27,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:27,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:27,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:27,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:27,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:27,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:39:27,995 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 21:39:28,014 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/mix053_tso.oepc.i[949,962] [2022-12-12 21:39:28,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:28,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:28,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:28,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:28,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:28,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:28,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:28,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:28,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:28,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:28,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:28,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:28,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:28,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:28,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:28,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:28,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:28,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:28,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:28,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:28,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:28,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:28,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:28,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:28,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:28,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:28,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:28,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:28,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:28,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:28,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:28,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:28,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:28,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:28,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:28,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:28,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:39:28,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:39:28,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:39:28,111 INFO L208 MainTranslator]: Completed translation [2022-12-12 21:39:28,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:28 WrapperNode [2022-12-12 21:39:28,112 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 21:39:28,113 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 21:39:28,113 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 21:39:28,113 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 21:39:28,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:28" (1/1) ... [2022-12-12 21:39:28,144 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:28" (1/1) ... [2022-12-12 21:39:28,169 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 158 [2022-12-12 21:39:28,170 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 21:39:28,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 21:39:28,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 21:39:28,171 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 21:39:28,177 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:28" (1/1) ... [2022-12-12 21:39:28,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:28" (1/1) ... [2022-12-12 21:39:28,190 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:28" (1/1) ... [2022-12-12 21:39:28,190 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:28" (1/1) ... [2022-12-12 21:39:28,197 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:28" (1/1) ... [2022-12-12 21:39:28,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:28" (1/1) ... [2022-12-12 21:39:28,206 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:28" (1/1) ... [2022-12-12 21:39:28,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:28" (1/1) ... [2022-12-12 21:39:28,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 21:39:28,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 21:39:28,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 21:39:28,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 21:39:28,210 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:28" (1/1) ... [2022-12-12 21:39:28,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:39:28,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 21:39:28,236 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-12 21:39:28,264 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-12 21:39:28,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 21:39:28,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 21:39:28,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 21:39:28,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 21:39:28,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 21:39:28,277 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 21:39:28,277 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 21:39:28,277 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 21:39:28,277 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 21:39:28,277 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 21:39:28,277 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 21:39:28,278 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-12 21:39:28,278 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-12 21:39:28,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 21:39:28,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 21:39:28,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 21:39:28,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 21:39:28,279 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 21:39:28,389 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 21:39:28,391 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 21:39:28,636 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 21:39:28,731 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 21:39:28,733 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 21:39:28,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:39:28 BoogieIcfgContainer [2022-12-12 21:39:28,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 21:39:28,736 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 21:39:28,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 21:39:28,738 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 21:39:28,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 09:39:27" (1/3) ... [2022-12-12 21:39:28,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f056745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:39:28, skipping insertion in model container [2022-12-12 21:39:28,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:39:28" (2/3) ... [2022-12-12 21:39:28,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f056745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:39:28, skipping insertion in model container [2022-12-12 21:39:28,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:39:28" (3/3) ... [2022-12-12 21:39:28,740 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053_tso.oepc.i [2022-12-12 21:39:28,754 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 21:39:28,755 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 21:39:28,755 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 21:39:28,806 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 21:39:28,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 274 flow [2022-12-12 21:39:28,891 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2022-12-12 21:39:28,891 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:39:28,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-12 21:39:28,896 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 127 transitions, 274 flow [2022-12-12 21:39:28,901 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 123 transitions, 258 flow [2022-12-12 21:39:28,902 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 21:39:28,922 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 123 transitions, 258 flow [2022-12-12 21:39:28,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 123 transitions, 258 flow [2022-12-12 21:39:28,960 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2022-12-12 21:39:28,961 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:39:28,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-12 21:39:28,967 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 123 transitions, 258 flow [2022-12-12 21:39:28,967 INFO L226 LiptonReduction]: Number of co-enabled transitions 2882 [2022-12-12 21:39:34,433 INFO L241 LiptonReduction]: Total number of compositions: 96 [2022-12-12 21:39:34,444 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 21:39:34,448 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2a7bdad2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 21:39:34,448 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-12 21:39:34,452 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-12 21:39:34,452 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:39:34,452 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:39:34,452 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:39:34,453 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:39:34,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:39:34,456 INFO L85 PathProgramCache]: Analyzing trace with hash 434841595, now seen corresponding path program 1 times [2022-12-12 21:39:34,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:39:34,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871067536] [2022-12-12 21:39:34,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:39:34,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:39:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:39:34,764 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-12 21:39:34,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:39:34,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871067536] [2022-12-12 21:39:34,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871067536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:39:34,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:39:34,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:39:34,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683400907] [2022-12-12 21:39:34,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:39:34,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:39:34,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:39:34,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:39:34,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:39:34,803 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 72 [2022-12-12 21:39:34,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 72 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-12 21:39:34,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:39:34,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 72 [2022-12-12 21:39:34,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:39:39,863 INFO L130 PetriNetUnfolder]: 43504/62384 cut-off events. [2022-12-12 21:39:39,863 INFO L131 PetriNetUnfolder]: For 104/104 co-relation queries the response was YES. [2022-12-12 21:39:39,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120293 conditions, 62384 events. 43504/62384 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 3303. Compared 464046 event pairs, 11360 based on Foata normal form. 0/38934 useless extension candidates. Maximal degree in co-relation 120281. Up to 48285 conditions per place. [2022-12-12 21:39:40,068 INFO L137 encePairwiseOnDemand]: 66/72 looper letters, 40 selfloop transitions, 2 changer transitions 55/111 dead transitions. [2022-12-12 21:39:40,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 111 transitions, 429 flow [2022-12-12 21:39:40,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:39:40,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:39:40,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2022-12-12 21:39:40,078 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2022-12-12 21:39:40,081 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, 0 predicate places. [2022-12-12 21:39:40,081 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 111 transitions, 429 flow [2022-12-12 21:39:40,150 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 56 transitions, 211 flow [2022-12-12 21:39:40,151 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 56 transitions, 211 flow [2022-12-12 21:39:40,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-12 21:39:40,151 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:39:40,151 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:39:40,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 21:39:40,152 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:39:40,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:39:40,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1719553432, now seen corresponding path program 1 times [2022-12-12 21:39:40,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:39:40,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497447258] [2022-12-12 21:39:40,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:39:40,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:39:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:39:40,829 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-12 21:39:40,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:39:40,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497447258] [2022-12-12 21:39:40,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497447258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:39:40,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:39:40,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:39:40,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804478310] [2022-12-12 21:39:40,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:39:40,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:39:40,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:39:40,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:39:40,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:39:40,833 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2022-12-12 21:39:40,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 56 transitions, 211 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-12 21:39:40,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:39:40,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2022-12-12 21:39:40,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:39:42,860 INFO L130 PetriNetUnfolder]: 21055/30255 cut-off events. [2022-12-12 21:39:42,861 INFO L131 PetriNetUnfolder]: For 4433/4433 co-relation queries the response was YES. [2022-12-12 21:39:42,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83314 conditions, 30255 events. 21055/30255 cut-off events. For 4433/4433 co-relation queries the response was YES. Maximal size of possible extension queue 1111. Compared 194380 event pairs, 859 based on Foata normal form. 720/25517 useless extension candidates. Maximal degree in co-relation 83299. Up to 20615 conditions per place. [2022-12-12 21:39:43,016 INFO L137 encePairwiseOnDemand]: 61/72 looper letters, 97 selfloop transitions, 17 changer transitions 0/124 dead transitions. [2022-12-12 21:39:43,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 124 transitions, 720 flow [2022-12-12 21:39:43,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:39:43,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:39:43,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2022-12-12 21:39:43,017 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-12 21:39:43,018 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -25 predicate places. [2022-12-12 21:39:43,018 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 124 transitions, 720 flow [2022-12-12 21:39:43,127 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 124 transitions, 720 flow [2022-12-12 21:39:43,127 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 124 transitions, 720 flow [2022-12-12 21:39:43,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-12 21:39:43,128 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:39:43,128 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:39:43,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 21:39:43,128 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:39:43,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:39:43,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1766547358, now seen corresponding path program 1 times [2022-12-12 21:39:43,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:39:43,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362796180] [2022-12-12 21:39:43,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:39:43,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:39:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:39:43,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:39:43,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:39:43,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362796180] [2022-12-12 21:39:43,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362796180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:39:43,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:39:43,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:39:43,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398490644] [2022-12-12 21:39:43,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:39:43,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:39:43,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:39:43,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:39:43,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:39:43,416 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 72 [2022-12-12 21:39:43,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 124 transitions, 720 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:39:43,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:39:43,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 72 [2022-12-12 21:39:43,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:39:45,550 INFO L130 PetriNetUnfolder]: 20838/30021 cut-off events. [2022-12-12 21:39:45,550 INFO L131 PetriNetUnfolder]: For 12004/12004 co-relation queries the response was YES. [2022-12-12 21:39:45,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107512 conditions, 30021 events. 20838/30021 cut-off events. For 12004/12004 co-relation queries the response was YES. Maximal size of possible extension queue 1108. Compared 191676 event pairs, 1287 based on Foata normal form. 48/24640 useless extension candidates. Maximal degree in co-relation 107494. Up to 24141 conditions per place. [2022-12-12 21:39:45,725 INFO L137 encePairwiseOnDemand]: 66/72 looper letters, 144 selfloop transitions, 17 changer transitions 0/179 dead transitions. [2022-12-12 21:39:45,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 179 transitions, 1376 flow [2022-12-12 21:39:45,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:39:45,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:39:45,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2022-12-12 21:39:45,726 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3819444444444444 [2022-12-12 21:39:45,727 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -22 predicate places. [2022-12-12 21:39:45,727 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 179 transitions, 1376 flow [2022-12-12 21:39:46,048 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 179 transitions, 1376 flow [2022-12-12 21:39:46,048 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 179 transitions, 1376 flow [2022-12-12 21:39:46,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:39:46,049 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:39:46,049 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:39:46,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 21:39:46,049 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:39:46,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:39:46,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1067062702, now seen corresponding path program 1 times [2022-12-12 21:39:46,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:39:46,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577895900] [2022-12-12 21:39:46,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:39:46,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:39:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:39:46,344 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-12 21:39:46,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:39:46,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577895900] [2022-12-12 21:39:46,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577895900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:39:46,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:39:46,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:39:46,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763664022] [2022-12-12 21:39:46,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:39:46,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:39:46,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:39:46,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:39:46,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:39:46,346 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 72 [2022-12-12 21:39:46,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 179 transitions, 1376 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-12 21:39:46,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:39:46,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 72 [2022-12-12 21:39:46,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:39:48,724 INFO L130 PetriNetUnfolder]: 20270/29062 cut-off events. [2022-12-12 21:39:48,724 INFO L131 PetriNetUnfolder]: For 23501/23501 co-relation queries the response was YES. [2022-12-12 21:39:48,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128614 conditions, 29062 events. 20270/29062 cut-off events. For 23501/23501 co-relation queries the response was YES. Maximal size of possible extension queue 1057. Compared 182107 event pairs, 1617 based on Foata normal form. 120/23881 useless extension candidates. Maximal degree in co-relation 128593. Up to 23437 conditions per place. [2022-12-12 21:39:48,892 INFO L137 encePairwiseOnDemand]: 68/72 looper letters, 147 selfloop transitions, 13 changer transitions 0/178 dead transitions. [2022-12-12 21:39:48,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 178 transitions, 1688 flow [2022-12-12 21:39:48,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:39:48,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:39:48,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-12-12 21:39:48,895 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2022-12-12 21:39:48,896 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -19 predicate places. [2022-12-12 21:39:48,896 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 178 transitions, 1688 flow [2022-12-12 21:39:49,018 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 178 transitions, 1688 flow [2022-12-12 21:39:49,019 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 178 transitions, 1688 flow [2022-12-12 21:39:49,019 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-12 21:39:49,019 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:39:49,019 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:39:49,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 21:39:49,019 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:39:49,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:39:49,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1067006964, now seen corresponding path program 1 times [2022-12-12 21:39:49,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:39:49,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169174225] [2022-12-12 21:39:49,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:39:49,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:39:49,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:39:49,419 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-12 21:39:49,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:39:49,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169174225] [2022-12-12 21:39:49,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169174225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:39:49,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:39:49,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:39:49,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206968212] [2022-12-12 21:39:49,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:39:49,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:39:49,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:39:49,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:39:49,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:39:49,422 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 72 [2022-12-12 21:39:49,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 178 transitions, 1688 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-12 21:39:49,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:39:49,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 72 [2022-12-12 21:39:49,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:39:51,735 INFO L130 PetriNetUnfolder]: 20930/30022 cut-off events. [2022-12-12 21:39:51,736 INFO L131 PetriNetUnfolder]: For 43982/43982 co-relation queries the response was YES. [2022-12-12 21:39:51,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157641 conditions, 30022 events. 20930/30022 cut-off events. For 43982/43982 co-relation queries the response was YES. Maximal size of possible extension queue 1099. Compared 188865 event pairs, 1243 based on Foata normal form. 96/24667 useless extension candidates. Maximal degree in co-relation 157617. Up to 24200 conditions per place. [2022-12-12 21:39:52,129 INFO L137 encePairwiseOnDemand]: 66/72 looper letters, 179 selfloop transitions, 19 changer transitions 0/216 dead transitions. [2022-12-12 21:39:52,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 216 transitions, 2469 flow [2022-12-12 21:39:52,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:39:52,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:39:52,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-12-12 21:39:52,131 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2022-12-12 21:39:52,131 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -16 predicate places. [2022-12-12 21:39:52,132 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 216 transitions, 2469 flow [2022-12-12 21:39:52,268 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 216 transitions, 2469 flow [2022-12-12 21:39:52,269 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 216 transitions, 2469 flow [2022-12-12 21:39:52,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-12 21:39:52,269 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:39:52,269 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:39:52,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 21:39:52,269 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:39:52,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:39:52,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1280792752, now seen corresponding path program 1 times [2022-12-12 21:39:52,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:39:52,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350477640] [2022-12-12 21:39:52,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:39:52,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:39:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:39:52,597 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-12 21:39:52,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:39:52,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350477640] [2022-12-12 21:39:52,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350477640] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:39:52,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:39:52,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:39:52,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124893645] [2022-12-12 21:39:52,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:39:52,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 21:39:52,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:39:52,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 21:39:52,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-12 21:39:52,599 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 72 [2022-12-12 21:39:52,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 216 transitions, 2469 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-12 21:39:52,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:39:52,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 72 [2022-12-12 21:39:52,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:39:55,510 INFO L130 PetriNetUnfolder]: 24186/34771 cut-off events. [2022-12-12 21:39:55,510 INFO L131 PetriNetUnfolder]: For 72614/72614 co-relation queries the response was YES. [2022-12-12 21:39:55,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209797 conditions, 34771 events. 24186/34771 cut-off events. For 72614/72614 co-relation queries the response was YES. Maximal size of possible extension queue 1359. Compared 224338 event pairs, 1578 based on Foata normal form. 240/28742 useless extension candidates. Maximal degree in co-relation 209770. Up to 27787 conditions per place. [2022-12-12 21:39:55,904 INFO L137 encePairwiseOnDemand]: 65/72 looper letters, 225 selfloop transitions, 31 changer transitions 0/274 dead transitions. [2022-12-12 21:39:55,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 274 transitions, 3695 flow [2022-12-12 21:39:55,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:39:55,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:39:55,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2022-12-12 21:39:55,905 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40555555555555556 [2022-12-12 21:39:55,908 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -12 predicate places. [2022-12-12 21:39:55,908 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 274 transitions, 3695 flow [2022-12-12 21:39:56,093 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 274 transitions, 3695 flow [2022-12-12 21:39:56,095 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 274 transitions, 3695 flow [2022-12-12 21:39:56,103 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-12 21:39:56,103 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:39:56,104 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:39:56,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 21:39:56,104 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:39:56,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:39:56,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1049866027, now seen corresponding path program 1 times [2022-12-12 21:39:56,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:39:56,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601140248] [2022-12-12 21:39:56,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:39:56,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:39:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:39:57,014 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-12 21:39:57,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:39:57,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601140248] [2022-12-12 21:39:57,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601140248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:39:57,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:39:57,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 21:39:57,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368125523] [2022-12-12 21:39:57,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:39:57,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 21:39:57,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:39:57,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 21:39:57,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-12 21:39:57,016 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 72 [2022-12-12 21:39:57,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 274 transitions, 3695 flow. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 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-12 21:39:57,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:39:57,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 72 [2022-12-12 21:39:57,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:40:00,637 INFO L130 PetriNetUnfolder]: 27962/40187 cut-off events. [2022-12-12 21:40:00,637 INFO L131 PetriNetUnfolder]: For 117101/117101 co-relation queries the response was YES. [2022-12-12 21:40:00,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273360 conditions, 40187 events. 27962/40187 cut-off events. For 117101/117101 co-relation queries the response was YES. Maximal size of possible extension queue 1618. Compared 265652 event pairs, 1933 based on Foata normal form. 180/33266 useless extension candidates. Maximal degree in co-relation 273330. Up to 31851 conditions per place. [2022-12-12 21:40:00,979 INFO L137 encePairwiseOnDemand]: 65/72 looper letters, 281 selfloop transitions, 27 changer transitions 0/326 dead transitions. [2022-12-12 21:40:00,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 326 transitions, 5051 flow [2022-12-12 21:40:00,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:40:00,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:40:00,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2022-12-12 21:40:00,980 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-12 21:40:00,980 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -8 predicate places. [2022-12-12 21:40:00,981 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 326 transitions, 5051 flow [2022-12-12 21:40:01,205 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 326 transitions, 5051 flow [2022-12-12 21:40:01,205 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 326 transitions, 5051 flow [2022-12-12 21:40:01,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 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-12 21:40:01,205 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:40:01,206 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:40:01,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 21:40:01,206 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:40:01,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:40:01,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1103374507, now seen corresponding path program 2 times [2022-12-12 21:40:01,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:40:01,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301794887] [2022-12-12 21:40:01,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:40:01,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:40:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:40:01,756 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-12 21:40:01,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:40:01,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301794887] [2022-12-12 21:40:01,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301794887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:40:01,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:40:01,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 21:40:01,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41420726] [2022-12-12 21:40:01,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:40:01,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 21:40:01,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:40:01,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 21:40:01,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-12 21:40:01,759 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 72 [2022-12-12 21:40:01,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 326 transitions, 5051 flow. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 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-12 21:40:01,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:40:01,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 72 [2022-12-12 21:40:01,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:40:07,071 INFO L130 PetriNetUnfolder]: 36192/52599 cut-off events. [2022-12-12 21:40:07,071 INFO L131 PetriNetUnfolder]: For 193150/193150 co-relation queries the response was YES. [2022-12-12 21:40:07,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402663 conditions, 52599 events. 36192/52599 cut-off events. For 193150/193150 co-relation queries the response was YES. Maximal size of possible extension queue 2107. Compared 369880 event pairs, 2113 based on Foata normal form. 570/42964 useless extension candidates. Maximal degree in co-relation 402630. Up to 42217 conditions per place. [2022-12-12 21:40:07,622 INFO L137 encePairwiseOnDemand]: 65/72 looper letters, 334 selfloop transitions, 59 changer transitions 0/411 dead transitions. [2022-12-12 21:40:07,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 411 transitions, 7215 flow [2022-12-12 21:40:07,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 21:40:07,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 21:40:07,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 192 transitions. [2022-12-12 21:40:07,623 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2022-12-12 21:40:07,624 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -2 predicate places. [2022-12-12 21:40:07,624 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 411 transitions, 7215 flow [2022-12-12 21:40:07,953 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 411 transitions, 7215 flow [2022-12-12 21:40:07,954 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 411 transitions, 7215 flow [2022-12-12 21:40:07,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 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-12 21:40:07,954 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:40:07,954 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:40:07,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 21:40:07,954 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:40:07,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:40:07,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1106063633, now seen corresponding path program 1 times [2022-12-12 21:40:07,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:40:07,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972470368] [2022-12-12 21:40:07,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:40:07,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:40:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:40:08,118 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-12 21:40:08,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:40:08,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972470368] [2022-12-12 21:40:08,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972470368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:40:08,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:40:08,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:40:08,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532877570] [2022-12-12 21:40:08,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:40:08,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:40:08,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:40:08,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:40:08,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:40:08,123 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2022-12-12 21:40:08,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 411 transitions, 7215 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:40:08,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:40:08,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2022-12-12 21:40:08,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:40:17,388 INFO L130 PetriNetUnfolder]: 66811/91693 cut-off events. [2022-12-12 21:40:17,389 INFO L131 PetriNetUnfolder]: For 579850/584487 co-relation queries the response was YES. [2022-12-12 21:40:17,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737779 conditions, 91693 events. 66811/91693 cut-off events. For 579850/584487 co-relation queries the response was YES. Maximal size of possible extension queue 3604. Compared 608975 event pairs, 12121 based on Foata normal form. 1027/77080 useless extension candidates. Maximal degree in co-relation 737743. Up to 80432 conditions per place. [2022-12-12 21:40:18,201 INFO L137 encePairwiseOnDemand]: 58/72 looper letters, 546 selfloop transitions, 137 changer transitions 0/705 dead transitions. [2022-12-12 21:40:18,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 705 transitions, 13899 flow [2022-12-12 21:40:18,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:40:18,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:40:18,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2022-12-12 21:40:18,202 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41203703703703703 [2022-12-12 21:40:18,203 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, 0 predicate places. [2022-12-12 21:40:18,203 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 705 transitions, 13899 flow [2022-12-12 21:40:18,767 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 705 transitions, 13899 flow [2022-12-12 21:40:18,767 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 705 transitions, 13899 flow [2022-12-12 21:40:18,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:40:18,767 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:40:18,767 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:40:18,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 21:40:18,767 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:40:18,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:40:18,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1061568869, now seen corresponding path program 1 times [2022-12-12 21:40:18,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:40:18,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794715701] [2022-12-12 21:40:18,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:40:18,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:40:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:40:18,863 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-12 21:40:18,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:40:18,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794715701] [2022-12-12 21:40:18,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794715701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:40:18,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:40:18,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:40:18,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425534919] [2022-12-12 21:40:18,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:40:18,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:40:18,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:40:18,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:40:18,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:40:18,865 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2022-12-12 21:40:18,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 705 transitions, 13899 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:40:18,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:40:18,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2022-12-12 21:40:18,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:40:26,923 INFO L130 PetriNetUnfolder]: 43639/62795 cut-off events. [2022-12-12 21:40:26,924 INFO L131 PetriNetUnfolder]: For 451216/455905 co-relation queries the response was YES. [2022-12-12 21:40:27,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 563313 conditions, 62795 events. 43639/62795 cut-off events. For 451216/455905 co-relation queries the response was YES. Maximal size of possible extension queue 2676. Compared 437765 event pairs, 5476 based on Foata normal form. 3300/55799 useless extension candidates. Maximal degree in co-relation 563274. Up to 54720 conditions per place. [2022-12-12 21:40:27,528 INFO L137 encePairwiseOnDemand]: 58/72 looper letters, 590 selfloop transitions, 265 changer transitions 4/881 dead transitions. [2022-12-12 21:40:27,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 881 transitions, 19115 flow [2022-12-12 21:40:27,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:40:27,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:40:27,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-12-12 21:40:27,530 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2022-12-12 21:40:27,530 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, 3 predicate places. [2022-12-12 21:40:27,530 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 881 transitions, 19115 flow [2022-12-12 21:40:27,898 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 877 transitions, 19027 flow [2022-12-12 21:40:27,898 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 877 transitions, 19027 flow [2022-12-12 21:40:27,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:40:27,898 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:40:27,898 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-12 21:40:27,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 21:40:27,899 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:40:27,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:40:27,899 INFO L85 PathProgramCache]: Analyzing trace with hash -888846776, now seen corresponding path program 1 times [2022-12-12 21:40:27,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:40:27,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250701220] [2022-12-12 21:40:27,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:40:27,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:40:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:40:27,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:40:27,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:40:27,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250701220] [2022-12-12 21:40:27,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250701220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:40:27,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:40:27,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:40:27,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598969464] [2022-12-12 21:40:27,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:40:27,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:40:27,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:40:27,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:40:27,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:40:27,990 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 72 [2022-12-12 21:40:27,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 877 transitions, 19027 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 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-12 21:40:27,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:40:27,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 72 [2022-12-12 21:40:27,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:40:41,106 INFO L130 PetriNetUnfolder]: 59941/86304 cut-off events. [2022-12-12 21:40:41,106 INFO L131 PetriNetUnfolder]: For 692485/699497 co-relation queries the response was YES. [2022-12-12 21:40:41,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 840447 conditions, 86304 events. 59941/86304 cut-off events. For 692485/699497 co-relation queries the response was YES. Maximal size of possible extension queue 3783. Compared 628291 event pairs, 8241 based on Foata normal form. 2429/73999 useless extension candidates. Maximal degree in co-relation 840405. Up to 75809 conditions per place. [2022-12-12 21:40:41,723 INFO L137 encePairwiseOnDemand]: 69/72 looper letters, 657 selfloop transitions, 24 changer transitions 513/1223 dead transitions. [2022-12-12 21:40:41,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 1223 transitions, 29102 flow [2022-12-12 21:40:41,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:40:41,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:40:41,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2022-12-12 21:40:41,725 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2022-12-12 21:40:41,725 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, 5 predicate places. [2022-12-12 21:40:41,725 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 1223 transitions, 29102 flow [2022-12-12 21:40:42,099 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 710 transitions, 16676 flow [2022-12-12 21:40:42,100 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 710 transitions, 16676 flow [2022-12-12 21:40:42,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 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-12 21:40:42,100 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:40:42,100 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:40:42,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 21:40:42,100 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:40:42,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:40:42,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1285193659, now seen corresponding path program 1 times [2022-12-12 21:40:42,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:40:42,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084578004] [2022-12-12 21:40:42,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:40:42,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:40:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:40:42,205 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-12 21:40:42,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:40:42,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084578004] [2022-12-12 21:40:42,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084578004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:40:42,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:40:42,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:40:42,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27640393] [2022-12-12 21:40:42,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:40:42,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:40:42,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:40:42,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:40:42,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:40:42,207 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2022-12-12 21:40:42,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 710 transitions, 16676 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 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-12 21:40:42,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:40:42,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2022-12-12 21:40:42,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:40:47,567 INFO L130 PetriNetUnfolder]: 21785/35726 cut-off events. [2022-12-12 21:40:47,568 INFO L131 PetriNetUnfolder]: For 360788/365795 co-relation queries the response was YES. [2022-12-12 21:40:47,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370769 conditions, 35726 events. 21785/35726 cut-off events. For 360788/365795 co-relation queries the response was YES. Maximal size of possible extension queue 1628. Compared 291954 event pairs, 1546 based on Foata normal form. 3785/33339 useless extension candidates. Maximal degree in co-relation 370724. Up to 30516 conditions per place. [2022-12-12 21:40:47,853 INFO L137 encePairwiseOnDemand]: 58/72 looper letters, 410 selfloop transitions, 267 changer transitions 70/765 dead transitions. [2022-12-12 21:40:47,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 765 transitions, 19428 flow [2022-12-12 21:40:47,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:40:47,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:40:47,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions. [2022-12-12 21:40:47,855 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2022-12-12 21:40:47,855 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, 9 predicate places. [2022-12-12 21:40:47,855 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 765 transitions, 19428 flow [2022-12-12 21:40:48,018 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 695 transitions, 17612 flow [2022-12-12 21:40:48,018 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 695 transitions, 17612 flow [2022-12-12 21:40:48,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 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-12 21:40:48,019 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:40:48,019 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-12 21:40:48,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 21:40:48,019 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:40:48,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:40:48,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1360646873, now seen corresponding path program 1 times [2022-12-12 21:40:48,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:40:48,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731376833] [2022-12-12 21:40:48,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:40:48,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:40:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:40:48,181 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-12 21:40:48,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:40:48,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731376833] [2022-12-12 21:40:48,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731376833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:40:48,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:40:48,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 21:40:48,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298695575] [2022-12-12 21:40:48,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:40:48,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 21:40:48,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:40:48,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 21:40:48,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-12 21:40:48,183 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2022-12-12 21:40:48,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 695 transitions, 17612 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-12 21:40:48,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:40:48,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2022-12-12 21:40:48,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:40:51,976 INFO L130 PetriNetUnfolder]: 14984/24209 cut-off events. [2022-12-12 21:40:51,976 INFO L131 PetriNetUnfolder]: For 306519/310409 co-relation queries the response was YES. [2022-12-12 21:40:52,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265209 conditions, 24209 events. 14984/24209 cut-off events. For 306519/310409 co-relation queries the response was YES. Maximal size of possible extension queue 1215. Compared 184347 event pairs, 670 based on Foata normal form. 2620/22562 useless extension candidates. Maximal degree in co-relation 265161. Up to 20143 conditions per place. [2022-12-12 21:40:52,140 INFO L137 encePairwiseOnDemand]: 58/72 looper letters, 316 selfloop transitions, 249 changer transitions 107/689 dead transitions. [2022-12-12 21:40:52,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 689 transitions, 18798 flow [2022-12-12 21:40:52,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:40:52,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:40:52,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 166 transitions. [2022-12-12 21:40:52,141 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38425925925925924 [2022-12-12 21:40:52,142 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, 14 predicate places. [2022-12-12 21:40:52,142 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 689 transitions, 18798 flow [2022-12-12 21:40:52,245 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 582 transitions, 15818 flow [2022-12-12 21:40:52,246 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 582 transitions, 15818 flow [2022-12-12 21:40:52,246 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-12 21:40:52,246 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:40:52,246 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, 1] [2022-12-12 21:40:52,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 21:40:52,246 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:40:52,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:40:52,246 INFO L85 PathProgramCache]: Analyzing trace with hash 218442059, now seen corresponding path program 1 times [2022-12-12 21:40:52,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:40:52,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452095771] [2022-12-12 21:40:52,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:40:52,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:40:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:40:52,775 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-12 21:40:52,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:40:52,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452095771] [2022-12-12 21:40:52,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452095771] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:40:52,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:40:52,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 21:40:52,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273342763] [2022-12-12 21:40:52,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:40:52,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 21:40:52,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:40:52,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 21:40:52,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-12 21:40:52,777 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2022-12-12 21:40:52,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 582 transitions, 15818 flow. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 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-12 21:40:52,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:40:52,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2022-12-12 21:40:52,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:40:55,455 INFO L130 PetriNetUnfolder]: 12633/19112 cut-off events. [2022-12-12 21:40:55,456 INFO L131 PetriNetUnfolder]: For 254227/256320 co-relation queries the response was YES. [2022-12-12 21:40:55,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233161 conditions, 19112 events. 12633/19112 cut-off events. For 254227/256320 co-relation queries the response was YES. Maximal size of possible extension queue 975. Compared 124908 event pairs, 552 based on Foata normal form. 294/15516 useless extension candidates. Maximal degree in co-relation 233110. Up to 16775 conditions per place. [2022-12-12 21:40:55,580 INFO L137 encePairwiseOnDemand]: 61/72 looper letters, 385 selfloop transitions, 34 changer transitions 615/1054 dead transitions. [2022-12-12 21:40:55,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 1054 transitions, 30750 flow [2022-12-12 21:40:55,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 21:40:55,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 21:40:55,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2022-12-12 21:40:55,581 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3551587301587302 [2022-12-12 21:40:55,582 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, 20 predicate places. [2022-12-12 21:40:55,582 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 1054 transitions, 30750 flow [2022-12-12 21:40:55,648 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 439 transitions, 12545 flow [2022-12-12 21:40:55,649 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 439 transitions, 12545 flow [2022-12-12 21:40:55,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 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-12 21:40:55,649 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:40:55,649 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, 1] [2022-12-12 21:40:55,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-12 21:40:55,649 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:40:55,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:40:55,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1316914471, now seen corresponding path program 1 times [2022-12-12 21:40:55,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:40:55,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261041871] [2022-12-12 21:40:55,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:40:55,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:40:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:40:55,769 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-12 21:40:55,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:40:55,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261041871] [2022-12-12 21:40:55,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261041871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:40:55,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:40:55,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:40:55,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370933463] [2022-12-12 21:40:55,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:40:55,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:40:55,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:40:55,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:40:55,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:40:55,771 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 72 [2022-12-12 21:40:55,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 439 transitions, 12545 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-12 21:40:55,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:40:55,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 72 [2022-12-12 21:40:55,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:40:57,568 INFO L130 PetriNetUnfolder]: 8296/13377 cut-off events. [2022-12-12 21:40:57,568 INFO L131 PetriNetUnfolder]: For 124935/126359 co-relation queries the response was YES. [2022-12-12 21:40:57,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171680 conditions, 13377 events. 8296/13377 cut-off events. For 124935/126359 co-relation queries the response was YES. Maximal size of possible extension queue 810. Compared 93576 event pairs, 5 based on Foata normal form. 161/10449 useless extension candidates. Maximal degree in co-relation 171626. Up to 12211 conditions per place. [2022-12-12 21:40:57,635 INFO L137 encePairwiseOnDemand]: 69/72 looper letters, 186 selfloop transitions, 3 changer transitions 600/812 dead transitions. [2022-12-12 21:40:57,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 812 transitions, 25209 flow [2022-12-12 21:40:57,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:40:57,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:40:57,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-12-12 21:40:57,637 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2022-12-12 21:40:57,637 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, 19 predicate places. [2022-12-12 21:40:57,637 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 812 transitions, 25209 flow [2022-12-12 21:40:57,670 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 212 transitions, 6261 flow [2022-12-12 21:40:57,671 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 212 transitions, 6261 flow [2022-12-12 21:40:57,671 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-12 21:40:57,671 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:40:57,671 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, 1] [2022-12-12 21:40:57,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-12 21:40:57,671 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:40:57,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:40:57,672 INFO L85 PathProgramCache]: Analyzing trace with hash 754495392, now seen corresponding path program 1 times [2022-12-12 21:40:57,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:40:57,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256822536] [2022-12-12 21:40:57,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:40:57,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:40:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:40:58,382 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-12 21:40:58,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:40:58,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256822536] [2022-12-12 21:40:58,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256822536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:40:58,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:40:58,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 21:40:58,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942895969] [2022-12-12 21:40:58,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:40:58,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 21:40:58,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:40:58,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 21:40:58,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-12 21:40:58,386 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 72 [2022-12-12 21:40:58,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 212 transitions, 6261 flow. Second operand has 8 states, 8 states have (on average 16.375) internal successors, (131), 8 states have internal predecessors, (131), 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-12 21:40:58,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:40:58,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 72 [2022-12-12 21:40:58,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:40:59,147 INFO L130 PetriNetUnfolder]: 3470/5864 cut-off events. [2022-12-12 21:40:59,147 INFO L131 PetriNetUnfolder]: For 51666/52181 co-relation queries the response was YES. [2022-12-12 21:40:59,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80735 conditions, 5864 events. 3470/5864 cut-off events. For 51666/52181 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 38244 event pairs, 0 based on Foata normal form. 127/4556 useless extension candidates. Maximal degree in co-relation 80678. Up to 5639 conditions per place. [2022-12-12 21:40:59,214 INFO L137 encePairwiseOnDemand]: 67/72 looper letters, 155 selfloop transitions, 15 changer transitions 75/267 dead transitions. [2022-12-12 21:40:59,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 267 transitions, 8497 flow [2022-12-12 21:40:59,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:40:59,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:40:59,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2022-12-12 21:40:59,228 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3277777777777778 [2022-12-12 21:40:59,229 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, 15 predicate places. [2022-12-12 21:40:59,229 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 267 transitions, 8497 flow [2022-12-12 21:40:59,270 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 192 transitions, 5955 flow [2022-12-12 21:40:59,271 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 192 transitions, 5955 flow [2022-12-12 21:40:59,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.375) internal successors, (131), 8 states have internal predecessors, (131), 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-12 21:40:59,271 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:40:59,271 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, 1] [2022-12-12 21:40:59,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-12 21:40:59,271 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:40:59,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:40:59,271 INFO L85 PathProgramCache]: Analyzing trace with hash 770376644, now seen corresponding path program 1 times [2022-12-12 21:40:59,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:40:59,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103489191] [2022-12-12 21:40:59,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:40:59,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:40:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:40:59,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 21:40:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:40:59,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 21:40:59,400 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 21:40:59,400 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-12 21:40:59,401 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-12 21:40:59,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-12 21:40:59,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-12 21:40:59,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-12 21:40:59,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-12 21:40:59,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-12 21:40:59,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-12 21:40:59,402 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:40:59,406 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 21:40:59,406 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 21:40:59,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 09:40:59 BasicIcfg [2022-12-12 21:40:59,466 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 21:40:59,466 INFO L158 Benchmark]: Toolchain (without parser) took 91836.64ms. Allocated memory was 205.5MB in the beginning and 7.9GB in the end (delta: 7.7GB). Free memory was 180.6MB in the beginning and 5.5GB in the end (delta: -5.3GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2022-12-12 21:40:59,467 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 205.5MB. Free memory was 181.6MB in the beginning and 181.5MB in the end (delta: 92.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 21:40:59,467 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.25ms. Allocated memory is still 205.5MB. Free memory was 180.1MB in the beginning and 152.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-12 21:40:59,467 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.11ms. Allocated memory is still 205.5MB. Free memory was 152.8MB in the beginning and 150.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 21:40:59,467 INFO L158 Benchmark]: Boogie Preprocessor took 38.56ms. Allocated memory is still 205.5MB. Free memory was 150.2MB in the beginning and 148.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 21:40:59,467 INFO L158 Benchmark]: RCFGBuilder took 524.93ms. Allocated memory is still 205.5MB. Free memory was 148.1MB in the beginning and 110.9MB in the end (delta: 37.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-12-12 21:40:59,467 INFO L158 Benchmark]: TraceAbstraction took 90729.69ms. Allocated memory was 205.5MB in the beginning and 7.9GB in the end (delta: 7.7GB). Free memory was 109.8MB in the beginning and 5.5GB in the end (delta: -5.4GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2022-12-12 21:40:59,468 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 205.5MB. Free memory was 181.6MB in the beginning and 181.5MB in the end (delta: 92.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 481.25ms. Allocated memory is still 205.5MB. Free memory was 180.1MB in the beginning and 152.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.11ms. Allocated memory is still 205.5MB. Free memory was 152.8MB in the beginning and 150.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.56ms. Allocated memory is still 205.5MB. Free memory was 150.2MB in the beginning and 148.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 524.93ms. Allocated memory is still 205.5MB. Free memory was 148.1MB in the beginning and 110.9MB in the end (delta: 37.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 90729.69ms. Allocated memory was 205.5MB in the beginning and 7.9GB in the end (delta: 7.7GB). Free memory was 109.8MB in the beginning and 5.5GB in the end (delta: -5.4GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.5s, 134 PlacesBefore, 83 PlacesAfterwards, 123 TransitionsBefore, 72 TransitionsAfterwards, 2882 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 41 TrivialYvCompositions, 51 ConcurrentYvCompositions, 2 ChoiceCompositions, 96 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5105, independent: 4917, independent conditional: 4917, independent unconditional: 0, dependent: 188, dependent conditional: 188, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5105, independent: 4917, independent conditional: 0, independent unconditional: 4917, dependent: 188, dependent conditional: 0, dependent unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5105, independent: 4917, independent conditional: 0, independent unconditional: 4917, dependent: 188, dependent conditional: 0, dependent unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5105, independent: 4917, independent conditional: 0, independent unconditional: 4917, dependent: 188, dependent conditional: 0, dependent unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2611, independent: 2546, independent conditional: 0, independent unconditional: 2546, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2611, independent: 2476, independent conditional: 0, independent unconditional: 2476, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 135, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 381, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 294, dependent conditional: 0, dependent unconditional: 294, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5105, independent: 2371, independent conditional: 0, independent unconditional: 2371, dependent: 123, dependent conditional: 0, dependent unconditional: 123, unknown: 2611, unknown conditional: 0, unknown unconditional: 2611] , Statistics on independence cache: Total cache size (in pairs): 5472, Positive cache size: 5407, Positive conditional cache size: 0, Positive unconditional cache size: 5407, Negative cache size: 65, Negative conditional cache size: 0, Negative unconditional cache size: 65, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - 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_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff0_thd4; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$r_buff1_thd4; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L841] 0 pthread_t t1433; [L842] FCALL, FORK 0 pthread_create(&t1433, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1433, ((void *)0), P0, ((void *)0))=8, t1433={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L843] 0 pthread_t t1434; [L844] FCALL, FORK 0 pthread_create(&t1434, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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(&t1434, ((void *)0), P1, ((void *)0))=9, t1433={5:0}, t1434={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] 0 pthread_t t1435; [L846] FCALL, FORK 0 pthread_create(&t1435, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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(&t1435, ((void *)0), P2, ((void *)0))=10, t1433={5:0}, t1434={6:0}, t1435={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] 0 pthread_t t1436; [L848] FCALL, FORK 0 pthread_create(&t1436, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=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(&t1436, ((void *)0), P3, ((void *)0))=11, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L787] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L787] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 4 z = 1 VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 a = 1 VAL [__unbuffered_cnt=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L820] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L821] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L822] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L823] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 1 x = 1 VAL [__unbuffered_cnt=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 x = 2 VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y = 1 VAL [__unbuffered_cnt=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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 4 return 0; [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=4, __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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=4, __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=1, main$tmp_guard1=0, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L861] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L862] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L863] 0 y$flush_delayed = weak$$choice2 [L864] 0 y$mem_tmp = y [L865] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L866] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L867] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L868] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L869] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L871] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L873] 0 y = y$flush_delayed ? y$mem_tmp : y [L874] 0 y$flush_delayed = (_Bool)0 [L876] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=4, __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=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 848]: 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: 844]: 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: 846]: 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: 842]: 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, 162 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 3.2s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 90.6s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 75.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 737 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 737 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 193 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1791 IncrementalHoareTripleChecker+Invalid, 1984 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 193 mSolverCounterUnsat, 26 mSDtfsCounter, 1791 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19027occurred in iteration=10, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 57223 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 252 ConstructedInterpolants, 0 QuantifiedInterpolants, 2510 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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-12 21:40:59,507 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...