java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/SifaC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-584d7b9 [2019-08-31 04:02:27,408 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-31 04:02:27,410 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-31 04:02:27,423 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-31 04:02:27,423 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-31 04:02:27,424 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-31 04:02:27,425 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-31 04:02:27,427 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-31 04:02:27,429 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-31 04:02:27,430 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-31 04:02:27,431 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-08-31 04:02:27,432 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-31 04:02:27,432 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-31 04:02:27,433 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-31 04:02:27,434 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-31 04:02:27,436 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-31 04:02:27,436 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-31 04:02:27,437 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-31 04:02:27,439 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-31 04:02:27,441 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-31 04:02:27,443 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-31 04:02:27,444 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-31 04:02:27,445 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-31 04:02:27,446 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-31 04:02:27,448 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-31 04:02:27,448 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-31 04:02:27,449 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-31 04:02:27,450 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-31 04:02:27,450 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-31 04:02:27,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-31 04:02:27,452 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-31 04:02:27,453 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-31 04:02:27,455 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-31 04:02:27,455 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-31 04:02:27,460 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-31 04:02:27,460 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-31 04:02:27,462 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-31 04:02:27,462 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-31 04:02:27,462 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-31 04:02:27,463 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-31 04:02:27,464 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-31 04:02:27,465 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-08-31 04:02:27,495 INFO L113 SettingsManager]: Loading preferences was successful [2019-08-31 04:02:27,495 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-08-31 04:02:27,498 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-08-31 04:02:27,498 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-08-31 04:02:27,498 INFO L138 SettingsManager]: * Use SBE=true [2019-08-31 04:02:27,498 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-08-31 04:02:27,499 INFO L138 SettingsManager]: * sizeof long=4 [2019-08-31 04:02:27,499 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-08-31 04:02:27,499 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-08-31 04:02:27,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-08-31 04:02:27,500 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-08-31 04:02:27,501 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-08-31 04:02:27,501 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-08-31 04:02:27,501 INFO L138 SettingsManager]: * sizeof long double=12 [2019-08-31 04:02:27,502 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-08-31 04:02:27,502 INFO L138 SettingsManager]: * Use constant arrays=true [2019-08-31 04:02:27,502 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-08-31 04:02:27,502 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-08-31 04:02:27,502 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-08-31 04:02:27,503 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-08-31 04:02:27,503 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-08-31 04:02:27,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-08-31 04:02:27,504 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-08-31 04:02:27,504 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-08-31 04:02:27,504 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-08-31 04:02:27,504 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-08-31 04:02:27,505 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-08-31 04:02:27,505 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-08-31 04:02:27,505 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-08-31 04:02:27,561 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-31 04:02:27,574 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-31 04:02:27,578 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-31 04:02:27,580 INFO L271 PluginConnector]: Initializing CDTParser... [2019-08-31 04:02:27,581 INFO L275 PluginConnector]: CDTParser initialized [2019-08-31 04:02:27,582 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i [2019-08-31 04:02:27,646 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da1f2eb07/60b1942ae8194c59bdce121642b275f5/FLAGe7ae1eca6 [2019-08-31 04:02:28,232 INFO L306 CDTParser]: Found 1 translation units. [2019-08-31 04:02:28,234 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i [2019-08-31 04:02:28,255 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da1f2eb07/60b1942ae8194c59bdce121642b275f5/FLAGe7ae1eca6 [2019-08-31 04:02:28,467 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da1f2eb07/60b1942ae8194c59bdce121642b275f5 [2019-08-31 04:02:28,475 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-31 04:02:28,477 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-31 04:02:28,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-08-31 04:02:28,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-08-31 04:02:28,481 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-08-31 04:02:28,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 04:02:28" (1/1) ... [2019-08-31 04:02:28,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cd3b1d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:02:28, skipping insertion in model container [2019-08-31 04:02:28,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 04:02:28" (1/1) ... [2019-08-31 04:02:28,493 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-08-31 04:02:28,541 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-08-31 04:02:29,112 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-08-31 04:02:29,122 INFO L188 MainTranslator]: Completed pre-run [2019-08-31 04:02:29,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-08-31 04:02:29,280 INFO L192 MainTranslator]: Completed translation [2019-08-31 04:02:29,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:02:29 WrapperNode [2019-08-31 04:02:29,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-08-31 04:02:29,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-31 04:02:29,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-31 04:02:29,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-31 04:02:29,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:02:29" (1/1) ... [2019-08-31 04:02:29,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:02:29" (1/1) ... [2019-08-31 04:02:29,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:02:29" (1/1) ... [2019-08-31 04:02:29,318 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:02:29" (1/1) ... [2019-08-31 04:02:29,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:02:29" (1/1) ... [2019-08-31 04:02:29,356 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:02:29" (1/1) ... [2019-08-31 04:02:29,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:02:29" (1/1) ... [2019-08-31 04:02:29,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-31 04:02:29,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-31 04:02:29,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-31 04:02:29,369 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-31 04:02:29,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:02:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-08-31 04:02:29,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-08-31 04:02:29,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-31 04:02:29,446 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-08-31 04:02:29,446 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-08-31 04:02:29,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-08-31 04:02:29,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2019-08-31 04:02:29,447 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-08-31 04:02:29,447 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-08-31 04:02:29,448 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-08-31 04:02:29,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-08-31 04:02:29,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-08-31 04:02:29,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-08-31 04:02:29,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_empty [2019-08-31 04:02:29,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_set [2019-08-31 04:02:29,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_add [2019-08-31 04:02:29,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_del [2019-08-31 04:02:29,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2019-08-31 04:02:29,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_empty [2019-08-31 04:02:29,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-08-31 04:02:29,454 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2019-08-31 04:02:29,454 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-08-31 04:02:29,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-08-31 04:02:29,454 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-08-31 04:02:29,455 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-31 04:02:29,455 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-08-31 04:02:29,455 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-08-31 04:02:29,455 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-08-31 04:02:29,455 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-08-31 04:02:29,455 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-08-31 04:02:29,456 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-08-31 04:02:29,456 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-08-31 04:02:29,456 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-08-31 04:02:29,456 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-08-31 04:02:29,456 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-08-31 04:02:29,456 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-08-31 04:02:29,457 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-08-31 04:02:29,457 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-08-31 04:02:29,457 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-08-31 04:02:29,457 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-08-31 04:02:29,457 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-08-31 04:02:29,458 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-08-31 04:02:29,458 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-08-31 04:02:29,458 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-08-31 04:02:29,459 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-08-31 04:02:29,459 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-08-31 04:02:29,459 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-08-31 04:02:29,459 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-08-31 04:02:29,459 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-08-31 04:02:29,459 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-08-31 04:02:29,459 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-08-31 04:02:29,460 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-08-31 04:02:29,460 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-08-31 04:02:29,460 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-08-31 04:02:29,460 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-08-31 04:02:29,460 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-08-31 04:02:29,460 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-08-31 04:02:29,460 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-08-31 04:02:29,461 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-08-31 04:02:29,461 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-08-31 04:02:29,461 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-08-31 04:02:29,461 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-08-31 04:02:29,461 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-08-31 04:02:29,461 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-08-31 04:02:29,461 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-08-31 04:02:29,462 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-08-31 04:02:29,462 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-08-31 04:02:29,462 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-08-31 04:02:29,463 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-08-31 04:02:29,464 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-08-31 04:02:29,464 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-08-31 04:02:29,464 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-08-31 04:02:29,464 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-08-31 04:02:29,464 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-08-31 04:02:29,464 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-08-31 04:02:29,465 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-08-31 04:02:29,465 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-08-31 04:02:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-08-31 04:02:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-08-31 04:02:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-08-31 04:02:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-08-31 04:02:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-08-31 04:02:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-08-31 04:02:29,467 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-08-31 04:02:29,467 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-08-31 04:02:29,467 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-08-31 04:02:29,467 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-08-31 04:02:29,468 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-08-31 04:02:29,468 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-08-31 04:02:29,469 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-08-31 04:02:29,469 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-08-31 04:02:29,469 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-08-31 04:02:29,470 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-08-31 04:02:29,470 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-08-31 04:02:29,470 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-08-31 04:02:29,470 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-08-31 04:02:29,470 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-08-31 04:02:29,470 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-08-31 04:02:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-08-31 04:02:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-08-31 04:02:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-08-31 04:02:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-08-31 04:02:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-08-31 04:02:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-08-31 04:02:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-08-31 04:02:29,472 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-08-31 04:02:29,472 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-08-31 04:02:29,472 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-08-31 04:02:29,472 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-08-31 04:02:29,472 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-08-31 04:02:29,472 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-08-31 04:02:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-08-31 04:02:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-08-31 04:02:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-08-31 04:02:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-08-31 04:02:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-08-31 04:02:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-08-31 04:02:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-08-31 04:02:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-08-31 04:02:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-08-31 04:02:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-08-31 04:02:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-08-31 04:02:29,475 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-08-31 04:02:29,475 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-08-31 04:02:29,475 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-08-31 04:02:29,476 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-08-31 04:02:29,476 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-08-31 04:02:29,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-08-31 04:02:29,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-08-31 04:02:29,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-08-31 04:02:29,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-08-31 04:02:29,476 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-08-31 04:02:29,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-08-31 04:02:29,477 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2019-08-31 04:02:29,477 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-08-31 04:02:29,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-08-31 04:02:29,478 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-08-31 04:02:29,478 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-08-31 04:02:29,478 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-08-31 04:02:29,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-08-31 04:02:29,479 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-08-31 04:02:29,482 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-08-31 04:02:29,483 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_empty [2019-08-31 04:02:29,483 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_set [2019-08-31 04:02:29,484 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_add [2019-08-31 04:02:29,491 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_del [2019-08-31 04:02:29,491 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2019-08-31 04:02:29,491 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_empty [2019-08-31 04:02:29,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-08-31 04:02:29,492 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-08-31 04:02:29,492 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2019-08-31 04:02:29,492 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-08-31 04:02:29,493 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-08-31 04:02:29,493 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-08-31 04:02:29,493 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-31 04:02:29,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-08-31 04:02:29,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-08-31 04:02:29,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-08-31 04:02:29,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-31 04:02:30,209 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-31 04:02:30,210 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-08-31 04:02:30,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 04:02:30 BoogieIcfgContainer [2019-08-31 04:02:30,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-31 04:02:30,212 INFO L113 PluginConnector]: ------------------------Sifa---------------------------- [2019-08-31 04:02:30,212 INFO L271 PluginConnector]: Initializing Sifa... [2019-08-31 04:02:30,212 INFO L275 PluginConnector]: Sifa initialized [2019-08-31 04:02:30,214 INFO L185 PluginConnector]: Executing the observer SifaObserver from plugin Sifa for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 04:02:30" (1/1) ... [2019-08-31 04:02:30,253 INFO L162 IcfgInterpreter]: Started Sifa with 3 locations of interest [2019-08-31 04:02:30,253 INFO L169 IcfgInterpreter]: Building call graph [2019-08-31 04:02:30,262 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-08-31 04:02:30,271 INFO L179 IcfgInterpreter]: Starting interpretation [2019-08-31 04:02:30,273 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-08-31 04:02:30,363 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_25|], 3=[|v_#valid_34|]} [2019-08-31 04:02:30,386 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-31 04:02:30,387 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:30,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:30,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 04:02:30,451 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2019-08-31 04:02:30,451 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:30,554 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-08-31 04:02:30,554 INFO L567 ElimStorePlain]: treesize reduction 4, result has 93.8 percent of original size [2019-08-31 04:02:30,557 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-31 04:02:30,557 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:60 [2019-08-31 04:02:30,588 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 49 for LOIs [2019-08-31 04:02:30,611 INFO L199 IcfgInterpreter]: Interpreting procedure foo with input of size 49 for LOIs [2019-08-31 04:02:30,652 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_26|], 1=[|v_#valid_35|]} [2019-08-31 04:02:30,666 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2019-08-31 04:02:30,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:30,676 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-08-31 04:02:30,676 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:30,746 INFO L567 ElimStorePlain]: treesize reduction 4, result has 91.3 percent of original size [2019-08-31 04:02:30,753 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-08-31 04:02:30,753 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:30,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:30,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-31 04:02:30,780 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:95, output treesize:36 [2019-08-31 04:02:30,825 INFO L392 ElimStorePlain]: Different costs {0=[|v_old(#length)_BEFORE_CALL_4|], 1=[|v_old(#valid)_BEFORE_CALL_4|]} [2019-08-31 04:02:30,839 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-08-31 04:02:30,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:30,964 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-08-31 04:02:30,965 INFO L567 ElimStorePlain]: treesize reduction 15, result has 84.8 percent of original size [2019-08-31 04:02:30,985 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:30,986 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-08-31 04:02:30,987 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:31,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:31,051 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 04:02:31,052 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:104, output treesize:78 [2019-08-31 04:02:31,080 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-08-31 04:02:31,081 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:31,256 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-08-31 04:02:31,257 INFO L567 ElimStorePlain]: treesize reduction 15, result has 88.0 percent of original size [2019-08-31 04:02:31,266 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-08-31 04:02:31,267 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:31,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:31,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-31 04:02:31,342 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:130, output treesize:105 [2019-08-31 04:02:31,366 INFO L392 ElimStorePlain]: Different costs {0=[|v_old(#length)_BEFORE_CALL_5|], 1=[|v_old(#valid)_BEFORE_CALL_5|]} [2019-08-31 04:02:31,374 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-08-31 04:02:31,375 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:31,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:31,460 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:31,461 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-08-31 04:02:31,462 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:31,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:31,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 04:02:31,548 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:105, output treesize:94 [2019-08-31 04:02:31,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 04:02:31,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-31 04:02:31,812 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-08-31 04:02:31,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:31,844 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:31,850 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-08-31 04:02:31,851 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:31,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:31,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-31 04:02:31,873 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:47 [2019-08-31 04:02:31,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 04:02:32,129 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-08-31 04:02:32,129 INFO L341 Elim1Store]: treesize reduction 100, result has 50.2 percent of original size [2019-08-31 04:02:32,130 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 108 [2019-08-31 04:02:32,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:32,354 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-08-31 04:02:32,355 INFO L567 ElimStorePlain]: treesize reduction 36, result has 82.3 percent of original size [2019-08-31 04:02:32,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 04:02:32,517 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 31 [2019-08-31 04:02:32,518 INFO L341 Elim1Store]: treesize reduction 139, result has 30.8 percent of original size [2019-08-31 04:02:32,519 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 69 [2019-08-31 04:02:32,519 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:32,685 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-08-31 04:02:32,686 INFO L567 ElimStorePlain]: treesize reduction 16, result has 89.9 percent of original size [2019-08-31 04:02:32,687 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-31 04:02:32,688 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:173, output treesize:142 [2019-08-31 04:02:32,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-08-31 04:02:32,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:32,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:32,726 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-08-31 04:02:32,727 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:32,734 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:32,734 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-31 04:02:32,735 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-08-31 04:02:32,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-08-31 04:02:32,749 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:32,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:32,804 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-08-31 04:02:32,805 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:32,822 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:32,822 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-31 04:02:32,823 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:33 [2019-08-31 04:02:32,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-31 04:02:32,846 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-08-31 04:02:32,847 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:32,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:32,904 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-08-31 04:02:32,904 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:32,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:32,963 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-31 04:02:32,963 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:89 [2019-08-31 04:02:32,972 INFO L392 ElimStorePlain]: Different costs {0=[|v_old(#length)_BEFORE_CALL_6|], 1=[|v_old(#valid)_BEFORE_CALL_6|]} [2019-08-31 04:02:32,978 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-08-31 04:02:32,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:33,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:33,034 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:33,035 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-08-31 04:02:33,036 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:33,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:33,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 04:02:33,085 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2019-08-31 04:02:33,086 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:33,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:33,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 04:02:33,138 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2019-08-31 04:02:33,139 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:33,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:33,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-31 04:02:33,169 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:88, output treesize:45 [2019-08-31 04:02:33,176 INFO L392 ElimStorePlain]: Different costs {0=[|v_old(#length)_BEFORE_CALL_7|], 1=[|v_old(#valid)_BEFORE_CALL_7|]} [2019-08-31 04:02:33,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-08-31 04:02:33,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:33,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:33,243 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:33,243 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-08-31 04:02:33,244 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:33,284 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:33,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 04:02:33,297 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2019-08-31 04:02:33,298 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:33,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:33,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 04:02:33,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2019-08-31 04:02:33,346 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:33,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:33,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-31 04:02:33,378 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:88, output treesize:45 [2019-08-31 04:02:33,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-31 04:02:33,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 04:02:33,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 04:02:33,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 04:02:33,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 04:02:33,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 04:02:33,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 04:02:33,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 04:02:33,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 04:02:33,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 04:02:33,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 04:02:33,501 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:33,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 47 [2019-08-31 04:02:33,503 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:33,566 INFO L567 ElimStorePlain]: treesize reduction 20, result has 77.8 percent of original size [2019-08-31 04:02:33,591 INFO L341 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2019-08-31 04:02:33,592 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 17 [2019-08-31 04:02:33,593 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:33,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:33,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-31 04:02:33,617 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:55 [2019-08-31 04:02:33,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 04:02:33,633 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 77 [2019-08-31 04:02:33,634 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:33,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 04:02:33,642 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 76 [2019-08-31 04:02:33,643 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:33,789 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-08-31 04:02:33,790 INFO L567 ElimStorePlain]: treesize reduction 17, result has 88.0 percent of original size [2019-08-31 04:02:33,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 04:02:33,804 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2019-08-31 04:02:33,805 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:33,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 04:02:33,811 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 61 [2019-08-31 04:02:33,813 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:33,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:33,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-08-31 04:02:33,855 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:174, output treesize:93 [2019-08-31 04:02:33,880 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2019-08-31 04:02:33,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:33,891 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2019-08-31 04:02:33,892 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:33,905 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2019-08-31 04:02:33,906 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:33,913 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2019-08-31 04:02:33,914 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:33,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:34,008 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2019-08-31 04:02:34,009 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:34,016 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2019-08-31 04:02:34,017 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:34,024 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2019-08-31 04:02:34,024 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:34,030 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2019-08-31 04:02:34,031 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:34,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:34,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-08-31 04:02:34,101 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:181, output treesize:125 [2019-08-31 04:02:34,122 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2019-08-31 04:02:34,125 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:34,136 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-08-31 04:02:34,137 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:34,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-08-31 04:02:34,151 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:34,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2019-08-31 04:02:34,165 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:34,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:34,239 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-08-31 04:02:34,240 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:149, output treesize:145 [2019-08-31 04:02:34,363 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2019-08-31 04:02:34,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:34,373 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-08-31 04:02:34,374 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:34,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:34,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-08-31 04:02:34,407 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:65, output treesize:63 [2019-08-31 04:02:34,505 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-08-31 04:02:34,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:34,516 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2019-08-31 04:02:34,516 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:34,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:34,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-08-31 04:02:34,545 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:65, output treesize:63 [2019-08-31 04:02:34,605 INFO L392 ElimStorePlain]: Different costs {0=[|v_old(#length)_BEFORE_CALL_8|], 1=[|v_old(#valid)_BEFORE_CALL_8|]} [2019-08-31 04:02:34,611 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-08-31 04:02:34,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:34,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:34,667 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:34,668 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-08-31 04:02:34,669 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:34,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:34,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 04:02:34,719 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2019-08-31 04:02:34,720 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:34,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:34,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 04:02:34,760 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2019-08-31 04:02:34,760 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:34,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:34,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-31 04:02:34,787 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:85, output treesize:42 [2019-08-31 04:02:34,791 INFO L392 ElimStorePlain]: Different costs {0=[|v_old(#length)_BEFORE_CALL_9|], 1=[|v_old(#valid)_BEFORE_CALL_9|]} [2019-08-31 04:02:34,795 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-08-31 04:02:34,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:34,820 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:34,829 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:34,830 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-08-31 04:02:34,830 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:34,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:34,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 04:02:34,858 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2019-08-31 04:02:34,859 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:34,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:34,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 04:02:34,882 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2019-08-31 04:02:34,883 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:34,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:34,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-31 04:02:34,903 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:23 [2019-08-31 04:02:34,912 INFO L392 ElimStorePlain]: Different costs {0=[|v_old(#length)_BEFORE_CALL_10|], 1=[|v_old(#valid)_BEFORE_CALL_10|]} [2019-08-31 04:02:34,918 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-08-31 04:02:34,918 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:34,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:34,976 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:34,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-08-31 04:02:34,977 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:35,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:35,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 04:02:35,030 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2019-08-31 04:02:35,030 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:35,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:35,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 04:02:35,083 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2019-08-31 04:02:35,083 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:35,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:35,136 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-31 04:02:35,137 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:85, output treesize:42 [2019-08-31 04:02:35,140 INFO L392 ElimStorePlain]: Different costs {0=[|v_old(#length)_BEFORE_CALL_11|], 1=[|v_old(#valid)_BEFORE_CALL_11|]} [2019-08-31 04:02:35,145 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-08-31 04:02:35,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:35,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:35,192 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:35,193 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-08-31 04:02:35,193 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:35,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:35,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 04:02:35,240 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2019-08-31 04:02:35,240 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:35,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:35,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 04:02:35,280 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2019-08-31 04:02:35,280 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:35,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:35,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-31 04:02:35,308 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:88, output treesize:45 [2019-08-31 04:02:35,315 INFO L392 ElimStorePlain]: Different costs {0=[|v_old(#length)_BEFORE_CALL_12|], 1=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-08-31 04:02:35,321 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-08-31 04:02:35,322 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:35,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:35,376 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:35,377 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-08-31 04:02:35,377 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:35,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:35,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 04:02:35,425 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2019-08-31 04:02:35,426 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:35,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:35,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 04:02:35,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2019-08-31 04:02:35,471 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:35,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:35,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-31 04:02:35,501 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:88, output treesize:45 [2019-08-31 04:02:35,505 INFO L392 ElimStorePlain]: Different costs {0=[|v_old(#length)_BEFORE_CALL_13|], 1=[|v_old(#valid)_BEFORE_CALL_13|]} [2019-08-31 04:02:35,511 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-08-31 04:02:35,511 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:35,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:35,574 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:35,575 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-08-31 04:02:35,575 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-31 04:02:35,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 04:02:35,626 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 04:02:35,627 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:105, output treesize:94 [2019-08-31 04:02:35,628 INFO L199 IcfgInterpreter]: Interpreting procedure mutex_lock with input of size 58 for LOIs [2019-08-31 04:02:35,647 INFO L199 IcfgInterpreter]: Interpreting procedure ldv_check_final_state with input of size 15 for LOIs [2019-08-31 04:02:35,657 INFO L199 IcfgInterpreter]: Interpreting procedure mutex_unlock with input of size 37 for LOIs [2019-08-31 04:02:35,668 INFO L183 IcfgInterpreter]: Interpretation finished [2019-08-31 04:02:35,668 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-08-31 04:02:35,670 INFO L193 IcfgInterpreter]: Reachable states at location mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 382#(and (<= 0 mutex_unlock_~m.offset) (<= |#NULL.base| 0) (<= |mutex_unlock_#in~m.offset| 0) (or (and (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |~#mutexes~0.offset| 0) (= |mutex_unlock_#in~m.offset| 0) (<= 0 |~#mutexes~0.offset|) (< |#StackHeapBarrier| |mutex_unlock_#in~m.base|) (< |~#mutexes~0.base| |#StackHeapBarrier|) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (not (= |~#mutexes~0.base| 0)) (= |#NULL.offset| 0) (not (= 0 |mutex_unlock_#in~m.base|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (<= |#NULL.base| 0) (<= |mutex_unlock_#in~m.offset| 0) (<= 0 |#NULL.base|) (<= |~#mutexes~0.offset| 0) (< |#StackHeapBarrier| |mutex_unlock_#in~m.base|) (<= 0 |~#mutexes~0.offset|) (< |~#mutexes~0.base| |#StackHeapBarrier|) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (not (= |~#mutexes~0.base| 0)) (= |#NULL.offset| 0) (<= 0 |mutex_unlock_#in~m.offset|) (not (= 0 |mutex_unlock_#in~m.base|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (<= 0 |#NULL.base|) (<= mutex_unlock_~m.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |~#mutexes~0.offset| 0) (<= 0 |~#mutexes~0.offset|) (= |mutex_unlock_#in~m.offset| mutex_unlock_~m.offset) (= mutex_unlock_~m.base |mutex_unlock_#in~m.base|) (<= 0 |mutex_unlock_#in~m.offset|)) [2019-08-31 04:02:35,671 INFO L193 IcfgInterpreter]: Reachable states at location mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 348#(exists ((v_prenex_78 Int) (v_foo_~m2~0.base_BEFORE_CALL_9 Int) (v_prenex_76 Int)) (or (and (= |mutex_lock_#in~m.offset| mutex_lock_~m.offset) (<= |#NULL.base| 0) (= |~#mutexes~0.offset| (select (select |old(#memory_$Pointer$.offset)| |~#mutexes~0.base|) (+ |~#mutexes~0.offset| 4))) (= |~#mutexes~0.base| (select (select |old(#memory_$Pointer$.base)| |~#mutexes~0.base|) (+ |~#mutexes~0.offset| 4))) (<= 0 |#NULL.base|) (= |~#mutexes~0.base| (select (select |old(#memory_$Pointer$.base)| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (< |#StackHeapBarrier| |mutex_lock_#in~m.base|) (<= |~#mutexes~0.offset| 0) (= |mutex_lock_#in~m.offset| 0) (= 8 (select |old(#length)| v_prenex_76)) (<= 0 |~#mutexes~0.offset|) (< |#StackHeapBarrier| v_prenex_76) (= |mutex_lock_#in~m.base| mutex_lock_~m.base) (< |~#mutexes~0.base| |#StackHeapBarrier|) (not (= 0 v_prenex_76)) (= |#valid| |old(#valid)|) (= (select |old(#valid)| v_prenex_76) 1) (not (= |~#mutexes~0.base| 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (not (= |mutex_lock_#in~m.base| 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#mutexes~0.offset| (select (select |old(#memory_$Pointer$.offset)| |~#mutexes~0.base|) |~#mutexes~0.offset|))) (and (< |#StackHeapBarrier| v_prenex_78) (= 8 (select |old(#length)| v_prenex_78)) (= |~#mutexes~0.offset| (select (select |old(#memory_$Pointer$.offset)| |~#mutexes~0.base|) (+ |~#mutexes~0.offset| 4))) (= |~#mutexes~0.base| (select (select |old(#memory_$Pointer$.base)| |~#mutexes~0.base|) (+ |~#mutexes~0.offset| 4))) (<= 0 |#NULL.base|) (< |#StackHeapBarrier| |mutex_lock_#in~m.base|) (= |mutex_lock_#in~m.base| mutex_lock_~m.base) (< |~#mutexes~0.base| |#StackHeapBarrier|) (not (= |~#mutexes~0.base| 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (not (= |mutex_lock_#in~m.base| 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (not (= 0 v_prenex_78)) (= (select |old(#valid)| v_prenex_78) 1) (= |mutex_lock_#in~m.offset| mutex_lock_~m.offset) (= mutex_lock_~m.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|) (- 4)))) (<= |#NULL.base| 0) (= |~#mutexes~0.base| (select (select |old(#memory_$Pointer$.base)| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|) (- 4))) mutex_lock_~m.offset) (<= |~#mutexes~0.offset| 0) (= |mutex_lock_#in~m.offset| 0) (<= 0 |~#mutexes~0.offset|) (= |#valid| |old(#valid)|) (not (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))) (= |#NULL.offset| 0) (= |~#mutexes~0.offset| (select (select |old(#memory_$Pointer$.offset)| |~#mutexes~0.base|) |~#mutexes~0.offset|))) (and (= |~#mutexes~0.offset| (select (select |old(#memory_$Pointer$.offset)| |~#mutexes~0.base|) (+ |~#mutexes~0.offset| 4))) (= |~#mutexes~0.base| (select (select |old(#memory_$Pointer$.base)| |~#mutexes~0.base|) (+ |~#mutexes~0.offset| 4))) (<= 0 |#NULL.base|) (< |#StackHeapBarrier| v_foo_~m2~0.base_BEFORE_CALL_9) (< |#StackHeapBarrier| |mutex_lock_#in~m.base|) (= |mutex_lock_#in~m.base| mutex_lock_~m.base) (< |~#mutexes~0.base| |#StackHeapBarrier|) (not (= |~#mutexes~0.base| 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 8 (select |old(#length)| v_foo_~m2~0.base_BEFORE_CALL_9)) (= |old(#length)| |#length|) (not (= |mutex_lock_#in~m.base| 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= mutex_lock_~m.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|) (- 4)))) (= |mutex_lock_#in~m.offset| mutex_lock_~m.offset) (<= |#NULL.base| 0) (not (= 0 v_foo_~m2~0.base_BEFORE_CALL_9)) (= |~#mutexes~0.base| (select (select |old(#memory_$Pointer$.base)| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|) (- 4))) mutex_lock_~m.offset) (not (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|))) (<= |~#mutexes~0.offset| 0) (= (select |old(#valid)| v_foo_~m2~0.base_BEFORE_CALL_9) 1) (= |mutex_lock_#in~m.offset| 0) (<= 0 |~#mutexes~0.offset|) (= |#valid| |old(#valid)|) (= |#NULL.offset| 0) (= |~#mutexes~0.offset| (select (select |old(#memory_$Pointer$.offset)| |~#mutexes~0.base|) |~#mutexes~0.offset|))) (and (= |mutex_lock_#in~m.offset| mutex_lock_~m.offset) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (< |#StackHeapBarrier| |mutex_lock_#in~m.base|) (<= |~#mutexes~0.offset| 0) (= |mutex_lock_#in~m.offset| 0) (<= 0 |~#mutexes~0.offset|) (= |mutex_lock_#in~m.base| mutex_lock_~m.base) (< |~#mutexes~0.base| |#StackHeapBarrier|) (= |#valid| |old(#valid)|) (not (= |~#mutexes~0.base| 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (not (= |mutex_lock_#in~m.base| 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= |mutex_lock_#in~m.offset| mutex_lock_~m.offset) (= mutex_lock_~m.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|) (- 4)))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (< |#StackHeapBarrier| |mutex_lock_#in~m.base|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|) (- 4))) mutex_lock_~m.offset) (<= |~#mutexes~0.offset| 0) (= |mutex_lock_#in~m.offset| 0) (<= 0 |~#mutexes~0.offset|) (= |mutex_lock_#in~m.base| mutex_lock_~m.base) (< |~#mutexes~0.base| |#StackHeapBarrier|) (= |#valid| |old(#valid)|) (not (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))) (not (= |~#mutexes~0.base| 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (not (= |mutex_lock_#in~m.base| 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= mutex_lock_~m.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|) (- 4)))) (= |mutex_lock_#in~m.offset| mutex_lock_~m.offset) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|) (- 4))) mutex_lock_~m.offset) (< |#StackHeapBarrier| |mutex_lock_#in~m.base|) (not (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|))) (<= |~#mutexes~0.offset| 0) (= |mutex_lock_#in~m.offset| 0) (<= 0 |~#mutexes~0.offset|) (= |mutex_lock_#in~m.base| mutex_lock_~m.base) (< |~#mutexes~0.base| |#StackHeapBarrier|) (= |#valid| |old(#valid)|) (not (= |~#mutexes~0.base| 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (not (= |mutex_lock_#in~m.base| 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))) [2019-08-31 04:02:35,671 INFO L193 IcfgInterpreter]: Reachable states at location ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 372#(and (<= 0 |~#mutexes~0.offset|) (<= |#NULL.base| 0) (< |~#mutexes~0.base| |#StackHeapBarrier|) (or (not (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))) (not (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))) (<= 0 |#NULL.base|) (not (= |~#mutexes~0.base| 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |~#mutexes~0.offset| 0)) [2019-08-31 04:02:35,690 INFO L103 SifaObserver]: ✘ Some error locations might be reachable, see reported results. [2019-08-31 04:02:35,691 INFO L132 PluginConnector]: ------------------------ END Sifa---------------------------- [2019-08-31 04:02:35,692 INFO L168 Benchmark]: Toolchain (without parser) took 7215.80 ms. Allocated memory was 141.0 MB in the beginning and 292.6 MB in the end (delta: 151.5 MB). Free memory was 87.2 MB in the beginning and 152.8 MB in the end (delta: -65.6 MB). Peak memory consumption was 85.9 MB. Max. memory is 7.1 GB. [2019-08-31 04:02:35,693 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 141.0 MB. Free memory was 107.1 MB in the beginning and 106.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-08-31 04:02:35,693 INFO L168 Benchmark]: CACSL2BoogieTranslator took 804.25 ms. Allocated memory was 141.0 MB in the beginning and 204.5 MB in the end (delta: 63.4 MB). Free memory was 86.9 MB in the beginning and 163.8 MB in the end (delta: -76.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-08-31 04:02:35,694 INFO L168 Benchmark]: Boogie Preprocessor took 86.50 ms. Allocated memory is still 204.5 MB. Free memory was 163.8 MB in the beginning and 160.2 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. [2019-08-31 04:02:35,694 INFO L168 Benchmark]: RCFGBuilder took 842.41 ms. Allocated memory is still 204.5 MB. Free memory was 160.2 MB in the beginning and 102.2 MB in the end (delta: 58.0 MB). Peak memory consumption was 58.0 MB. Max. memory is 7.1 GB. [2019-08-31 04:02:35,695 INFO L168 Benchmark]: Sifa took 5478.98 ms. Allocated memory was 204.5 MB in the beginning and 292.6 MB in the end (delta: 88.1 MB). Free memory was 102.2 MB in the beginning and 152.8 MB in the end (delta: -50.6 MB). Peak memory consumption was 37.5 MB. Max. memory is 7.1 GB. [2019-08-31 04:02:35,696 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 141.0 MB. Free memory was 107.1 MB in the beginning and 106.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 804.25 ms. Allocated memory was 141.0 MB in the beginning and 204.5 MB in the end (delta: 63.4 MB). Free memory was 86.9 MB in the beginning and 163.8 MB in the end (delta: -76.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 86.50 ms. Allocated memory is still 204.5 MB. Free memory was 163.8 MB in the beginning and 160.2 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 842.41 ms. Allocated memory is still 204.5 MB. Free memory was 160.2 MB in the beginning and 102.2 MB in the end (delta: 58.0 MB). Peak memory consumption was 58.0 MB. Max. memory is 7.1 GB. * Sifa took 5478.98 ms. Allocated memory was 204.5 MB in the beginning and 292.6 MB in the end (delta: 88.1 MB). Free memory was 102.2 MB in the beginning and 152.8 MB in the end (delta: -50.6 MB). Peak memory consumption was 37.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.sifa: - StatisticsResult: Symbolic Interpretation with Fluid Abstractions 5.4s OVERALL_TIME, 6 ICFG_INTERPRETER_ENTERED_PROCEDURES, 146 DAG_INTERPRETER_EARLY_EXIT_QUERIES, 0 DAG_INTERPRETER_EARLY_EXITS, 107 TOOLS_POST_APPLICATIONS, 1.9s TOOLS_POST_TIME, 31 TOOLS_POST_CALL_APPLICATIONS, 2.0s TOOLS_POST_CALL_TIME, 24 TOOLS_POST_RETURN_APPLICATIONS, 1.1s TOOLS_POST_RETURN_TIME, 4.9s TOOLS_QUANTIFIERELIM_TIME, 0.0s FLUID_QUERY_TIME, 158 FLUID_QUERIES, 4 FLUID_YES_ANSWERS, 41 DOMAIN_JOIN_APPLICATIONS, 0.1s DOMAIN_JOIN_TIME, 4 DOMAIN_ALPHA_APPLICATIONS, 0.0s DOMAIN_ALPHA_TIME, 6 DOMAIN_WIDEN_APPLICATIONS, 0.1s DOMAIN_WIDEN_TIME, 12 DOMAIN_ISSUBSETEQ_APPLICATIONS, 0.1s DOMAIN_ISSUBSETEQ_TIME, 12 DOMAIN_ISBOTTOM_APPLICATIONS, 0.0s DOMAIN_ISBOTTOM_TIME, 6 LOOP_SUMMARIZER_APPLICATIONS, 6 LOOP_SUMMARIZER_CACHE_MISSES, 1.3s LOOP_SUMMARIZER_OVERALL_TIME, 1.3s LOOP_SUMMARIZER_NEW_COMPUTATION_TIME, 12 LOOP_SUMMARIZER_FIXPOINT_ITERATIONS, 24 CALL_SUMMARIZER_APPLICATIONS, 14 CALL_SUMMARIZER_CACHE_MISSES, 2.9s CALL_SUMMARIZER_OVERALL_TIME, 2.9s CALL_SUMMARIZER_NEW_COMPUTATION_TIME, 0.0s PROCEDURE_GRAPH_BUILDER_TIME, 0.0s PATH_EXPR_TIME, 0.0s REGEX_TO_DAG_TIME, 0.0s DAG_COMPRESSION_TIME, 265 DAG_COMPRESSION_PROCESSED_NODES, 150 DAG_COMPRESSION_RETAINED_NODES - UnprovableResult [Line: 660]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 382#(and (<= 0 mutex_unlock_~m.offset) (<= |#NULL.base| 0) (<= |mutex_unlock_#in~m.offset| 0) (or (and (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |~#mutexes~0.offset| 0) (= |mutex_unlock_#in~m.offset| 0) (<= 0 |~#mutexes~0.offset|) (< |#StackHeapBarrier| |mutex_unlock_#in~m.base|) (< |~#mutexes~0.base| |#StackHeapBarrier|) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (not (= |~#mutexes~0.base| 0)) (= |#NULL.offset| 0) (not (= 0 |mutex_unlock_#in~m.base|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (<= |#NULL.base| 0) (<= |mutex_unlock_#in~m.offset| 0) (<= 0 |#NULL.base|) (<= |~#mutexes~0.offset| 0) (< |#StackHeapBarrier| |mutex_unlock_#in~m.base|) (<= 0 |~#mutexes~0.offset|) (< |~#mutexes~0.base| |#StackHeapBarrier|) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (not (= |~#mutexes~0.base| 0)) (= |#NULL.offset| 0) (<= 0 |mutex_unlock_#in~m.offset|) (not (= 0 |mutex_unlock_#in~m.base|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (<= 0 |#NULL.base|) (<= mutex_unlock_~m.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |~#mutexes~0.offset| 0) (<= 0 |~#mutexes~0.offset|) (= |mutex_unlock_#in~m.offset| mutex_unlock_~m.offset) (= mutex_unlock_~m.base |mutex_unlock_#in~m.base|) (<= 0 |mutex_unlock_#in~m.offset|)). Possible FailurePath: - UnprovableResult [Line: 656]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 348#(exists ((v_prenex_78 Int) (v_foo_~m2~0.base_BEFORE_CALL_9 Int) (v_prenex_76 Int)) (or (and (= |mutex_lock_#in~m.offset| mutex_lock_~m.offset) (<= |#NULL.base| 0) (= |~#mutexes~0.offset| (select (select |old(#memory_$Pointer$.offset)| |~#mutexes~0.base|) (+ |~#mutexes~0.offset| 4))) (= |~#mutexes~0.base| (select (select |old(#memory_$Pointer$.base)| |~#mutexes~0.base|) (+ |~#mutexes~0.offset| 4))) (<= 0 |#NULL.base|) (= |~#mutexes~0.base| (select (select |old(#memory_$Pointer$.base)| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (< |#StackHeapBarrier| |mutex_lock_#in~m.base|) (<= |~#mutexes~0.offset| 0) (= |mutex_lock_#in~m.offset| 0) (= 8 (select |old(#length)| v_prenex_76)) (<= 0 |~#mutexes~0.offset|) (< |#StackHeapBarrier| v_prenex_76) (= |mutex_lock_#in~m.base| mutex_lock_~m.base) (< |~#mutexes~0.base| |#StackHeapBarrier|) (not (= 0 v_prenex_76)) (= |#valid| |old(#valid)|) (= (select |old(#valid)| v_prenex_76) 1) (not (= |~#mutexes~0.base| 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (not (= |mutex_lock_#in~m.base| 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#mutexes~0.offset| (select (select |old(#memory_$Pointer$.offset)| |~#mutexes~0.base|) |~#mutexes~0.offset|))) (and (< |#StackHeapBarrier| v_prenex_78) (= 8 (select |old(#length)| v_prenex_78)) (= |~#mutexes~0.offset| (select (select |old(#memory_$Pointer$.offset)| |~#mutexes~0.base|) (+ |~#mutexes~0.offset| 4))) (= |~#mutexes~0.base| (select (select |old(#memory_$Pointer$.base)| |~#mutexes~0.base|) (+ |~#mutexes~0.offset| 4))) (<= 0 |#NULL.base|) (< |#StackHeapBarrier| |mutex_lock_#in~m.base|) (= |mutex_lock_#in~m.base| mutex_lock_~m.base) (< |~#mutexes~0.base| |#StackHeapBarrier|) (not (= |~#mutexes~0.base| 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (not (= |mutex_lock_#in~m.base| 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (not (= 0 v_prenex_78)) (= (select |old(#valid)| v_prenex_78) 1) (= |mutex_lock_#in~m.offset| mutex_lock_~m.offset) (= mutex_lock_~m.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|) (- 4)))) (<= |#NULL.base| 0) (= |~#mutexes~0.base| (select (select |old(#memory_$Pointer$.base)| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|) (- 4))) mutex_lock_~m.offset) (<= |~#mutexes~0.offset| 0) (= |mutex_lock_#in~m.offset| 0) (<= 0 |~#mutexes~0.offset|) (= |#valid| |old(#valid)|) (not (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))) (= |#NULL.offset| 0) (= |~#mutexes~0.offset| (select (select |old(#memory_$Pointer$.offset)| |~#mutexes~0.base|) |~#mutexes~0.offset|))) (and (= |~#mutexes~0.offset| (select (select |old(#memory_$Pointer$.offset)| |~#mutexes~0.base|) (+ |~#mutexes~0.offset| 4))) (= |~#mutexes~0.base| (select (select |old(#memory_$Pointer$.base)| |~#mutexes~0.base|) (+ |~#mutexes~0.offset| 4))) (<= 0 |#NULL.base|) (< |#StackHeapBarrier| v_foo_~m2~0.base_BEFORE_CALL_9) (< |#StackHeapBarrier| |mutex_lock_#in~m.base|) (= |mutex_lock_#in~m.base| mutex_lock_~m.base) (< |~#mutexes~0.base| |#StackHeapBarrier|) (not (= |~#mutexes~0.base| 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 8 (select |old(#length)| v_foo_~m2~0.base_BEFORE_CALL_9)) (= |old(#length)| |#length|) (not (= |mutex_lock_#in~m.base| 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= mutex_lock_~m.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|) (- 4)))) (= |mutex_lock_#in~m.offset| mutex_lock_~m.offset) (<= |#NULL.base| 0) (not (= 0 v_foo_~m2~0.base_BEFORE_CALL_9)) (= |~#mutexes~0.base| (select (select |old(#memory_$Pointer$.base)| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|) (- 4))) mutex_lock_~m.offset) (not (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|))) (<= |~#mutexes~0.offset| 0) (= (select |old(#valid)| v_foo_~m2~0.base_BEFORE_CALL_9) 1) (= |mutex_lock_#in~m.offset| 0) (<= 0 |~#mutexes~0.offset|) (= |#valid| |old(#valid)|) (= |#NULL.offset| 0) (= |~#mutexes~0.offset| (select (select |old(#memory_$Pointer$.offset)| |~#mutexes~0.base|) |~#mutexes~0.offset|))) (and (= |mutex_lock_#in~m.offset| mutex_lock_~m.offset) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (< |#StackHeapBarrier| |mutex_lock_#in~m.base|) (<= |~#mutexes~0.offset| 0) (= |mutex_lock_#in~m.offset| 0) (<= 0 |~#mutexes~0.offset|) (= |mutex_lock_#in~m.base| mutex_lock_~m.base) (< |~#mutexes~0.base| |#StackHeapBarrier|) (= |#valid| |old(#valid)|) (not (= |~#mutexes~0.base| 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (not (= |mutex_lock_#in~m.base| 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= |mutex_lock_#in~m.offset| mutex_lock_~m.offset) (= mutex_lock_~m.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|) (- 4)))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (< |#StackHeapBarrier| |mutex_lock_#in~m.base|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|) (- 4))) mutex_lock_~m.offset) (<= |~#mutexes~0.offset| 0) (= |mutex_lock_#in~m.offset| 0) (<= 0 |~#mutexes~0.offset|) (= |mutex_lock_#in~m.base| mutex_lock_~m.base) (< |~#mutexes~0.base| |#StackHeapBarrier|) (= |#valid| |old(#valid)|) (not (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))) (not (= |~#mutexes~0.base| 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (not (= |mutex_lock_#in~m.base| 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= mutex_lock_~m.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|) (- 4)))) (= |mutex_lock_#in~m.offset| mutex_lock_~m.offset) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|) (- 4))) mutex_lock_~m.offset) (< |#StackHeapBarrier| |mutex_lock_#in~m.base|) (not (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|))) (<= |~#mutexes~0.offset| 0) (= |mutex_lock_#in~m.offset| 0) (<= 0 |~#mutexes~0.offset|) (= |mutex_lock_#in~m.base| mutex_lock_~m.base) (< |~#mutexes~0.base| |#StackHeapBarrier|) (= |#valid| |old(#valid)|) (not (= |~#mutexes~0.base| 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (not (= |mutex_lock_#in~m.base| 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))). Possible FailurePath: - UnprovableResult [Line: 664]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 372#(and (<= 0 |~#mutexes~0.offset|) (<= |#NULL.base| 0) (< |~#mutexes~0.base| |#StackHeapBarrier|) (or (not (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))) (not (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))) (<= 0 |#NULL.base|) (not (= |~#mutexes~0.base| 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |~#mutexes~0.offset| 0)). Possible FailurePath: RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...