/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/safe012_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 21:42:08,898 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 21:42:08,899 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 21:42:08,928 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 21:42:08,929 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 21:42:08,931 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 21:42:08,934 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 21:42:08,937 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 21:42:08,940 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 21:42:08,941 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 21:42:08,941 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 21:42:08,942 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 21:42:08,942 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 21:42:08,943 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 21:42:08,944 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 21:42:08,944 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 21:42:08,945 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 21:42:08,945 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 21:42:08,947 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 21:42:08,948 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 21:42:08,949 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 21:42:08,955 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 21:42:08,956 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 21:42:08,957 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 21:42:08,965 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 21:42:08,966 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 21:42:08,966 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 21:42:08,966 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 21:42:08,966 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 21:42:08,967 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 21:42:08,967 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 21:42:08,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 21:42:08,968 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 21:42:08,969 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 21:42:08,969 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 21:42:08,969 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 21:42:08,970 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 21:42:08,970 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 21:42:08,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 21:42:08,971 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 21:42:08,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 21:42:08,975 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:42:09,001 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 21:42:09,001 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 21:42:09,002 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 21:42:09,003 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 21:42:09,003 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 21:42:09,003 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 21:42:09,004 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 21:42:09,004 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 21:42:09,004 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 21:42:09,004 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 21:42:09,004 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 21:42:09,005 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 21:42:09,005 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 21:42:09,005 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 21:42:09,005 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 21:42:09,005 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 21:42:09,005 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 21:42:09,005 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 21:42:09,005 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 21:42:09,005 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 21:42:09,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 21:42:09,006 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 21:42:09,006 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 21:42:09,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:42:09,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 21:42:09,006 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 21:42:09,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 21:42:09,006 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 21:42:09,006 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 21:42:09,006 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 21:42:09,007 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:42:09,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 21:42:09,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 21:42:09,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 21:42:09,309 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 21:42:09,309 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 21:42:09,310 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_power.opt.i [2022-12-12 21:42:10,238 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 21:42:10,478 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 21:42:10,478 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_power.opt.i [2022-12-12 21:42:10,488 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e9175eff/4075da12e96140039c51b38e74db4e14/FLAGc3e1a59d2 [2022-12-12 21:42:10,500 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e9175eff/4075da12e96140039c51b38e74db4e14 [2022-12-12 21:42:10,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 21:42:10,508 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 21:42:10,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 21:42:10,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 21:42:10,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 21:42:10,511 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:42:10" (1/1) ... [2022-12-12 21:42:10,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ece3067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:42:10, skipping insertion in model container [2022-12-12 21:42:10,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:42:10" (1/1) ... [2022-12-12 21:42:10,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 21:42:10,568 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 21:42:10,709 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/safe012_power.opt.i[951,964] [2022-12-12 21:42:10,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:42:10,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:42:10,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:42:10,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:42:10,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:42:10,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:42:10,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:42:10,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:42:10,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:42:10,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:42:10,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:42:10,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:42:10,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:42:10,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:42:10,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:42:10,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:42:10,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:42:10,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:42:10,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:42:10,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:42:10,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:42:10,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:42:10,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:42:10,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:42:10,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:42:10,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:42:10,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:42:10,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:42:10,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:42:10,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:42:10,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:42:10,923 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 21:42:10,933 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/safe012_power.opt.i[951,964] [2022-12-12 21:42:10,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:42:10,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:42:10,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:42:10,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:42:10,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:42:10,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:42:10,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:42:10,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:42:10,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:42:10,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:42:10,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:42:10,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:42:10,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:42:10,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:42:10,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:42:10,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:42:10,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:42:10,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:42:10,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:42:10,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:42:10,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:42:10,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:42:10,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:42:10,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:42:10,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:42:10,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:42:10,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:42:10,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:42:10,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:42:10,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:42:10,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:42:11,023 INFO L208 MainTranslator]: Completed translation [2022-12-12 21:42:11,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:42:11 WrapperNode [2022-12-12 21:42:11,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 21:42:11,026 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 21:42:11,026 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 21:42:11,026 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 21:42:11,031 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:42:11" (1/1) ... [2022-12-12 21:42:11,047 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:42:11" (1/1) ... [2022-12-12 21:42:11,083 INFO L138 Inliner]: procedures = 176, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 181 [2022-12-12 21:42:11,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 21:42:11,086 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 21:42:11,086 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 21:42:11,086 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 21:42:11,092 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:42:11" (1/1) ... [2022-12-12 21:42:11,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:42:11" (1/1) ... [2022-12-12 21:42:11,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:42:11" (1/1) ... [2022-12-12 21:42:11,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:42:11" (1/1) ... [2022-12-12 21:42:11,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:42:11" (1/1) ... [2022-12-12 21:42:11,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:42:11" (1/1) ... [2022-12-12 21:42:11,134 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:42:11" (1/1) ... [2022-12-12 21:42:11,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:42:11" (1/1) ... [2022-12-12 21:42:11,149 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 21:42:11,149 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 21:42:11,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 21:42:11,149 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 21:42:11,150 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:42:11" (1/1) ... [2022-12-12 21:42:11,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:42:11,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 21:42:11,200 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:42:11,204 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:42:11,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 21:42:11,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 21:42:11,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 21:42:11,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 21:42:11,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 21:42:11,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 21:42:11,231 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 21:42:11,231 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 21:42:11,231 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 21:42:11,231 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 21:42:11,231 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 21:42:11,231 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 21:42:11,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 21:42:11,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 21:42:11,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 21:42:11,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 21:42:11,232 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:42:11,377 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 21:42:11,379 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 21:42:11,683 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 21:42:11,899 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 21:42:11,899 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 21:42:11,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:42:11 BoogieIcfgContainer [2022-12-12 21:42:11,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 21:42:11,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 21:42:11,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 21:42:11,906 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 21:42:11,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 09:42:10" (1/3) ... [2022-12-12 21:42:11,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b10b25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:42:11, skipping insertion in model container [2022-12-12 21:42:11,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:42:11" (2/3) ... [2022-12-12 21:42:11,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b10b25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:42:11, skipping insertion in model container [2022-12-12 21:42:11,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:42:11" (3/3) ... [2022-12-12 21:42:11,908 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_power.opt.i [2022-12-12 21:42:11,922 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 21:42:11,922 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 21:42:11,922 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 21:42:12,009 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 21:42:12,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 127 transitions, 269 flow [2022-12-12 21:42:12,095 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-12 21:42:12,095 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:42:12,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-12 21:42:12,102 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 127 transitions, 269 flow [2022-12-12 21:42:12,107 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 124 transitions, 257 flow [2022-12-12 21:42:12,108 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 21:42:12,130 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 124 transitions, 257 flow [2022-12-12 21:42:12,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 257 flow [2022-12-12 21:42:12,156 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-12 21:42:12,156 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:42:12,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-12 21:42:12,159 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 124 transitions, 257 flow [2022-12-12 21:42:12,159 INFO L226 LiptonReduction]: Number of co-enabled transitions 1790 [2022-12-12 21:42:22,447 INFO L241 LiptonReduction]: Total number of compositions: 105 [2022-12-12 21:42:22,460 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 21:42:22,466 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;@18be319b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 21:42:22,466 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 21:42:22,471 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-12 21:42:22,471 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:42:22,471 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:42:22,472 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-12 21:42:22,472 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:42:22,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:42:22,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1956991359, now seen corresponding path program 1 times [2022-12-12 21:42:22,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:42:22,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032478813] [2022-12-12 21:42:22,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:42:22,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:42:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:42:22,853 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:42:22,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:42:22,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032478813] [2022-12-12 21:42:22,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032478813] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:42:22,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:42:22,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:42:22,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877052396] [2022-12-12 21:42:22,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:42:22,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:42:22,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:42:22,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:42:22,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:42:22,876 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 59 [2022-12-12 21:42:22,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 59 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:42:22,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:42:22,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 59 [2022-12-12 21:42:22,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:42:24,235 INFO L130 PetriNetUnfolder]: 7551/11413 cut-off events. [2022-12-12 21:42:24,235 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-12 21:42:24,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22300 conditions, 11413 events. 7551/11413 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 80804 event pairs, 2159 based on Foata normal form. 0/6626 useless extension candidates. Maximal degree in co-relation 22289. Up to 7569 conditions per place. [2022-12-12 21:42:24,267 INFO L137 encePairwiseOnDemand]: 55/59 looper letters, 31 selfloop transitions, 2 changer transitions 52/95 dead transitions. [2022-12-12 21:42:24,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 95 transitions, 372 flow [2022-12-12 21:42:24,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:42:24,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:42:24,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2022-12-12 21:42:24,276 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-12 21:42:24,279 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, 0 predicate places. [2022-12-12 21:42:24,279 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 95 transitions, 372 flow [2022-12-12 21:42:24,296 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 43 transitions, 164 flow [2022-12-12 21:42:24,297 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 43 transitions, 164 flow [2022-12-12 21:42:24,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:42:24,297 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:42:24,298 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:42:24,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 21:42:24,298 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:42:24,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:42:24,299 INFO L85 PathProgramCache]: Analyzing trace with hash 896401592, now seen corresponding path program 1 times [2022-12-12 21:42:24,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:42:24,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190057422] [2022-12-12 21:42:24,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:42:24,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:42:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:42:24,537 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:42:24,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:42:24,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190057422] [2022-12-12 21:42:24,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190057422] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:42:24,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:42:24,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:42:24,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90767913] [2022-12-12 21:42:24,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:42:24,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:42:24,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:42:24,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:42:24,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:42:24,541 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 59 [2022-12-12 21:42:24,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:42:24,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:42:24,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 59 [2022-12-12 21:42:24,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:42:24,763 INFO L130 PetriNetUnfolder]: 1028/1701 cut-off events. [2022-12-12 21:42:24,763 INFO L131 PetriNetUnfolder]: For 68/86 co-relation queries the response was YES. [2022-12-12 21:42:24,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4835 conditions, 1701 events. 1028/1701 cut-off events. For 68/86 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 9627 event pairs, 52 based on Foata normal form. 31/1423 useless extension candidates. Maximal degree in co-relation 4821. Up to 1303 conditions per place. [2022-12-12 21:42:24,771 INFO L137 encePairwiseOnDemand]: 56/59 looper letters, 53 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2022-12-12 21:42:24,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 66 transitions, 377 flow [2022-12-12 21:42:24,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:42:24,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:42:24,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-12 21:42:24,772 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3785310734463277 [2022-12-12 21:42:24,773 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -24 predicate places. [2022-12-12 21:42:24,773 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 66 transitions, 377 flow [2022-12-12 21:42:24,780 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 66 transitions, 377 flow [2022-12-12 21:42:24,781 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 66 transitions, 377 flow [2022-12-12 21:42:24,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:42:24,781 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:42:24,781 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:42:24,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 21:42:24,781 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:42:24,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:42:24,782 INFO L85 PathProgramCache]: Analyzing trace with hash 2018644239, now seen corresponding path program 1 times [2022-12-12 21:42:24,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:42:24,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716230136] [2022-12-12 21:42:24,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:42:24,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:42:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:42:24,915 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:42:24,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:42:24,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716230136] [2022-12-12 21:42:24,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716230136] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:42:24,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:42:24,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:42:24,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394414433] [2022-12-12 21:42:24,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:42:24,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:42:24,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:42:24,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:42:24,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:42:24,919 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 59 [2022-12-12 21:42:24,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 66 transitions, 377 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:42:24,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:42:24,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 59 [2022-12-12 21:42:24,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:42:25,291 INFO L130 PetriNetUnfolder]: 1559/2627 cut-off events. [2022-12-12 21:42:25,291 INFO L131 PetriNetUnfolder]: For 817/817 co-relation queries the response was YES. [2022-12-12 21:42:25,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9556 conditions, 2627 events. 1559/2627 cut-off events. For 817/817 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 15631 event pairs, 59 based on Foata normal form. 108/2245 useless extension candidates. Maximal degree in co-relation 9539. Up to 2005 conditions per place. [2022-12-12 21:42:25,304 INFO L137 encePairwiseOnDemand]: 55/59 looper letters, 54 selfloop transitions, 4 changer transitions 43/109 dead transitions. [2022-12-12 21:42:25,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 109 transitions, 835 flow [2022-12-12 21:42:25,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:42:25,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:42:25,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-12-12 21:42:25,308 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3474576271186441 [2022-12-12 21:42:25,309 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -21 predicate places. [2022-12-12 21:42:25,309 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 109 transitions, 835 flow [2022-12-12 21:42:25,318 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 66 transitions, 488 flow [2022-12-12 21:42:25,318 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 66 transitions, 488 flow [2022-12-12 21:42:25,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:42:25,319 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:42:25,319 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:42:25,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 21:42:25,319 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:42:25,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:42:25,320 INFO L85 PathProgramCache]: Analyzing trace with hash -308689113, now seen corresponding path program 1 times [2022-12-12 21:42:25,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:42:25,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472360239] [2022-12-12 21:42:25,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:42:25,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:42:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:42:26,298 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:42:26,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:42:26,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472360239] [2022-12-12 21:42:26,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472360239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:42:26,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:42:26,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 21:42:26,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727362990] [2022-12-12 21:42:26,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:42:26,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 21:42:26,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:42:26,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 21:42:26,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-12 21:42:26,305 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 59 [2022-12-12 21:42:26,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 66 transitions, 488 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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:42:26,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:42:26,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 59 [2022-12-12 21:42:26,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:42:26,616 INFO L130 PetriNetUnfolder]: 854/1471 cut-off events. [2022-12-12 21:42:26,616 INFO L131 PetriNetUnfolder]: For 818/818 co-relation queries the response was YES. [2022-12-12 21:42:26,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6600 conditions, 1471 events. 854/1471 cut-off events. For 818/818 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 7856 event pairs, 45 based on Foata normal form. 36/1243 useless extension candidates. Maximal degree in co-relation 6580. Up to 986 conditions per place. [2022-12-12 21:42:26,623 INFO L137 encePairwiseOnDemand]: 52/59 looper letters, 64 selfloop transitions, 14 changer transitions 0/87 dead transitions. [2022-12-12 21:42:26,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 87 transitions, 812 flow [2022-12-12 21:42:26,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:42:26,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:42:26,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-12-12 21:42:26,624 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3288135593220339 [2022-12-12 21:42:26,625 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -18 predicate places. [2022-12-12 21:42:26,625 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 87 transitions, 812 flow [2022-12-12 21:42:26,631 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 87 transitions, 812 flow [2022-12-12 21:42:26,631 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 87 transitions, 812 flow [2022-12-12 21:42:26,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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:42:26,631 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:42:26,632 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:42:26,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 21:42:26,632 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:42:26,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:42:26,632 INFO L85 PathProgramCache]: Analyzing trace with hash 2102044025, now seen corresponding path program 1 times [2022-12-12 21:42:26,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:42:26,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935233988] [2022-12-12 21:42:26,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:42:26,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:42:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:42:26,770 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:42:26,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:42:26,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935233988] [2022-12-12 21:42:26,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935233988] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:42:26,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:42:26,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:42:26,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593923186] [2022-12-12 21:42:26,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:42:26,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:42:26,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:42:26,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:42:26,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:42:26,772 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 59 [2022-12-12 21:42:26,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 87 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:42:26,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:42:26,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 59 [2022-12-12 21:42:26,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:42:26,973 INFO L130 PetriNetUnfolder]: 1313/2059 cut-off events. [2022-12-12 21:42:26,973 INFO L131 PetriNetUnfolder]: For 2949/2950 co-relation queries the response was YES. [2022-12-12 21:42:26,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10786 conditions, 2059 events. 1313/2059 cut-off events. For 2949/2950 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 10828 event pairs, 203 based on Foata normal form. 30/1759 useless extension candidates. Maximal degree in co-relation 10763. Up to 1935 conditions per place. [2022-12-12 21:42:26,985 INFO L137 encePairwiseOnDemand]: 48/59 looper letters, 86 selfloop transitions, 28 changer transitions 0/120 dead transitions. [2022-12-12 21:42:26,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 120 transitions, 1349 flow [2022-12-12 21:42:26,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:42:26,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:42:26,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-12-12 21:42:26,986 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3559322033898305 [2022-12-12 21:42:26,987 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -16 predicate places. [2022-12-12 21:42:26,987 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 120 transitions, 1349 flow [2022-12-12 21:42:26,997 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 120 transitions, 1349 flow [2022-12-12 21:42:26,997 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 120 transitions, 1349 flow [2022-12-12 21:42:26,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:42:26,997 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:42:26,998 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:42:26,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 21:42:26,998 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:42:26,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:42:26,998 INFO L85 PathProgramCache]: Analyzing trace with hash -261151508, now seen corresponding path program 1 times [2022-12-12 21:42:26,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:42:26,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994878121] [2022-12-12 21:42:26,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:42:26,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:42:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:42:27,191 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:42:27,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:42:27,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994878121] [2022-12-12 21:42:27,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994878121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:42:27,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:42:27,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:42:27,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766321916] [2022-12-12 21:42:27,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:42:27,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:42:27,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:42:27,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:42:27,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:42:27,193 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 59 [2022-12-12 21:42:27,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 120 transitions, 1349 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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:42:27,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:42:27,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 59 [2022-12-12 21:42:27,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:42:27,352 INFO L130 PetriNetUnfolder]: 689/1227 cut-off events. [2022-12-12 21:42:27,352 INFO L131 PetriNetUnfolder]: For 1760/1768 co-relation queries the response was YES. [2022-12-12 21:42:27,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7712 conditions, 1227 events. 689/1227 cut-off events. For 1760/1768 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 6813 event pairs, 84 based on Foata normal form. 86/1123 useless extension candidates. Maximal degree in co-relation 7686. Up to 1137 conditions per place. [2022-12-12 21:42:27,359 INFO L137 encePairwiseOnDemand]: 48/59 looper letters, 74 selfloop transitions, 49 changer transitions 0/129 dead transitions. [2022-12-12 21:42:27,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 129 transitions, 1679 flow [2022-12-12 21:42:27,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:42:27,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:42:27,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-12-12 21:42:27,361 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3559322033898305 [2022-12-12 21:42:27,361 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -13 predicate places. [2022-12-12 21:42:27,361 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 129 transitions, 1679 flow [2022-12-12 21:42:27,368 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 129 transitions, 1679 flow [2022-12-12 21:42:27,368 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 129 transitions, 1679 flow [2022-12-12 21:42:27,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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:42:27,368 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:42:27,368 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:42:27,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 21:42:27,368 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:42:27,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:42:27,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1734365753, now seen corresponding path program 1 times [2022-12-12 21:42:27,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:42:27,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192396788] [2022-12-12 21:42:27,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:42:27,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:42:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:42:27,533 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:42:27,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:42:27,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192396788] [2022-12-12 21:42:27,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192396788] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:42:27,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:42:27,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:42:27,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698355127] [2022-12-12 21:42:27,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:42:27,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:42:27,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:42:27,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:42:27,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:42:27,538 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 59 [2022-12-12 21:42:27,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 129 transitions, 1679 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:42:27,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:42:27,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 59 [2022-12-12 21:42:27,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:42:27,868 INFO L130 PetriNetUnfolder]: 1207/2145 cut-off events. [2022-12-12 21:42:27,868 INFO L131 PetriNetUnfolder]: For 4187/4206 co-relation queries the response was YES. [2022-12-12 21:42:27,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15067 conditions, 2145 events. 1207/2145 cut-off events. For 4187/4206 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 12664 event pairs, 138 based on Foata normal form. 80/1866 useless extension candidates. Maximal degree in co-relation 15038. Up to 1992 conditions per place. [2022-12-12 21:42:27,881 INFO L137 encePairwiseOnDemand]: 56/59 looper letters, 145 selfloop transitions, 8 changer transitions 40/206 dead transitions. [2022-12-12 21:42:27,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 206 transitions, 3132 flow [2022-12-12 21:42:27,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:42:27,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:42:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-12-12 21:42:27,882 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3474576271186441 [2022-12-12 21:42:27,883 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -10 predicate places. [2022-12-12 21:42:27,883 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 206 transitions, 3132 flow [2022-12-12 21:42:27,893 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 166 transitions, 2506 flow [2022-12-12 21:42:27,893 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 166 transitions, 2506 flow [2022-12-12 21:42:27,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:42:27,893 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:42:27,893 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:42:27,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 21:42:27,894 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:42:27,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:42:27,894 INFO L85 PathProgramCache]: Analyzing trace with hash -2098489328, now seen corresponding path program 1 times [2022-12-12 21:42:27,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:42:27,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460832781] [2022-12-12 21:42:27,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:42:27,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:42:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:42:28,082 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:42:28,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:42:28,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460832781] [2022-12-12 21:42:28,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460832781] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:42:28,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:42:28,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:42:28,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807516234] [2022-12-12 21:42:28,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:42:28,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:42:28,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:42:28,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:42:28,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:42:28,084 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 59 [2022-12-12 21:42:28,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 166 transitions, 2506 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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:42:28,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:42:28,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 59 [2022-12-12 21:42:28,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:42:28,275 INFO L130 PetriNetUnfolder]: 393/825 cut-off events. [2022-12-12 21:42:28,275 INFO L131 PetriNetUnfolder]: For 3033/3073 co-relation queries the response was YES. [2022-12-12 21:42:28,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6322 conditions, 825 events. 393/825 cut-off events. For 3033/3073 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4480 event pairs, 3 based on Foata normal form. 123/812 useless extension candidates. Maximal degree in co-relation 6290. Up to 700 conditions per place. [2022-12-12 21:42:28,280 INFO L137 encePairwiseOnDemand]: 48/59 looper letters, 33 selfloop transitions, 54 changer transitions 67/158 dead transitions. [2022-12-12 21:42:28,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 158 transitions, 2682 flow [2022-12-12 21:42:28,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:42:28,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:42:28,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-12 21:42:28,282 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30847457627118646 [2022-12-12 21:42:28,282 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -7 predicate places. [2022-12-12 21:42:28,282 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 158 transitions, 2682 flow [2022-12-12 21:42:28,287 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 91 transitions, 1497 flow [2022-12-12 21:42:28,287 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 91 transitions, 1497 flow [2022-12-12 21:42:28,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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:42:28,287 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:42:28,287 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] [2022-12-12 21:42:28,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 21:42:28,288 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:42:28,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:42:28,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1016409308, now seen corresponding path program 1 times [2022-12-12 21:42:28,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:42:28,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758072845] [2022-12-12 21:42:28,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:42:28,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:42:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:42:28,339 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 21:42:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:42:28,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 21:42:28,406 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 21:42:28,406 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 21:42:28,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 21:42:28,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 21:42:28,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 21:42:28,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 21:42:28,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 21:42:28,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 21:42:28,409 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:42:28,412 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 21:42:28,413 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 21:42:28,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 09:42:28 BasicIcfg [2022-12-12 21:42:28,468 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 21:42:28,468 INFO L158 Benchmark]: Toolchain (without parser) took 17959.65ms. Allocated memory was 202.4MB in the beginning and 924.8MB in the end (delta: 722.5MB). Free memory was 176.7MB in the beginning and 450.2MB in the end (delta: -273.5MB). Peak memory consumption was 450.1MB. Max. memory is 8.0GB. [2022-12-12 21:42:28,468 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 202.4MB. Free memory is still 178.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 21:42:28,468 INFO L158 Benchmark]: CACSL2BoogieTranslator took 515.58ms. Allocated memory is still 202.4MB. Free memory was 176.7MB in the beginning and 149.5MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-12 21:42:28,469 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.00ms. Allocated memory is still 202.4MB. Free memory was 149.5MB in the beginning and 146.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 21:42:28,469 INFO L158 Benchmark]: Boogie Preprocessor took 63.04ms. Allocated memory is still 202.4MB. Free memory was 146.9MB in the beginning and 144.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 21:42:28,469 INFO L158 Benchmark]: RCFGBuilder took 752.72ms. Allocated memory is still 202.4MB. Free memory was 144.2MB in the beginning and 73.5MB in the end (delta: 70.8MB). Peak memory consumption was 70.3MB. Max. memory is 8.0GB. [2022-12-12 21:42:28,469 INFO L158 Benchmark]: TraceAbstraction took 16563.92ms. Allocated memory was 202.4MB in the beginning and 924.8MB in the end (delta: 722.5MB). Free memory was 72.4MB in the beginning and 450.2MB in the end (delta: -377.8MB). Peak memory consumption was 346.2MB. Max. memory is 8.0GB. [2022-12-12 21:42:28,470 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 202.4MB. Free memory is still 178.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 515.58ms. Allocated memory is still 202.4MB. Free memory was 176.7MB in the beginning and 149.5MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.00ms. Allocated memory is still 202.4MB. Free memory was 149.5MB in the beginning and 146.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 63.04ms. Allocated memory is still 202.4MB. Free memory was 146.9MB in the beginning and 144.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 752.72ms. Allocated memory is still 202.4MB. Free memory was 144.2MB in the beginning and 73.5MB in the end (delta: 70.8MB). Peak memory consumption was 70.3MB. Max. memory is 8.0GB. * TraceAbstraction took 16563.92ms. Allocated memory was 202.4MB in the beginning and 924.8MB in the end (delta: 722.5MB). Free memory was 72.4MB in the beginning and 450.2MB in the end (delta: -377.8MB). Peak memory consumption was 346.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.3s, 132 PlacesBefore, 69 PlacesAfterwards, 124 TransitionsBefore, 59 TransitionsAfterwards, 1790 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 58 TrivialYvCompositions, 42 ConcurrentYvCompositions, 3 ChoiceCompositions, 105 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3600, independent: 3431, independent conditional: 3431, independent unconditional: 0, dependent: 169, dependent conditional: 169, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3600, independent: 3431, independent conditional: 0, independent unconditional: 3431, dependent: 169, dependent conditional: 0, dependent unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3600, independent: 3431, independent conditional: 0, independent unconditional: 3431, dependent: 169, dependent conditional: 0, dependent unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3600, independent: 3431, independent conditional: 0, independent unconditional: 3431, dependent: 169, dependent conditional: 0, dependent unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1763, independent: 1699, independent conditional: 0, independent unconditional: 1699, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1763, independent: 1668, independent conditional: 0, independent unconditional: 1668, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 95, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 506, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 468, dependent conditional: 0, dependent unconditional: 468, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3600, independent: 1732, independent conditional: 0, independent unconditional: 1732, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 1763, unknown conditional: 0, unknown unconditional: 1763] , Statistics on independence cache: Total cache size (in pairs): 3073, Positive cache size: 3009, Positive conditional cache size: 0, Positive unconditional cache size: 3009, Negative cache size: 64, Negative conditional cache size: 0, Negative unconditional cache size: 64, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L716] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L717] 0 int __unbuffered_p2_EAX$mem_tmp; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L726] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L727] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L728] 0 int __unbuffered_p2_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L730] 0 int __unbuffered_p2_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L737] 0 int y = 0; [L738] 0 _Bool y$flush_delayed; [L739] 0 int y$mem_tmp; [L740] 0 _Bool y$r_buff0_thd0; [L741] 0 _Bool y$r_buff0_thd1; [L742] 0 _Bool y$r_buff0_thd2; [L743] 0 _Bool y$r_buff0_thd3; [L744] 0 _Bool y$r_buff1_thd0; [L745] 0 _Bool y$r_buff1_thd1; [L746] 0 _Bool y$r_buff1_thd2; [L747] 0 _Bool y$r_buff1_thd3; [L748] 0 _Bool y$read_delayed; [L749] 0 int *y$read_delayed_var; [L750] 0 int y$w_buff0; [L751] 0 _Bool y$w_buff0_used; [L752] 0 int y$w_buff1; [L753] 0 _Bool y$w_buff1_used; [L755] 0 int z = 0; [L756] 0 _Bool weak$$choice0; [L757] 0 _Bool weak$$choice1; [L758] 0 _Bool weak$$choice2; [L850] 0 pthread_t t2052; [L851] FCALL, FORK 0 pthread_create(&t2052, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2052, ((void *)0), P0, ((void *)0))=-2, t2052={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] 0 pthread_t t2053; [L853] FCALL, FORK 0 pthread_create(&t2053, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2053, ((void *)0), P1, ((void *)0))=-1, t2052={7:0}, t2053={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L854] 0 pthread_t t2054; [L855] FCALL, FORK 0 pthread_create(&t2054, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2054, ((void *)0), P2, ((void *)0))=0, t2052={7:0}, t2053={5:0}, t2054={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(y) [L809] 3 y$mem_tmp = y [L810] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] EXPR 3 \read(y) [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] 3 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)))) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)))) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L818] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L819] 3 __unbuffered_p2_EAX$read_delayed_var = &y [L820] EXPR 3 \read(y) [L820] 3 __unbuffered_p2_EAX = y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] EXPR 3 \read(y) [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] 3 y = y$flush_delayed ? y$mem_tmp : y [L822] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 \read(y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] 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) [L829] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L830] 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 [L831] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L832] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 1 __unbuffered_p0_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L780] 2 y$w_buff1 = y$w_buff0 [L781] 2 y$w_buff0 = 1 [L782] 2 y$w_buff1_used = y$w_buff0_used [L783] 2 y$w_buff0_used = (_Bool)1 [L784] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L784] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 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) [L793] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L794] 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 [L795] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 \read(y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] 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) [L862] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L863] 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 [L864] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L865] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2052={7:0}, t2053={5:0}, t2054={6:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L868] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L872] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, 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: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 153 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.1s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.4s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 195 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 195 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 580 IncrementalHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 2 mSDtfsCounter, 580 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2506occurred in iteration=7, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 2366 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 532 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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:42:28,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...