/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 18:58:51,291 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 18:58:51,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 18:58:51,320 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 18:58:51,321 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 18:58:51,322 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 18:58:51,326 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 18:58:51,329 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 18:58:51,332 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 18:58:51,335 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 18:58:51,336 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 18:58:51,338 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 18:58:51,338 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 18:58:51,339 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 18:58:51,341 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 18:58:51,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 18:58:51,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 18:58:51,342 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 18:58:51,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 18:58:51,348 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 18:58:51,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 18:58:51,349 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 18:58:51,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 18:58:51,351 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 18:58:51,355 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 18:58:51,355 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 18:58:51,356 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 18:58:51,357 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 18:58:51,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 18:58:51,357 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 18:58:51,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 18:58:51,359 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 18:58:51,360 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 18:58:51,360 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 18:58:51,361 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 18:58:51,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 18:58:51,361 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 18:58:51,361 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 18:58:51,361 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 18:58:51,362 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 18:58:51,362 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 18:58:51,363 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-11 18:58:51,387 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 18:58:51,387 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 18:58:51,388 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 18:58:51,388 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 18:58:51,389 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 18:58:51,389 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 18:58:51,389 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 18:58:51,389 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 18:58:51,390 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 18:58:51,390 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 18:58:51,390 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 18:58:51,390 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 18:58:51,390 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 18:58:51,390 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 18:58:51,391 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 18:58:51,391 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 18:58:51,391 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 18:58:51,391 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 18:58:51,391 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 18:58:51,391 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 18:58:51,391 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 18:58:51,391 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 18:58:51,391 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 18:58:51,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 18:58:51,392 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 18:58:51,392 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 18:58:51,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 18:58:51,392 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 18:58:51,392 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 18:58:51,392 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 18:58:51,392 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 18:58:51,392 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-11 18:58:51,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 18:58:51,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 18:58:51,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 18:58:51,630 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 18:58:51,630 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 18:58:51,632 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i [2022-12-11 18:58:52,612 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 18:58:52,882 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 18:58:52,882 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i [2022-12-11 18:58:52,898 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11d35ec82/3f5417ede06e4f5d9e18c0ec2833a9b1/FLAGb4fdbbed2 [2022-12-11 18:58:52,915 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11d35ec82/3f5417ede06e4f5d9e18c0ec2833a9b1 [2022-12-11 18:58:52,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 18:58:52,917 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 18:58:52,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 18:58:52,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 18:58:52,921 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 18:58:52,922 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 06:58:52" (1/1) ... [2022-12-11 18:58:52,923 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74db227e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:58:52, skipping insertion in model container [2022-12-11 18:58:52,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 06:58:52" (1/1) ... [2022-12-11 18:58:52,927 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 18:58:52,967 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 18:58:53,099 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/mix011_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-11 18:58:53,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 18:58:53,281 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 18:58:53,301 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/mix011_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-11 18:58:53,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:58:53,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:58:53,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 18:58:53,402 INFO L208 MainTranslator]: Completed translation [2022-12-11 18:58:53,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:58:53 WrapperNode [2022-12-11 18:58:53,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 18:58:53,404 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 18:58:53,404 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 18:58:53,404 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 18:58:53,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:58:53" (1/1) ... [2022-12-11 18:58:53,420 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:58:53" (1/1) ... [2022-12-11 18:58:53,438 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 131 [2022-12-11 18:58:53,438 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 18:58:53,439 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 18:58:53,439 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 18:58:53,439 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 18:58:53,445 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:58:53" (1/1) ... [2022-12-11 18:58:53,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:58:53" (1/1) ... [2022-12-11 18:58:53,466 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:58:53" (1/1) ... [2022-12-11 18:58:53,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:58:53" (1/1) ... [2022-12-11 18:58:53,473 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:58:53" (1/1) ... [2022-12-11 18:58:53,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:58:53" (1/1) ... [2022-12-11 18:58:53,480 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:58:53" (1/1) ... [2022-12-11 18:58:53,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:58:53" (1/1) ... [2022-12-11 18:58:53,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 18:58:53,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 18:58:53,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 18:58:53,484 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 18:58:53,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:58:53" (1/1) ... [2022-12-11 18:58:53,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 18:58:53,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 18:58:53,514 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-11 18:58:53,535 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-11 18:58:53,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 18:58:53,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 18:58:53,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 18:58:53,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 18:58:53,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 18:58:53,545 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 18:58:53,545 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 18:58:53,546 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 18:58:53,546 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 18:58:53,546 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-11 18:58:53,546 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-11 18:58:53,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 18:58:53,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 18:58:53,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 18:58:53,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 18:58:53,547 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 18:58:53,678 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 18:58:53,679 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 18:58:53,942 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 18:58:54,065 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 18:58:54,065 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 18:58:54,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 06:58:54 BoogieIcfgContainer [2022-12-11 18:58:54,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 18:58:54,069 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 18:58:54,069 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 18:58:54,071 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 18:58:54,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 06:58:52" (1/3) ... [2022-12-11 18:58:54,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1924105c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 06:58:54, skipping insertion in model container [2022-12-11 18:58:54,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:58:53" (2/3) ... [2022-12-11 18:58:54,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1924105c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 06:58:54, skipping insertion in model container [2022-12-11 18:58:54,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 06:58:54" (3/3) ... [2022-12-11 18:58:54,073 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011_power.oepc_pso.oepc_rmo.oepc.i [2022-12-11 18:58:54,087 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 18:58:54,087 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 18:58:54,087 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 18:58:54,133 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 18:58:54,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-12-11 18:58:54,211 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-12-11 18:58:54,212 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 18:58:54,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-11 18:58:54,217 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2022-12-11 18:58:54,221 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2022-12-11 18:58:54,232 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 18:58:54,237 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;@43b384aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 18:58:54,237 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-11 18:58:54,247 INFO L130 PetriNetUnfolder]: 0/46 cut-off events. [2022-12-11 18:58:54,247 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 18:58:54,247 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:58:54,248 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] [2022-12-11 18:58:54,249 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 18:58:54,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:58:54,252 INFO L85 PathProgramCache]: Analyzing trace with hash 262549838, now seen corresponding path program 1 times [2022-12-11 18:58:54,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:58:54,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789571216] [2022-12-11 18:58:54,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:58:54,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:58:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:58:54,695 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-11 18:58:54,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:58:54,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789571216] [2022-12-11 18:58:54,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789571216] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:58:54,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:58:54,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 18:58:54,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676162519] [2022-12-11 18:58:54,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:58:54,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 18:58:54,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:58:54,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 18:58:54,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 18:58:54,734 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 114 [2022-12-11 18:58:54,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-11 18:58:54,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:58:54,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 114 [2022-12-11 18:58:54,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:58:54,869 INFO L130 PetriNetUnfolder]: 58/275 cut-off events. [2022-12-11 18:58:54,869 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-11 18:58:54,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 275 events. 58/275 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1142 event pairs, 10 based on Foata normal form. 27/289 useless extension candidates. Maximal degree in co-relation 352. Up to 79 conditions per place. [2022-12-11 18:58:54,874 INFO L137 encePairwiseOnDemand]: 109/114 looper letters, 14 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2022-12-11 18:58:54,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 113 transitions, 273 flow [2022-12-11 18:58:54,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 18:58:54,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 18:58:54,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-12-11 18:58:54,887 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9385964912280702 [2022-12-11 18:58:54,888 INFO L175 Difference]: Start difference. First operand has 119 places, 111 transitions, 231 flow. Second operand 3 states and 321 transitions. [2022-12-11 18:58:54,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 113 transitions, 273 flow [2022-12-11 18:58:54,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 113 transitions, 268 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-11 18:58:54,894 INFO L231 Difference]: Finished difference. Result has 116 places, 107 transitions, 224 flow [2022-12-11 18:58:54,895 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=116, PETRI_TRANSITIONS=107} [2022-12-11 18:58:54,901 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2022-12-11 18:58:54,901 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 224 flow [2022-12-11 18:58:54,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-11 18:58:54,902 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:58:54,902 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-11 18:58:54,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 18:58:54,903 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 18:58:54,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:58:54,904 INFO L85 PathProgramCache]: Analyzing trace with hash 246519019, now seen corresponding path program 1 times [2022-12-11 18:58:54,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:58:54,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426082951] [2022-12-11 18:58:54,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:58:54,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:58:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:58:55,198 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-11 18:58:55,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:58:55,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426082951] [2022-12-11 18:58:55,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426082951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:58:55,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:58:55,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 18:58:55,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607635881] [2022-12-11 18:58:55,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:58:55,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 18:58:55,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:58:55,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 18:58:55,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 18:58:55,202 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2022-12-11 18:58:55,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 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-11 18:58:55,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:58:55,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2022-12-11 18:58:55,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:58:55,602 INFO L130 PetriNetUnfolder]: 488/1371 cut-off events. [2022-12-11 18:58:55,602 INFO L131 PetriNetUnfolder]: For 95/95 co-relation queries the response was YES. [2022-12-11 18:58:55,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2265 conditions, 1371 events. 488/1371 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 9900 event pairs, 90 based on Foata normal form. 0/1334 useless extension candidates. Maximal degree in co-relation 2213. Up to 403 conditions per place. [2022-12-11 18:58:55,614 INFO L137 encePairwiseOnDemand]: 108/114 looper letters, 19 selfloop transitions, 2 changer transitions 46/147 dead transitions. [2022-12-11 18:58:55,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 147 transitions, 434 flow [2022-12-11 18:58:55,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 18:58:55,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 18:58:55,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 888 transitions. [2022-12-11 18:58:55,618 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8654970760233918 [2022-12-11 18:58:55,618 INFO L175 Difference]: Start difference. First operand has 116 places, 107 transitions, 224 flow. Second operand 9 states and 888 transitions. [2022-12-11 18:58:55,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 147 transitions, 434 flow [2022-12-11 18:58:55,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 147 transitions, 416 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-11 18:58:55,622 INFO L231 Difference]: Finished difference. Result has 129 places, 97 transitions, 220 flow [2022-12-11 18:58:55,623 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=220, PETRI_PLACES=129, PETRI_TRANSITIONS=97} [2022-12-11 18:58:55,623 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places. [2022-12-11 18:58:55,624 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 97 transitions, 220 flow [2022-12-11 18:58:55,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 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-11 18:58:55,624 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:58:55,625 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] [2022-12-11 18:58:55,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 18:58:55,625 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 18:58:55,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:58:55,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1617464034, now seen corresponding path program 1 times [2022-12-11 18:58:55,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:58:55,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559802315] [2022-12-11 18:58:55,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:58:55,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:58:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:58:55,852 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-11 18:58:55,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:58:55,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559802315] [2022-12-11 18:58:55,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559802315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:58:55,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:58:55,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 18:58:55,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754100535] [2022-12-11 18:58:55,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:58:55,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 18:58:55,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:58:55,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 18:58:55,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 18:58:55,857 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 114 [2022-12-11 18:58:55,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 97 transitions, 220 flow. Second operand has 7 states, 7 states have (on average 86.28571428571429) internal successors, (604), 7 states have internal predecessors, (604), 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-11 18:58:55,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:58:55,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 114 [2022-12-11 18:58:55,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:58:56,457 INFO L130 PetriNetUnfolder]: 1548/3087 cut-off events. [2022-12-11 18:58:56,458 INFO L131 PetriNetUnfolder]: For 831/831 co-relation queries the response was YES. [2022-12-11 18:58:56,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6352 conditions, 3087 events. 1548/3087 cut-off events. For 831/831 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 20176 event pairs, 450 based on Foata normal form. 78/3048 useless extension candidates. Maximal degree in co-relation 6289. Up to 907 conditions per place. [2022-12-11 18:58:56,472 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 39 selfloop transitions, 6 changer transitions 68/185 dead transitions. [2022-12-11 18:58:56,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 185 transitions, 672 flow [2022-12-11 18:58:56,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 18:58:56,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 18:58:56,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1208 transitions. [2022-12-11 18:58:56,476 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.815114709851552 [2022-12-11 18:58:56,476 INFO L175 Difference]: Start difference. First operand has 129 places, 97 transitions, 220 flow. Second operand 13 states and 1208 transitions. [2022-12-11 18:58:56,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 185 transitions, 672 flow [2022-12-11 18:58:56,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 185 transitions, 616 flow, removed 24 selfloop flow, removed 8 redundant places. [2022-12-11 18:58:56,493 INFO L231 Difference]: Finished difference. Result has 129 places, 101 transitions, 285 flow [2022-12-11 18:58:56,493 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=285, PETRI_PLACES=129, PETRI_TRANSITIONS=101} [2022-12-11 18:58:56,494 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places. [2022-12-11 18:58:56,494 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 101 transitions, 285 flow [2022-12-11 18:58:56,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.28571428571429) internal successors, (604), 7 states have internal predecessors, (604), 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-11 18:58:56,495 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:58:56,497 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-11 18:58:56,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 18:58:56,502 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 18:58:56,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:58:56,502 INFO L85 PathProgramCache]: Analyzing trace with hash -831003838, now seen corresponding path program 1 times [2022-12-11 18:58:56,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:58:56,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541059914] [2022-12-11 18:58:56,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:58:56,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:58:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:58:56,711 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-11 18:58:56,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:58:56,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541059914] [2022-12-11 18:58:56,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541059914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:58:56,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:58:56,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 18:58:56,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086172979] [2022-12-11 18:58:56,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:58:56,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 18:58:56,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:58:56,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 18:58:56,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 18:58:56,717 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-12-11 18:58:56,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 101 transitions, 285 flow. Second operand has 6 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 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-11 18:58:56,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:58:56,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-12-11 18:58:56,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:58:57,303 INFO L130 PetriNetUnfolder]: 2268/4501 cut-off events. [2022-12-11 18:58:57,304 INFO L131 PetriNetUnfolder]: For 3274/3509 co-relation queries the response was YES. [2022-12-11 18:58:57,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10103 conditions, 4501 events. 2268/4501 cut-off events. For 3274/3509 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 34318 event pairs, 173 based on Foata normal form. 33/4324 useless extension candidates. Maximal degree in co-relation 10038. Up to 1195 conditions per place. [2022-12-11 18:58:57,325 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 68 selfloop transitions, 17 changer transitions 10/175 dead transitions. [2022-12-11 18:58:57,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 175 transitions, 711 flow [2022-12-11 18:58:57,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 18:58:57,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 18:58:57,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 989 transitions. [2022-12-11 18:58:57,327 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8675438596491228 [2022-12-11 18:58:57,328 INFO L175 Difference]: Start difference. First operand has 129 places, 101 transitions, 285 flow. Second operand 10 states and 989 transitions. [2022-12-11 18:58:57,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 175 transitions, 711 flow [2022-12-11 18:58:57,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 175 transitions, 697 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-11 18:58:57,336 INFO L231 Difference]: Finished difference. Result has 131 places, 116 transitions, 391 flow [2022-12-11 18:58:57,337 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=391, PETRI_PLACES=131, PETRI_TRANSITIONS=116} [2022-12-11 18:58:57,338 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 12 predicate places. [2022-12-11 18:58:57,338 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 116 transitions, 391 flow [2022-12-11 18:58:57,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 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-11 18:58:57,338 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:58:57,338 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] [2022-12-11 18:58:57,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 18:58:57,339 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 18:58:57,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:58:57,339 INFO L85 PathProgramCache]: Analyzing trace with hash 192062738, now seen corresponding path program 1 times [2022-12-11 18:58:57,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:58:57,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398387909] [2022-12-11 18:58:57,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:58:57,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:58:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:58:57,536 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-11 18:58:57,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:58:57,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398387909] [2022-12-11 18:58:57,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398387909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:58:57,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:58:57,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 18:58:57,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718486569] [2022-12-11 18:58:57,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:58:57,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 18:58:57,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:58:57,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 18:58:57,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 18:58:57,538 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 114 [2022-12-11 18:58:57,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 116 transitions, 391 flow. Second operand has 7 states, 7 states have (on average 85.14285714285714) internal successors, (596), 7 states have internal predecessors, (596), 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-11 18:58:57,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:58:57,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 114 [2022-12-11 18:58:57,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:58:58,139 INFO L130 PetriNetUnfolder]: 1358/4085 cut-off events. [2022-12-11 18:58:58,139 INFO L131 PetriNetUnfolder]: For 3476/3791 co-relation queries the response was YES. [2022-12-11 18:58:58,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10376 conditions, 4085 events. 1358/4085 cut-off events. For 3476/3791 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 39430 event pairs, 156 based on Foata normal form. 112/4000 useless extension candidates. Maximal degree in co-relation 10301. Up to 765 conditions per place. [2022-12-11 18:58:58,164 INFO L137 encePairwiseOnDemand]: 98/114 looper letters, 66 selfloop transitions, 32 changer transitions 9/192 dead transitions. [2022-12-11 18:58:58,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 192 transitions, 903 flow [2022-12-11 18:58:58,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 18:58:58,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 18:58:58,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1003 transitions. [2022-12-11 18:58:58,168 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7998405103668261 [2022-12-11 18:58:58,168 INFO L175 Difference]: Start difference. First operand has 131 places, 116 transitions, 391 flow. Second operand 11 states and 1003 transitions. [2022-12-11 18:58:58,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 192 transitions, 903 flow [2022-12-11 18:58:58,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 192 transitions, 877 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-12-11 18:58:58,184 INFO L231 Difference]: Finished difference. Result has 147 places, 140 transitions, 692 flow [2022-12-11 18:58:58,184 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=692, PETRI_PLACES=147, PETRI_TRANSITIONS=140} [2022-12-11 18:58:58,186 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 28 predicate places. [2022-12-11 18:58:58,186 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 140 transitions, 692 flow [2022-12-11 18:58:58,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.14285714285714) internal successors, (596), 7 states have internal predecessors, (596), 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-11 18:58:58,186 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:58:58,186 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] [2022-12-11 18:58:58,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 18:58:58,187 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 18:58:58,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:58:58,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1065412600, now seen corresponding path program 2 times [2022-12-11 18:58:58,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:58:58,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961026969] [2022-12-11 18:58:58,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:58:58,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:58:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:58:58,329 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-11 18:58:58,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:58:58,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961026969] [2022-12-11 18:58:58,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961026969] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:58:58,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:58:58,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 18:58:58,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478058060] [2022-12-11 18:58:58,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:58:58,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 18:58:58,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:58:58,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 18:58:58,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 18:58:58,331 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-12-11 18:58:58,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 140 transitions, 692 flow. Second operand has 7 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 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-11 18:58:58,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:58:58,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-12-11 18:58:58,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:58:59,339 INFO L130 PetriNetUnfolder]: 3515/7178 cut-off events. [2022-12-11 18:58:59,340 INFO L131 PetriNetUnfolder]: For 15295/16441 co-relation queries the response was YES. [2022-12-11 18:58:59,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22574 conditions, 7178 events. 3515/7178 cut-off events. For 15295/16441 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 61831 event pairs, 197 based on Foata normal form. 292/7217 useless extension candidates. Maximal degree in co-relation 22488. Up to 1160 conditions per place. [2022-12-11 18:58:59,381 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 79 selfloop transitions, 32 changer transitions 42/245 dead transitions. [2022-12-11 18:58:59,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 245 transitions, 1634 flow [2022-12-11 18:58:59,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 18:58:59,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 18:58:59,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1289 transitions. [2022-12-11 18:58:59,384 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8697705802968961 [2022-12-11 18:58:59,384 INFO L175 Difference]: Start difference. First operand has 147 places, 140 transitions, 692 flow. Second operand 13 states and 1289 transitions. [2022-12-11 18:58:59,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 245 transitions, 1634 flow [2022-12-11 18:58:59,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 245 transitions, 1608 flow, removed 13 selfloop flow, removed 0 redundant places. [2022-12-11 18:58:59,431 INFO L231 Difference]: Finished difference. Result has 163 places, 149 transitions, 819 flow [2022-12-11 18:58:59,432 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=819, PETRI_PLACES=163, PETRI_TRANSITIONS=149} [2022-12-11 18:58:59,432 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 44 predicate places. [2022-12-11 18:58:59,432 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 149 transitions, 819 flow [2022-12-11 18:58:59,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 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-11 18:58:59,433 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:58:59,433 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] [2022-12-11 18:58:59,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 18:58:59,433 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 18:58:59,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:58:59,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1907267386, now seen corresponding path program 1 times [2022-12-11 18:58:59,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:58:59,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519207476] [2022-12-11 18:58:59,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:58:59,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:58:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:58:59,691 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-11 18:58:59,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:58:59,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519207476] [2022-12-11 18:58:59,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519207476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:58:59,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:58:59,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 18:58:59,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151215678] [2022-12-11 18:58:59,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:58:59,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 18:58:59,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:58:59,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 18:58:59,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-11 18:58:59,697 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-12-11 18:58:59,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 149 transitions, 819 flow. Second operand has 8 states, 8 states have (on average 92.0) internal successors, (736), 8 states have internal predecessors, (736), 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-11 18:58:59,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:58:59,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-12-11 18:58:59,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:59:00,681 INFO L130 PetriNetUnfolder]: 3393/6856 cut-off events. [2022-12-11 18:59:00,681 INFO L131 PetriNetUnfolder]: For 20350/21340 co-relation queries the response was YES. [2022-12-11 18:59:00,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24187 conditions, 6856 events. 3393/6856 cut-off events. For 20350/21340 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 59036 event pairs, 215 based on Foata normal form. 188/6794 useless extension candidates. Maximal degree in co-relation 24153. Up to 1055 conditions per place. [2022-12-11 18:59:00,713 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 67 selfloop transitions, 36 changer transitions 39/234 dead transitions. [2022-12-11 18:59:00,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 234 transitions, 1641 flow [2022-12-11 18:59:00,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 18:59:00,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 18:59:00,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1548 transitions. [2022-12-11 18:59:00,716 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8486842105263158 [2022-12-11 18:59:00,716 INFO L175 Difference]: Start difference. First operand has 163 places, 149 transitions, 819 flow. Second operand 16 states and 1548 transitions. [2022-12-11 18:59:00,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 234 transitions, 1641 flow [2022-12-11 18:59:00,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 234 transitions, 1399 flow, removed 104 selfloop flow, removed 14 redundant places. [2022-12-11 18:59:00,963 INFO L231 Difference]: Finished difference. Result has 165 places, 149 transitions, 775 flow [2022-12-11 18:59:00,963 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=775, PETRI_PLACES=165, PETRI_TRANSITIONS=149} [2022-12-11 18:59:00,963 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 46 predicate places. [2022-12-11 18:59:00,964 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 149 transitions, 775 flow [2022-12-11 18:59:00,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.0) internal successors, (736), 8 states have internal predecessors, (736), 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-11 18:59:00,964 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:59:00,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 18:59:00,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 18:59:00,965 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 18:59:00,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:59:00,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1581948313, now seen corresponding path program 1 times [2022-12-11 18:59:00,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:59:00,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681170239] [2022-12-11 18:59:00,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:59:00,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:59:01,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:59:01,574 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-11 18:59:01,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:59:01,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681170239] [2022-12-11 18:59:01,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681170239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:59:01,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:59:01,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 18:59:01,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028050513] [2022-12-11 18:59:01,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:59:01,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 18:59:01,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:59:01,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 18:59:01,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-11 18:59:01,576 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114 [2022-12-11 18:59:01,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 149 transitions, 775 flow. Second operand has 10 states, 10 states have (on average 89.2) internal successors, (892), 10 states have internal predecessors, (892), 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-11 18:59:01,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:59:01,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114 [2022-12-11 18:59:01,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:59:02,038 INFO L130 PetriNetUnfolder]: 787/3435 cut-off events. [2022-12-11 18:59:02,038 INFO L131 PetriNetUnfolder]: For 6829/7044 co-relation queries the response was YES. [2022-12-11 18:59:02,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10192 conditions, 3435 events. 787/3435 cut-off events. For 6829/7044 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 40559 event pairs, 12 based on Foata normal form. 2/3278 useless extension candidates. Maximal degree in co-relation 10095. Up to 378 conditions per place. [2022-12-11 18:59:02,055 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 34 selfloop transitions, 13 changer transitions 5/177 dead transitions. [2022-12-11 18:59:02,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 177 transitions, 1013 flow [2022-12-11 18:59:02,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 18:59:02,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 18:59:02,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1003 transitions. [2022-12-11 18:59:02,057 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7998405103668261 [2022-12-11 18:59:02,057 INFO L175 Difference]: Start difference. First operand has 165 places, 149 transitions, 775 flow. Second operand 11 states and 1003 transitions. [2022-12-11 18:59:02,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 177 transitions, 1013 flow [2022-12-11 18:59:02,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 177 transitions, 926 flow, removed 19 selfloop flow, removed 14 redundant places. [2022-12-11 18:59:02,135 INFO L231 Difference]: Finished difference. Result has 165 places, 160 transitions, 820 flow [2022-12-11 18:59:02,135 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=820, PETRI_PLACES=165, PETRI_TRANSITIONS=160} [2022-12-11 18:59:02,137 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 46 predicate places. [2022-12-11 18:59:02,137 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 160 transitions, 820 flow [2022-12-11 18:59:02,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.2) internal successors, (892), 10 states have internal predecessors, (892), 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-11 18:59:02,138 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:59:02,138 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, 1, 1, 1] [2022-12-11 18:59:02,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 18:59:02,138 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 18:59:02,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:59:02,139 INFO L85 PathProgramCache]: Analyzing trace with hash -2124883381, now seen corresponding path program 2 times [2022-12-11 18:59:02,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:59:02,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44071909] [2022-12-11 18:59:02,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:59:02,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:59:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:59:02,672 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-11 18:59:02,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:59:02,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44071909] [2022-12-11 18:59:02,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44071909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:59:02,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:59:02,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-11 18:59:02,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803568043] [2022-12-11 18:59:02,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:59:02,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-11 18:59:02,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:59:02,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-11 18:59:02,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-11 18:59:02,675 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 114 [2022-12-11 18:59:02,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 160 transitions, 820 flow. Second operand has 11 states, 11 states have (on average 87.18181818181819) internal successors, (959), 11 states have internal predecessors, (959), 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-11 18:59:02,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:59:02,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 114 [2022-12-11 18:59:02,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:59:03,112 INFO L130 PetriNetUnfolder]: 818/3513 cut-off events. [2022-12-11 18:59:03,112 INFO L131 PetriNetUnfolder]: For 4651/4790 co-relation queries the response was YES. [2022-12-11 18:59:03,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9931 conditions, 3513 events. 818/3513 cut-off events. For 4651/4790 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 41672 event pairs, 15 based on Foata normal form. 16/3332 useless extension candidates. Maximal degree in co-relation 9900. Up to 385 conditions per place. [2022-12-11 18:59:03,131 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 38 selfloop transitions, 13 changer transitions 5/179 dead transitions. [2022-12-11 18:59:03,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 179 transitions, 1038 flow [2022-12-11 18:59:03,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 18:59:03,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 18:59:03,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 977 transitions. [2022-12-11 18:59:03,137 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7791068580542265 [2022-12-11 18:59:03,137 INFO L175 Difference]: Start difference. First operand has 165 places, 160 transitions, 820 flow. Second operand 11 states and 977 transitions. [2022-12-11 18:59:03,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 179 transitions, 1038 flow [2022-12-11 18:59:03,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 179 transitions, 1026 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-11 18:59:03,212 INFO L231 Difference]: Finished difference. Result has 173 places, 163 transitions, 895 flow [2022-12-11 18:59:03,212 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=895, PETRI_PLACES=173, PETRI_TRANSITIONS=163} [2022-12-11 18:59:03,213 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 54 predicate places. [2022-12-11 18:59:03,213 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 163 transitions, 895 flow [2022-12-11 18:59:03,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 87.18181818181819) internal successors, (959), 11 states have internal predecessors, (959), 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-11 18:59:03,213 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:59:03,214 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, 1, 1, 1] [2022-12-11 18:59:03,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 18:59:03,214 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 18:59:03,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:59:03,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1161303243, now seen corresponding path program 3 times [2022-12-11 18:59:03,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:59:03,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265783104] [2022-12-11 18:59:03,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:59:03,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:59:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 18:59:03,244 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 18:59:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 18:59:03,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 18:59:03,314 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 18:59:03,315 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-11 18:59:03,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-11 18:59:03,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-11 18:59:03,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-11 18:59:03,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-11 18:59:03,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-11 18:59:03,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 18:59:03,318 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2022-12-11 18:59:03,323 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 18:59:03,323 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 18:59:03,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 06:59:03 BasicIcfg [2022-12-11 18:59:03,401 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 18:59:03,401 INFO L158 Benchmark]: Toolchain (without parser) took 10484.21ms. Allocated memory was 198.2MB in the beginning and 872.4MB in the end (delta: 674.2MB). Free memory was 173.0MB in the beginning and 505.7MB in the end (delta: -332.8MB). Peak memory consumption was 343.0MB. Max. memory is 8.0GB. [2022-12-11 18:59:03,402 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 198.2MB. Free memory is still 174.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 18:59:03,402 INFO L158 Benchmark]: CACSL2BoogieTranslator took 483.46ms. Allocated memory is still 198.2MB. Free memory was 172.4MB in the beginning and 145.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-11 18:59:03,402 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.29ms. Allocated memory is still 198.2MB. Free memory was 145.2MB in the beginning and 142.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-11 18:59:03,402 INFO L158 Benchmark]: Boogie Preprocessor took 44.33ms. Allocated memory is still 198.2MB. Free memory was 142.6MB in the beginning and 141.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-11 18:59:03,402 INFO L158 Benchmark]: RCFGBuilder took 583.76ms. Allocated memory is still 198.2MB. Free memory was 141.0MB in the beginning and 105.3MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-11 18:59:03,403 INFO L158 Benchmark]: TraceAbstraction took 9332.01ms. Allocated memory was 198.2MB in the beginning and 872.4MB in the end (delta: 674.2MB). Free memory was 104.3MB in the beginning and 505.7MB in the end (delta: -401.4MB). Peak memory consumption was 274.9MB. Max. memory is 8.0GB. [2022-12-11 18:59:03,404 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.12ms. Allocated memory is still 198.2MB. Free memory is still 174.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 483.46ms. Allocated memory is still 198.2MB. Free memory was 172.4MB in the beginning and 145.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.29ms. Allocated memory is still 198.2MB. Free memory was 145.2MB in the beginning and 142.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.33ms. Allocated memory is still 198.2MB. Free memory was 142.6MB in the beginning and 141.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 583.76ms. Allocated memory is still 198.2MB. Free memory was 141.0MB in the beginning and 105.3MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 9332.01ms. Allocated memory was 198.2MB in the beginning and 872.4MB in the end (delta: 674.2MB). Free memory was 104.3MB in the beginning and 505.7MB in the end (delta: -401.4MB). Peak memory consumption was 274.9MB. 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L715] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L717] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L719] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L720] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0] [L721] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L722] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L723] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L724] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L725] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0] [L726] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0] [L727] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L728] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L729] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0] [L730] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0] [L731] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L732] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L733] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L734] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L735] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L736] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L737] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L739] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L741] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L743] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L744] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L745] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L848] 0 pthread_t t281; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t281={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L849] FCALL, FORK 0 pthread_create(&t281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t281, ((void *)0), P0, ((void *)0))=-2, t281={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L850] 0 pthread_t t282; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t281={5:0}, t282={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, z=0] [L851] FCALL, FORK 0 pthread_create(&t282, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t282, ((void *)0), P1, ((void *)0))=-1, t281={5:0}, t282={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t283; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L853] FCALL, FORK 0 pthread_create(&t283, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t283, ((void *)0), P2, ((void *)0))=0, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L784] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L787] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L826] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L866] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 144 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 639 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 639 mSDsluCounter, 500 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 391 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1232 IncrementalHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 109 mSDtfsCounter, 1232 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=895occurred in iteration=9, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 790 NumberOfCodeBlocks, 790 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 691 ConstructedInterpolants, 0 QuantifiedInterpolants, 2799 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-11 18:59:03,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...