/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-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_REDUNDANT_FLOW -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 11:53:18,940 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 11:53:18,942 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 11:53:18,970 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 11:53:18,971 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 11:53:18,973 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 11:53:18,975 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 11:53:18,979 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 11:53:18,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 11:53:18,986 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 11:53:18,986 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 11:53:18,988 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 11:53:18,988 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 11:53:18,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 11:53:18,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 11:53:18,993 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 11:53:18,993 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 11:53:18,994 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 11:53:18,995 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 11:53:18,999 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 11:53:19,000 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 11:53:19,001 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 11:53:19,001 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 11:53:19,002 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 11:53:19,007 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 11:53:19,007 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 11:53:19,007 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 11:53:19,008 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 11:53:19,009 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 11:53:19,009 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 11:53:19,009 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 11:53:19,010 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 11:53:19,012 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 11:53:19,012 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 11:53:19,013 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 11:53:19,013 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 11:53:19,013 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 11:53:19,013 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 11:53:19,014 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 11:53:19,014 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 11:53:19,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 11:53:19,015 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-NoLbe.epf [2022-12-12 11:53:19,056 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 11:53:19,056 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 11:53:19,057 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 11:53:19,057 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 11:53:19,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 11:53:19,059 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 11:53:19,059 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 11:53:19,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 11:53:19,059 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 11:53:19,060 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 11:53:19,060 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 11:53:19,060 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 11:53:19,060 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 11:53:19,061 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 11:53:19,061 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 11:53:19,061 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 11:53:19,061 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 11:53:19,061 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 11:53:19,061 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 11:53:19,061 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 11:53:19,061 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 11:53:19,062 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 11:53:19,062 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 11:53:19,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 11:53:19,062 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 11:53:19,062 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 11:53:19,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 11:53:19,062 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-12 11:53:19,062 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 11:53:19,063 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 11:53:19,063 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 11:53:19,063 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_REDUNDANT_FLOW [2022-12-12 11:53:19,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 11:53:19,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 11:53:19,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 11:53:19,378 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 11:53:19,378 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 11:53:19,379 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i [2022-12-12 11:53:20,325 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 11:53:20,621 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 11:53:20,621 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i [2022-12-12 11:53:20,660 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/304ed20e6/2d111c37c5034bc8b93e7cb8bbfae2ca/FLAG6723f0d56 [2022-12-12 11:53:20,673 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/304ed20e6/2d111c37c5034bc8b93e7cb8bbfae2ca [2022-12-12 11:53:20,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 11:53:20,676 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 11:53:20,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 11:53:20,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 11:53:20,680 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 11:53:20,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 11:53:20" (1/1) ... [2022-12-12 11:53:20,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37c2efe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:53:20, skipping insertion in model container [2022-12-12 11:53:20,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 11:53:20" (1/1) ... [2022-12-12 11:53:20,686 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 11:53:20,729 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 11:53:20,873 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/mix035_pso.opt_tso.opt.i[956,969] [2022-12-12 11:53:21,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 11:53:21,078 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 11:53:21,087 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/mix035_pso.opt_tso.opt.i[956,969] [2022-12-12 11:53:21,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:53:21,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:53:21,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 11:53:21,168 INFO L208 MainTranslator]: Completed translation [2022-12-12 11:53:21,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:53:21 WrapperNode [2022-12-12 11:53:21,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 11:53:21,169 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 11:53:21,169 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 11:53:21,169 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 11:53:21,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:53:21" (1/1) ... [2022-12-12 11:53:21,190 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:53:21" (1/1) ... [2022-12-12 11:53:21,211 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 137 [2022-12-12 11:53:21,212 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 11:53:21,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 11:53:21,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 11:53:21,213 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 11:53:21,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:53:21" (1/1) ... [2022-12-12 11:53:21,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:53:21" (1/1) ... [2022-12-12 11:53:21,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:53:21" (1/1) ... [2022-12-12 11:53:21,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:53:21" (1/1) ... [2022-12-12 11:53:21,227 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:53:21" (1/1) ... [2022-12-12 11:53:21,229 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:53:21" (1/1) ... [2022-12-12 11:53:21,230 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:53:21" (1/1) ... [2022-12-12 11:53:21,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:53:21" (1/1) ... [2022-12-12 11:53:21,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 11:53:21,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 11:53:21,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 11:53:21,234 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 11:53:21,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:53:21" (1/1) ... [2022-12-12 11:53:21,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 11:53:21,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 11:53:21,260 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 11:53:21,287 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 11:53:21,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 11:53:21,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 11:53:21,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 11:53:21,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 11:53:21,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 11:53:21,303 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 11:53:21,303 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 11:53:21,303 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 11:53:21,304 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 11:53:21,304 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 11:53:21,304 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 11:53:21,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 11:53:21,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 11:53:21,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 11:53:21,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 11:53:21,305 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 11:53:21,474 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 11:53:21,476 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 11:53:21,719 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 11:53:21,885 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 11:53:21,885 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 11:53:21,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 11:53:21 BoogieIcfgContainer [2022-12-12 11:53:21,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 11:53:21,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 11:53:21,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 11:53:21,897 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 11:53:21,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 11:53:20" (1/3) ... [2022-12-12 11:53:21,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69dc30de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 11:53:21, skipping insertion in model container [2022-12-12 11:53:21,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:53:21" (2/3) ... [2022-12-12 11:53:21,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69dc30de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 11:53:21, skipping insertion in model container [2022-12-12 11:53:21,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 11:53:21" (3/3) ... [2022-12-12 11:53:21,899 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_pso.opt_tso.opt.i [2022-12-12 11:53:21,932 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 11:53:21,932 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 11:53:21,932 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 11:53:22,010 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 11:53:22,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 237 flow [2022-12-12 11:53:22,095 INFO L130 PetriNetUnfolder]: 2/108 cut-off events. [2022-12-12 11:53:22,096 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 11:53:22,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-12 11:53:22,101 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 111 transitions, 237 flow [2022-12-12 11:53:22,104 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 108 transitions, 225 flow [2022-12-12 11:53:22,114 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 11:53:22,121 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;@2b0a1dd3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 11:53:22,121 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 11:53:22,139 INFO L130 PetriNetUnfolder]: 0/72 cut-off events. [2022-12-12 11:53:22,139 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 11:53:22,139 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:53:22,140 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:53:22,141 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 11:53:22,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:53:22,145 INFO L85 PathProgramCache]: Analyzing trace with hash 390563707, now seen corresponding path program 1 times [2022-12-12 11:53:22,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:53:22,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143687850] [2022-12-12 11:53:22,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:53:22,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:53:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:53:22,786 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 11:53:22,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:53:22,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143687850] [2022-12-12 11:53:22,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143687850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:53:22,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:53:22,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 11:53:22,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641030577] [2022-12-12 11:53:22,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:53:22,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 11:53:22,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:53:22,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 11:53:22,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 11:53:22,832 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 111 [2022-12-12 11:53:22,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 108 transitions, 225 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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 11:53:22,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:53:22,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 111 [2022-12-12 11:53:22,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:53:22,936 INFO L130 PetriNetUnfolder]: 10/146 cut-off events. [2022-12-12 11:53:22,936 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-12 11:53:22,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 146 events. 10/146 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 254 event pairs, 2 based on Foata normal form. 7/147 useless extension candidates. Maximal degree in co-relation 133. Up to 17 conditions per place. [2022-12-12 11:53:22,939 INFO L137 encePairwiseOnDemand]: 106/111 looper letters, 8 selfloop transitions, 2 changer transitions 0/106 dead transitions. [2022-12-12 11:53:22,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 106 transitions, 241 flow [2022-12-12 11:53:22,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 11:53:22,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 11:53:22,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 312 transitions. [2022-12-12 11:53:22,954 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9369369369369369 [2022-12-12 11:53:22,958 INFO L295 CegarLoopForPetriNet]: 116 programPoint places, 0 predicate places. [2022-12-12 11:53:22,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 106 transitions, 241 flow [2022-12-12 11:53:22,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 106 transitions, 234 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-12 11:53:22,963 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 106 transitions, 234 flow [2022-12-12 11:53:22,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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 11:53:22,964 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:53:22,964 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:53:22,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 11:53:22,964 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 11:53:22,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:53:22,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1070988786, now seen corresponding path program 1 times [2022-12-12 11:53:22,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:53:22,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519996600] [2022-12-12 11:53:22,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:53:22,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:53:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:53:23,309 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 11:53:23,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:53:23,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519996600] [2022-12-12 11:53:23,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519996600] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:53:23,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:53:23,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 11:53:23,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154588579] [2022-12-12 11:53:23,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:53:23,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 11:53:23,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:53:23,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 11:53:23,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 11:53:23,314 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 111 [2022-12-12 11:53:23,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 106 transitions, 234 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 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 11:53:23,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:53:23,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 111 [2022-12-12 11:53:23,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:53:23,592 INFO L130 PetriNetUnfolder]: 84/382 cut-off events. [2022-12-12 11:53:23,592 INFO L131 PetriNetUnfolder]: For 76/106 co-relation queries the response was YES. [2022-12-12 11:53:23,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 382 events. 84/382 cut-off events. For 76/106 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1777 event pairs, 14 based on Foata normal form. 1/373 useless extension candidates. Maximal degree in co-relation 602. Up to 80 conditions per place. [2022-12-12 11:53:23,595 INFO L137 encePairwiseOnDemand]: 105/111 looper letters, 17 selfloop transitions, 2 changer transitions 37/135 dead transitions. [2022-12-12 11:53:23,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 135 transitions, 420 flow [2022-12-12 11:53:23,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 11:53:23,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 11:53:23,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 863 transitions. [2022-12-12 11:53:23,598 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8638638638638638 [2022-12-12 11:53:23,599 INFO L295 CegarLoopForPetriNet]: 116 programPoint places, 5 predicate places. [2022-12-12 11:53:23,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 135 transitions, 420 flow [2022-12-12 11:53:23,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 135 transitions, 396 flow, removed 12 selfloop flow, removed 0 redundant places. [2022-12-12 11:53:23,602 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 135 transitions, 396 flow [2022-12-12 11:53:23,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 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 11:53:23,602 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:53:23,602 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:53:23,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 11:53:23,603 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 11:53:23,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:53:23,603 INFO L85 PathProgramCache]: Analyzing trace with hash -980906047, now seen corresponding path program 1 times [2022-12-12 11:53:23,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:53:23,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785938829] [2022-12-12 11:53:23,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:53:23,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:53:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:53:23,804 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 11:53:23,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:53:23,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785938829] [2022-12-12 11:53:23,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785938829] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:53:23,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:53:23,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 11:53:23,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126994337] [2022-12-12 11:53:23,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:53:23,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 11:53:23,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:53:23,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 11:53:23,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 11:53:23,808 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 111 [2022-12-12 11:53:23,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 135 transitions, 396 flow. Second operand has 6 states, 6 states have (on average 91.0) internal successors, (546), 6 states have internal predecessors, (546), 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 11:53:23,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:53:23,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 111 [2022-12-12 11:53:23,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:53:24,168 INFO L130 PetriNetUnfolder]: 661/1635 cut-off events. [2022-12-12 11:53:24,169 INFO L131 PetriNetUnfolder]: For 652/660 co-relation queries the response was YES. [2022-12-12 11:53:24,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3379 conditions, 1635 events. 661/1635 cut-off events. For 652/660 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11401 event pairs, 9 based on Foata normal form. 0/1595 useless extension candidates. Maximal degree in co-relation 3325. Up to 469 conditions per place. [2022-12-12 11:53:24,177 INFO L137 encePairwiseOnDemand]: 101/111 looper letters, 45 selfloop transitions, 6 changer transitions 53/202 dead transitions. [2022-12-12 11:53:24,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 202 transitions, 858 flow [2022-12-12 11:53:24,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-12 11:53:24,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-12 11:53:24,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 963 transitions. [2022-12-12 11:53:24,180 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8675675675675676 [2022-12-12 11:53:24,180 INFO L295 CegarLoopForPetriNet]: 116 programPoint places, 14 predicate places. [2022-12-12 11:53:24,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 202 transitions, 858 flow [2022-12-12 11:53:24,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 202 transitions, 854 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-12 11:53:24,184 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 202 transitions, 854 flow [2022-12-12 11:53:24,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.0) internal successors, (546), 6 states have internal predecessors, (546), 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 11:53:24,184 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:53:24,185 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:53:24,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 11:53:24,185 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 11:53:24,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:53:24,185 INFO L85 PathProgramCache]: Analyzing trace with hash 512123199, now seen corresponding path program 1 times [2022-12-12 11:53:24,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:53:24,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234225040] [2022-12-12 11:53:24,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:53:24,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:53:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:53:24,340 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 11:53:24,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:53:24,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234225040] [2022-12-12 11:53:24,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234225040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:53:24,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:53:24,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 11:53:24,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324437865] [2022-12-12 11:53:24,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:53:24,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 11:53:24,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:53:24,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 11:53:24,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 11:53:24,342 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 111 [2022-12-12 11:53:24,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 202 transitions, 854 flow. Second operand has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 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 11:53:24,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:53:24,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 111 [2022-12-12 11:53:24,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:53:24,673 INFO L130 PetriNetUnfolder]: 505/1274 cut-off events. [2022-12-12 11:53:24,673 INFO L131 PetriNetUnfolder]: For 659/740 co-relation queries the response was YES. [2022-12-12 11:53:24,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3421 conditions, 1274 events. 505/1274 cut-off events. For 659/740 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8408 event pairs, 8 based on Foata normal form. 21/1274 useless extension candidates. Maximal degree in co-relation 3365. Up to 306 conditions per place. [2022-12-12 11:53:24,679 INFO L137 encePairwiseOnDemand]: 101/111 looper letters, 35 selfloop transitions, 9 changer transitions 147/277 dead transitions. [2022-12-12 11:53:24,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 277 transitions, 1592 flow [2022-12-12 11:53:24,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-12 11:53:24,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-12 11:53:24,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1254 transitions. [2022-12-12 11:53:24,682 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8690228690228691 [2022-12-12 11:53:24,683 INFO L295 CegarLoopForPetriNet]: 116 programPoint places, 25 predicate places. [2022-12-12 11:53:24,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 277 transitions, 1592 flow [2022-12-12 11:53:24,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 277 transitions, 1478 flow, removed 49 selfloop flow, removed 4 redundant places. [2022-12-12 11:53:24,688 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 277 transitions, 1478 flow [2022-12-12 11:53:24,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 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 11:53:24,689 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:53:24,689 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:53:24,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 11:53:24,689 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 11:53:24,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:53:24,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1424279359, now seen corresponding path program 1 times [2022-12-12 11:53:24,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:53:24,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192138626] [2022-12-12 11:53:24,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:53:24,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:53:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:53:24,861 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 11:53:24,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:53:24,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192138626] [2022-12-12 11:53:24,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192138626] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:53:24,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:53:24,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 11:53:24,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448077004] [2022-12-12 11:53:24,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:53:24,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 11:53:24,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:53:24,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 11:53:24,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-12 11:53:24,863 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 111 [2022-12-12 11:53:24,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 277 transitions, 1478 flow. Second operand has 7 states, 7 states have (on average 91.28571428571429) internal successors, (639), 7 states have internal predecessors, (639), 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 11:53:24,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:53:24,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 111 [2022-12-12 11:53:24,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:53:25,285 INFO L130 PetriNetUnfolder]: 1100/2654 cut-off events. [2022-12-12 11:53:25,286 INFO L131 PetriNetUnfolder]: For 2168/2357 co-relation queries the response was YES. [2022-12-12 11:53:25,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7375 conditions, 2654 events. 1100/2654 cut-off events. For 2168/2357 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 20576 event pairs, 23 based on Foata normal form. 74/2676 useless extension candidates. Maximal degree in co-relation 7317. Up to 545 conditions per place. [2022-12-12 11:53:25,298 INFO L137 encePairwiseOnDemand]: 105/111 looper letters, 63 selfloop transitions, 2 changer transitions 213/383 dead transitions. [2022-12-12 11:53:25,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 383 transitions, 2646 flow [2022-12-12 11:53:25,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 11:53:25,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 11:53:25,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 674 transitions. [2022-12-12 11:53:25,300 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8674388674388674 [2022-12-12 11:53:25,303 INFO L295 CegarLoopForPetriNet]: 116 programPoint places, 27 predicate places. [2022-12-12 11:53:25,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 383 transitions, 2646 flow [2022-12-12 11:53:25,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 383 transitions, 2604 flow, removed 21 selfloop flow, removed 0 redundant places. [2022-12-12 11:53:25,309 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 383 transitions, 2604 flow [2022-12-12 11:53:25,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.28571428571429) internal successors, (639), 7 states have internal predecessors, (639), 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 11:53:25,310 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:53:25,310 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:53:25,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 11:53:25,310 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 11:53:25,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:53:25,311 INFO L85 PathProgramCache]: Analyzing trace with hash -703274943, now seen corresponding path program 2 times [2022-12-12 11:53:25,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:53:25,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011694119] [2022-12-12 11:53:25,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:53:25,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:53:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:53:25,532 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 11:53:25,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:53:25,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011694119] [2022-12-12 11:53:25,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011694119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:53:25,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:53:25,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 11:53:25,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276026475] [2022-12-12 11:53:25,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:53:25,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 11:53:25,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:53:25,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 11:53:25,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-12 11:53:25,535 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 111 [2022-12-12 11:53:25,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 383 transitions, 2604 flow. Second operand has 8 states, 8 states have (on average 90.875) internal successors, (727), 8 states have internal predecessors, (727), 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 11:53:25,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:53:25,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 111 [2022-12-12 11:53:25,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:53:26,099 INFO L130 PetriNetUnfolder]: 1036/2329 cut-off events. [2022-12-12 11:53:26,099 INFO L131 PetriNetUnfolder]: For 2987/3904 co-relation queries the response was YES. [2022-12-12 11:53:26,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8347 conditions, 2329 events. 1036/2329 cut-off events. For 2987/3904 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 18054 event pairs, 19 based on Foata normal form. 324/2610 useless extension candidates. Maximal degree in co-relation 8289. Up to 426 conditions per place. [2022-12-12 11:53:26,107 INFO L137 encePairwiseOnDemand]: 101/111 looper letters, 27 selfloop transitions, 14 changer transitions 257/374 dead transitions. [2022-12-12 11:53:26,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 374 transitions, 3112 flow [2022-12-12 11:53:26,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-12 11:53:26,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-12 11:53:26,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1514 transitions. [2022-12-12 11:53:26,111 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8524774774774775 [2022-12-12 11:53:26,111 INFO L295 CegarLoopForPetriNet]: 116 programPoint places, 36 predicate places. [2022-12-12 11:53:26,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 374 transitions, 3112 flow [2022-12-12 11:53:26,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 374 transitions, 2598 flow, removed 230 selfloop flow, removed 7 redundant places. [2022-12-12 11:53:26,120 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 374 transitions, 2598 flow [2022-12-12 11:53:26,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.875) internal successors, (727), 8 states have internal predecessors, (727), 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 11:53:26,120 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:53:26,120 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:53:26,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 11:53:26,121 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 11:53:26,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:53:26,121 INFO L85 PathProgramCache]: Analyzing trace with hash -363339123, now seen corresponding path program 1 times [2022-12-12 11:53:26,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:53:26,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063796066] [2022-12-12 11:53:26,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:53:26,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:53:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:53:26,293 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 11:53:26,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:53:26,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063796066] [2022-12-12 11:53:26,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063796066] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:53:26,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:53:26,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 11:53:26,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462739170] [2022-12-12 11:53:26,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:53:26,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 11:53:26,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:53:26,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 11:53:26,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-12 11:53:26,295 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 111 [2022-12-12 11:53:26,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 374 transitions, 2598 flow. Second operand has 7 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 states have internal predecessors, (640), 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 11:53:26,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:53:26,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 111 [2022-12-12 11:53:26,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:53:26,692 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([315] L753-->L758: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][171], [233#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 122#true, 53#L3true, 125#true, 10#L811true, 182#(= ~a~0 1), 156#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, 22#L758true, 82#L781true, 216#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-12 11:53:26,692 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-12 11:53:26,693 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-12 11:53:26,693 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-12 11:53:26,693 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-12 11:53:26,698 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([330] L811-->L818: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_71 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0)))) (let ((.cse3 (and (not (= (mod v_~y$w_buff1_used~0_69 256) 0)) .cse1)) (.cse4 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_72 256) 0)) .cse5))) (and (= (ite (or (and .cse0 (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256)))) (and (not (= (mod v_~y$w_buff1_used~0_68 256) 0)) .cse1)) 0 v_~y$r_buff1_thd3~0_20) v_~y$r_buff1_thd3~0_19) (= v_~y~0_40 (ite .cse2 v_~y$w_buff0~0_33 (ite .cse3 v_~y$w_buff1~0_30 v_~y~0_41))) (= v_~y$w_buff1_used~0_68 (ite (or .cse4 .cse3) 0 v_~y$w_buff1_used~0_69)) (= v_~y$r_buff0_thd3~0_26 (ite .cse4 0 v_~y$r_buff0_thd3~0_27)) (= v_~y$w_buff0_used~0_71 (ite .cse2 0 v_~y$w_buff0_used~0_72))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_72, ~y$w_buff1~0=v_~y$w_buff1~0_30, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_33, ~y~0=v_~y~0_41, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_71, ~y$w_buff1~0=v_~y$w_buff1~0_30, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_33, ~y~0=v_~y~0_40, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][347], [214#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 182#(= ~a~0 1), P1Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, 233#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 122#true, P2Thread1of1ForFork1InUse, 41#L753true, 53#L3true, 93#L818true, 82#L781true, 125#true]) [2022-12-12 11:53:26,699 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-12 11:53:26,699 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-12 11:53:26,699 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-12 11:53:26,699 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-12 11:53:26,752 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([315] L753-->L758: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][171], [233#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 122#true, 125#true, 10#L811true, 182#(= ~a~0 1), 112#L3-1true, P1Thread1of1ForFork0InUse, 156#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, 22#L758true, 82#L781true, 216#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-12 11:53:26,752 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-12-12 11:53:26,752 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-12 11:53:26,752 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-12 11:53:26,752 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-12 11:53:26,753 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([315] L753-->L758: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][312], [220#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 233#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 122#true, 100#L786true, 53#L3true, 125#true, 10#L811true, 182#(= ~a~0 1), 156#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 179#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, 22#L758true]) [2022-12-12 11:53:26,753 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-12-12 11:53:26,753 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-12 11:53:26,753 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-12 11:53:26,753 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-12 11:53:26,753 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([330] L811-->L818: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_71 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0)))) (let ((.cse3 (and (not (= (mod v_~y$w_buff1_used~0_69 256) 0)) .cse1)) (.cse4 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_72 256) 0)) .cse5))) (and (= (ite (or (and .cse0 (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256)))) (and (not (= (mod v_~y$w_buff1_used~0_68 256) 0)) .cse1)) 0 v_~y$r_buff1_thd3~0_20) v_~y$r_buff1_thd3~0_19) (= v_~y~0_40 (ite .cse2 v_~y$w_buff0~0_33 (ite .cse3 v_~y$w_buff1~0_30 v_~y~0_41))) (= v_~y$w_buff1_used~0_68 (ite (or .cse4 .cse3) 0 v_~y$w_buff1_used~0_69)) (= v_~y$r_buff0_thd3~0_26 (ite .cse4 0 v_~y$r_buff0_thd3~0_27)) (= v_~y$w_buff0_used~0_71 (ite .cse2 0 v_~y$w_buff0_used~0_72))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_72, ~y$w_buff1~0=v_~y$w_buff1~0_30, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_33, ~y~0=v_~y~0_41, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_71, ~y$w_buff1~0=v_~y$w_buff1~0_30, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_33, ~y~0=v_~y~0_40, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][388], [233#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 122#true, 41#L753true, 100#L786true, 53#L3true, 125#true, 182#(= ~a~0 1), P1Thread1of1ForFork0InUse, 156#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, 93#L818true, 216#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-12 11:53:26,754 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-12-12 11:53:26,754 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-12 11:53:26,754 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-12 11:53:26,754 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-12 11:53:26,792 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([330] L811-->L818: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_71 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0)))) (let ((.cse3 (and (not (= (mod v_~y$w_buff1_used~0_69 256) 0)) .cse1)) (.cse4 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_72 256) 0)) .cse5))) (and (= (ite (or (and .cse0 (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256)))) (and (not (= (mod v_~y$w_buff1_used~0_68 256) 0)) .cse1)) 0 v_~y$r_buff1_thd3~0_20) v_~y$r_buff1_thd3~0_19) (= v_~y~0_40 (ite .cse2 v_~y$w_buff0~0_33 (ite .cse3 v_~y$w_buff1~0_30 v_~y~0_41))) (= v_~y$w_buff1_used~0_68 (ite (or .cse4 .cse3) 0 v_~y$w_buff1_used~0_69)) (= v_~y$r_buff0_thd3~0_26 (ite .cse4 0 v_~y$r_buff0_thd3~0_27)) (= v_~y$w_buff0_used~0_71 (ite .cse2 0 v_~y$w_buff0_used~0_72))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_72, ~y$w_buff1~0=v_~y$w_buff1~0_30, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_33, ~y~0=v_~y~0_41, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_71, ~y$w_buff1~0=v_~y$w_buff1~0_30, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_33, ~y~0=v_~y~0_40, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][347], [214#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 182#(= ~a~0 1), 112#L3-1true, P1Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, 233#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 122#true, P2Thread1of1ForFork1InUse, 41#L753true, 93#L818true, 82#L781true, 125#true]) [2022-12-12 11:53:26,793 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is not cut-off event [2022-12-12 11:53:26,793 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-12-12 11:53:26,793 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-12-12 11:53:26,794 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-12-12 11:53:26,796 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([315] L753-->L758: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][312], [220#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 233#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 122#true, 100#L786true, 125#true, 10#L811true, 182#(= ~a~0 1), 112#L3-1true, P1Thread1of1ForFork0InUse, 156#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 179#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, 22#L758true]) [2022-12-12 11:53:26,796 INFO L382 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-12-12 11:53:26,796 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:53:26,796 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:53:26,796 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:53:26,797 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([330] L811-->L818: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_71 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0)))) (let ((.cse3 (and (not (= (mod v_~y$w_buff1_used~0_69 256) 0)) .cse1)) (.cse4 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_72 256) 0)) .cse5))) (and (= (ite (or (and .cse0 (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256)))) (and (not (= (mod v_~y$w_buff1_used~0_68 256) 0)) .cse1)) 0 v_~y$r_buff1_thd3~0_20) v_~y$r_buff1_thd3~0_19) (= v_~y~0_40 (ite .cse2 v_~y$w_buff0~0_33 (ite .cse3 v_~y$w_buff1~0_30 v_~y~0_41))) (= v_~y$w_buff1_used~0_68 (ite (or .cse4 .cse3) 0 v_~y$w_buff1_used~0_69)) (= v_~y$r_buff0_thd3~0_26 (ite .cse4 0 v_~y$r_buff0_thd3~0_27)) (= v_~y$w_buff0_used~0_71 (ite .cse2 0 v_~y$w_buff0_used~0_72))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_72, ~y$w_buff1~0=v_~y$w_buff1~0_30, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_33, ~y~0=v_~y~0_41, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_71, ~y$w_buff1~0=v_~y$w_buff1~0_30, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_33, ~y~0=v_~y~0_40, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][388], [233#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 122#true, 41#L753true, 100#L786true, 125#true, 182#(= ~a~0 1), 112#L3-1true, P1Thread1of1ForFork0InUse, 156#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, 93#L818true, 216#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-12 11:53:26,797 INFO L382 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-12-12 11:53:26,797 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:53:26,797 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:53:26,797 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:53:26,899 INFO L130 PetriNetUnfolder]: 2635/5429 cut-off events. [2022-12-12 11:53:26,899 INFO L131 PetriNetUnfolder]: For 8541/9624 co-relation queries the response was YES. [2022-12-12 11:53:26,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18580 conditions, 5429 events. 2635/5429 cut-off events. For 8541/9624 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 46383 event pairs, 56 based on Foata normal form. 380/5604 useless extension candidates. Maximal degree in co-relation 18520. Up to 973 conditions per place. [2022-12-12 11:53:26,917 INFO L137 encePairwiseOnDemand]: 105/111 looper letters, 23 selfloop transitions, 1 changer transitions 448/554 dead transitions. [2022-12-12 11:53:26,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 554 transitions, 4976 flow [2022-12-12 11:53:26,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 11:53:26,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 11:53:26,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 656 transitions. [2022-12-12 11:53:26,919 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8442728442728443 [2022-12-12 11:53:26,919 INFO L295 CegarLoopForPetriNet]: 116 programPoint places, 35 predicate places. [2022-12-12 11:53:26,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 554 transitions, 4976 flow [2022-12-12 11:53:26,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 554 transitions, 4968 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-12 11:53:26,931 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 554 transitions, 4968 flow [2022-12-12 11:53:26,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 states have internal predecessors, (640), 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 11:53:26,932 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:53:26,932 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:53:26,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 11:53:26,932 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 11:53:26,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:53:26,933 INFO L85 PathProgramCache]: Analyzing trace with hash -841832445, now seen corresponding path program 2 times [2022-12-12 11:53:26,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:53:26,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373438128] [2022-12-12 11:53:26,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:53:26,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:53:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:53:27,386 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 11:53:27,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:53:27,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373438128] [2022-12-12 11:53:27,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373438128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:53:27,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:53:27,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-12 11:53:27,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497458592] [2022-12-12 11:53:27,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:53:27,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 11:53:27,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:53:27,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 11:53:27,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-12 11:53:27,388 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 111 [2022-12-12 11:53:27,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 554 transitions, 4968 flow. Second operand has 9 states, 9 states have (on average 88.22222222222223) internal successors, (794), 9 states have internal predecessors, (794), 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 11:53:27,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:53:27,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 111 [2022-12-12 11:53:27,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:53:27,885 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([315] L753-->L758: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][148], [233#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 122#true, 125#true, 10#L811true, 182#(= ~a~0 1), 112#L3-1true, P1Thread1of1ForFork0InUse, 156#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, 244#(and (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 1) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), 22#L758true, 82#L781true, 216#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-12 11:53:27,885 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-12-12 11:53:27,885 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-12 11:53:27,885 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-12 11:53:27,885 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-12 11:53:27,938 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([330] L811-->L818: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_71 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0)))) (let ((.cse3 (and (not (= (mod v_~y$w_buff1_used~0_69 256) 0)) .cse1)) (.cse4 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_72 256) 0)) .cse5))) (and (= (ite (or (and .cse0 (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256)))) (and (not (= (mod v_~y$w_buff1_used~0_68 256) 0)) .cse1)) 0 v_~y$r_buff1_thd3~0_20) v_~y$r_buff1_thd3~0_19) (= v_~y~0_40 (ite .cse2 v_~y$w_buff0~0_33 (ite .cse3 v_~y$w_buff1~0_30 v_~y~0_41))) (= v_~y$w_buff1_used~0_68 (ite (or .cse4 .cse3) 0 v_~y$w_buff1_used~0_69)) (= v_~y$r_buff0_thd3~0_26 (ite .cse4 0 v_~y$r_buff0_thd3~0_27)) (= v_~y$w_buff0_used~0_71 (ite .cse2 0 v_~y$w_buff0_used~0_72))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_72, ~y$w_buff1~0=v_~y$w_buff1~0_30, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_33, ~y~0=v_~y~0_41, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_71, ~y$w_buff1~0=v_~y$w_buff1~0_30, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_33, ~y~0=v_~y~0_40, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][353], [122#true, 233#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 41#L753true, 125#true, 214#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 182#(= ~a~0 1), 112#L3-1true, P1Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, 93#L818true, 245#(and (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0)) (= ~y~0 1)), 82#L781true]) [2022-12-12 11:53:27,938 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is not cut-off event [2022-12-12 11:53:27,938 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-12-12 11:53:27,938 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-12-12 11:53:27,938 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-12-12 11:53:27,941 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([330] L811-->L818: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_71 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0)))) (let ((.cse3 (and (not (= (mod v_~y$w_buff1_used~0_69 256) 0)) .cse1)) (.cse4 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_72 256) 0)) .cse5))) (and (= (ite (or (and .cse0 (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256)))) (and (not (= (mod v_~y$w_buff1_used~0_68 256) 0)) .cse1)) 0 v_~y$r_buff1_thd3~0_20) v_~y$r_buff1_thd3~0_19) (= v_~y~0_40 (ite .cse2 v_~y$w_buff0~0_33 (ite .cse3 v_~y$w_buff1~0_30 v_~y~0_41))) (= v_~y$w_buff1_used~0_68 (ite (or .cse4 .cse3) 0 v_~y$w_buff1_used~0_69)) (= v_~y$r_buff0_thd3~0_26 (ite .cse4 0 v_~y$r_buff0_thd3~0_27)) (= v_~y$w_buff0_used~0_71 (ite .cse2 0 v_~y$w_buff0_used~0_72))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_72, ~y$w_buff1~0=v_~y$w_buff1~0_30, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_33, ~y~0=v_~y~0_41, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_71, ~y$w_buff1~0=v_~y$w_buff1~0_30, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_33, ~y~0=v_~y~0_40, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][404], [122#true, 233#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 41#L753true, 100#L786true, 125#true, 182#(= ~a~0 1), 112#L3-1true, P1Thread1of1ForFork0InUse, 156#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, 245#(and (= ~y$r_buff0_thd2~0 0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y$w_buff1_used~0 0)) (= ~y~0 1)), 93#L818true, 216#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-12 11:53:27,941 INFO L382 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-12-12 11:53:27,941 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:53:27,942 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:53:27,942 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:53:27,942 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([315] L753-->L758: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][331], [220#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 233#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 122#true, 100#L786true, 125#true, 10#L811true, 182#(= ~a~0 1), 112#L3-1true, 156#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 179#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, 244#(and (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 1) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), 22#L758true]) [2022-12-12 11:53:27,942 INFO L382 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-12-12 11:53:27,942 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:53:27,942 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:53:27,942 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:53:28,088 INFO L130 PetriNetUnfolder]: 2892/6884 cut-off events. [2022-12-12 11:53:28,088 INFO L131 PetriNetUnfolder]: For 12541/13267 co-relation queries the response was YES. [2022-12-12 11:53:28,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23076 conditions, 6884 events. 2892/6884 cut-off events. For 12541/13267 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 66437 event pairs, 69 based on Foata normal form. 145/6868 useless extension candidates. Maximal degree in co-relation 23010. Up to 1200 conditions per place. [2022-12-12 11:53:28,113 INFO L137 encePairwiseOnDemand]: 102/111 looper letters, 17 selfloop transitions, 6 changer transitions 519/621 dead transitions. [2022-12-12 11:53:28,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 621 transitions, 6432 flow [2022-12-12 11:53:28,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-12 11:53:28,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-12 11:53:28,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 890 transitions. [2022-12-12 11:53:28,115 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8018018018018018 [2022-12-12 11:53:28,115 INFO L295 CegarLoopForPetriNet]: 116 programPoint places, 44 predicate places. [2022-12-12 11:53:28,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 621 transitions, 6432 flow [2022-12-12 11:53:28,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 621 transitions, 6193 flow, removed 86 selfloop flow, removed 2 redundant places. [2022-12-12 11:53:28,129 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 621 transitions, 6193 flow [2022-12-12 11:53:28,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 88.22222222222223) internal successors, (794), 9 states have internal predecessors, (794), 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 11:53:28,130 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:53:28,130 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:53:28,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 11:53:28,131 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 11:53:28,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:53:28,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1777336191, now seen corresponding path program 3 times [2022-12-12 11:53:28,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:53:28,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435111461] [2022-12-12 11:53:28,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:53:28,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:53:28,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 11:53:28,154 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 11:53:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 11:53:28,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 11:53:28,200 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 11:53:28,201 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 11:53:28,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 11:53:28,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 11:53:28,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 11:53:28,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 11:53:28,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 11:53:28,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 11:53:28,203 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2022-12-12 11:53:28,208 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 11:53:28,208 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 11:53:28,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 11:53:28 BasicIcfg [2022-12-12 11:53:28,320 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 11:53:28,321 INFO L158 Benchmark]: Toolchain (without parser) took 7645.10ms. Allocated memory was 205.5MB in the beginning and 490.7MB in the end (delta: 285.2MB). Free memory was 179.5MB in the beginning and 458.9MB in the end (delta: -279.3MB). Peak memory consumption was 293.2MB. Max. memory is 8.0GB. [2022-12-12 11:53:28,321 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 205.5MB. Free memory was 183.2MB in the beginning and 183.1MB in the end (delta: 143.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 11:53:28,321 INFO L158 Benchmark]: CACSL2BoogieTranslator took 490.90ms. Allocated memory is still 205.5MB. Free memory was 179.0MB in the beginning and 153.3MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-12 11:53:28,323 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.63ms. Allocated memory is still 205.5MB. Free memory was 153.3MB in the beginning and 150.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 11:53:28,325 INFO L158 Benchmark]: Boogie Preprocessor took 20.99ms. Allocated memory is still 205.5MB. Free memory was 150.7MB in the beginning and 148.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 11:53:28,325 INFO L158 Benchmark]: RCFGBuilder took 658.37ms. Allocated memory is still 205.5MB. Free memory was 148.6MB in the beginning and 118.7MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-12 11:53:28,325 INFO L158 Benchmark]: TraceAbstraction took 6426.25ms. Allocated memory was 205.5MB in the beginning and 490.7MB in the end (delta: 285.2MB). Free memory was 117.1MB in the beginning and 458.9MB in the end (delta: -341.7MB). Peak memory consumption was 231.3MB. Max. memory is 8.0GB. [2022-12-12 11:53:28,326 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.13ms. Allocated memory is still 205.5MB. Free memory was 183.2MB in the beginning and 183.1MB in the end (delta: 143.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 490.90ms. Allocated memory is still 205.5MB. Free memory was 179.0MB in the beginning and 153.3MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.63ms. Allocated memory is still 205.5MB. Free memory was 153.3MB in the beginning and 150.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.99ms. Allocated memory is still 205.5MB. Free memory was 150.7MB in the beginning and 148.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 658.37ms. Allocated memory is still 205.5MB. Free memory was 148.6MB in the beginning and 118.7MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 6426.25ms. Allocated memory was 205.5MB in the beginning and 490.7MB in the end (delta: 285.2MB). Free memory was 117.1MB in the beginning and 458.9MB in the end (delta: -341.7MB). Peak memory consumption was 231.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L717] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L719] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L720] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L721] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L723] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L725] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L726] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L727] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L728] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L729] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L730] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L731] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L732] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L733] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L734] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L735] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L736] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L737] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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}] [L738] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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] [L739] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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] [L740] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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] [L741] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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] [L743] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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] [L744] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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] [L745] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=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] [L835] 0 pthread_t t922; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t922={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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] [L836] FCALL, FORK 0 pthread_create(&t922, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t922, ((void *)0), P0, ((void *)0))=-2, t922={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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] [L837] 0 pthread_t t923; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t922={5:0}, t923={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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] [L838] FCALL, FORK 0 pthread_create(&t923, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t923, ((void *)0), P1, ((void *)0))=-1, t922={5:0}, t923={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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] [L839] 0 pthread_t t924; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t922={5:0}, t923={6:0}, t924={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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] [L840] FCALL, FORK 0 pthread_create(&t924, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t924, ((void *)0), P2, ((void *)0))=0, t922={5:0}, t923={6:0}, t924={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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] [L792] 3 y$w_buff1 = y$w_buff0 [L793] 3 y$w_buff0 = 1 [L794] 3 y$w_buff1_used = y$w_buff0_used [L795] 3 y$w_buff0_used = (_Bool)1 [L796] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L796] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L797] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L798] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L799] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L800] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L801] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L810] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L749] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L752] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L764] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y [L771] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L772] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L777] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 __unbuffered_p1_EAX = y [L779] 2 y = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L813] 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) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 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 [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t922={5:0}, t923={6:0}, t924={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] 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) [L847] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L848] 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 [L849] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L850] 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=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t922={5:0}, t923={6:0}, t924={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L853] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t922={5:0}, t923={6:0}, t924={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L855] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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: 838]: 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: 836]: 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: 840]: 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, 138 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: 6.2s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 439 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 439 mSDsluCounter, 298 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 237 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 753 IncrementalHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 61 mSDtfsCounter, 753 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6193occurred in iteration=8, InterpolantAutomatonStates: 75, 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, 952 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 713 NumberOfCodeBlocks, 713 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 618 ConstructedInterpolants, 0 QuantifiedInterpolants, 1726 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 11:53:28,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...