java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/heap-manipulation/dll_of_dll-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 01:23:53,381 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 01:23:53,383 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 01:23:53,395 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 01:23:53,395 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 01:23:53,396 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 01:23:53,398 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 01:23:53,399 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 01:23:53,401 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 01:23:53,402 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 01:23:53,403 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 01:23:53,404 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 01:23:53,404 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 01:23:53,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 01:23:53,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 01:23:53,407 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 01:23:53,408 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 01:23:53,409 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 01:23:53,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 01:23:53,412 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 01:23:53,413 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 01:23:53,414 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 01:23:53,415 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 01:23:53,416 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 01:23:53,418 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 01:23:53,418 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 01:23:53,418 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 01:23:53,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 01:23:53,419 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 01:23:53,420 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 01:23:53,420 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 01:23:53,421 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 01:23:53,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 01:23:53,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 01:23:53,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 01:23:53,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 01:23:53,424 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 01:23:53,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 01:23:53,425 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 01:23:53,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 01:23:53,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 01:23:53,427 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-09-08 01:23:53,441 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 01:23:53,441 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 01:23:53,442 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 01:23:53,443 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 01:23:53,443 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 01:23:53,443 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 01:23:53,443 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 01:23:53,443 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 01:23:53,443 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 01:23:53,444 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 01:23:53,444 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 01:23:53,444 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 01:23:53,444 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 01:23:53,444 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 01:23:53,445 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 01:23:53,445 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 01:23:53,445 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 01:23:53,445 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 01:23:53,445 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 01:23:53,446 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 01:23:53,446 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 01:23:53,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 01:23:53,447 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 01:23:53,448 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 01:23:53,448 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 01:23:53,448 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 01:23:53,448 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 01:23:53,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 01:23:53,449 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 01:23:53,500 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 01:23:53,515 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 01:23:53,521 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 01:23:53,523 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 01:23:53,523 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 01:23:53,524 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/dll_of_dll-1.i [2019-09-08 01:23:53,593 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88bfb23c9/599c88712508494493ddf5d66790ec0e/FLAG4d5041170 [2019-09-08 01:23:54,109 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 01:23:54,115 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/dll_of_dll-1.i [2019-09-08 01:23:54,137 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88bfb23c9/599c88712508494493ddf5d66790ec0e/FLAG4d5041170 [2019-09-08 01:23:54,398 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88bfb23c9/599c88712508494493ddf5d66790ec0e [2019-09-08 01:23:54,409 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 01:23:54,410 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 01:23:54,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 01:23:54,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 01:23:54,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 01:23:54,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:23:54" (1/1) ... [2019-09-08 01:23:54,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66c5502d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:23:54, skipping insertion in model container [2019-09-08 01:23:54,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:23:54" (1/1) ... [2019-09-08 01:23:54,425 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 01:23:54,480 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 01:23:54,916 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:23:54,924 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 01:23:54,980 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:23:55,054 INFO L192 MainTranslator]: Completed translation [2019-09-08 01:23:55,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:23:55 WrapperNode [2019-09-08 01:23:55,055 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 01:23:55,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 01:23:55,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 01:23:55,056 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 01:23:55,065 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:23:55" (1/1) ... [2019-09-08 01:23:55,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:23:55" (1/1) ... [2019-09-08 01:23:55,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:23:55" (1/1) ... [2019-09-08 01:23:55,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:23:55" (1/1) ... [2019-09-08 01:23:55,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:23:55" (1/1) ... [2019-09-08 01:23:55,124 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:23:55" (1/1) ... [2019-09-08 01:23:55,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:23:55" (1/1) ... [2019-09-08 01:23:55,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 01:23:55,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 01:23:55,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 01:23:55,139 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 01:23:55,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:23:55" (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-09-08 01:23:55,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 01:23:55,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 01:23:55,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-09-08 01:23:55,200 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-09-08 01:23:55,200 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-09-08 01:23:55,200 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2019-09-08 01:23:55,200 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_or_die_slave [2019-09-08 01:23:55,200 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_or_die_master [2019-09-08 01:23:55,201 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_slave [2019-09-08 01:23:55,201 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2019-09-08 01:23:55,201 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2019-09-08 01:23:55,201 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy_slave [2019-09-08 01:23:55,201 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy_nested_lists [2019-09-08 01:23:55,201 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_reinit_nested_lists [2019-09-08 01:23:55,202 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy_master [2019-09-08 01:23:55,202 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2019-09-08 01:23:55,202 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_master [2019-09-08 01:23:55,202 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_base [2019-09-08 01:23:55,202 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_full [2019-09-08 01:23:55,203 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_dangling [2019-09-08 01:23:55,203 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_init [2019-09-08 01:23:55,203 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 01:23:55,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 01:23:55,203 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-08 01:23:55,203 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-08 01:23:55,204 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-08 01:23:55,204 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-08 01:23:55,204 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-08 01:23:55,204 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-08 01:23:55,204 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-08 01:23:55,204 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-08 01:23:55,205 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-08 01:23:55,205 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-08 01:23:55,205 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-08 01:23:55,205 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-08 01:23:55,205 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-08 01:23:55,205 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-08 01:23:55,206 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-08 01:23:55,206 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-08 01:23:55,206 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-09-08 01:23:55,206 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-09-08 01:23:55,206 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-08 01:23:55,206 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-08 01:23:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-08 01:23:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-08 01:23:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-08 01:23:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-08 01:23:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-08 01:23:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-08 01:23:55,208 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-08 01:23:55,208 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-08 01:23:55,208 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-08 01:23:55,208 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-08 01:23:55,208 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-08 01:23:55,208 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-08 01:23:55,208 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-08 01:23:55,209 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-08 01:23:55,209 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-08 01:23:55,209 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-08 01:23:55,209 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-08 01:23:55,209 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-08 01:23:55,209 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-08 01:23:55,209 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-08 01:23:55,210 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-08 01:23:55,210 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-08 01:23:55,210 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-08 01:23:55,210 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-08 01:23:55,210 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-08 01:23:55,210 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-08 01:23:55,210 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-08 01:23:55,211 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-08 01:23:55,211 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-08 01:23:55,211 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-08 01:23:55,211 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-08 01:23:55,211 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-08 01:23:55,211 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 01:23:55,212 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-08 01:23:55,212 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-08 01:23:55,212 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 01:23:55,212 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-08 01:23:55,212 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-08 01:23:55,212 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-08 01:23:55,213 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-08 01:23:55,213 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-08 01:23:55,213 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-08 01:23:55,213 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-08 01:23:55,213 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-08 01:23:55,213 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-08 01:23:55,213 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 01:23:55,214 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-08 01:23:55,214 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-08 01:23:55,214 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-08 01:23:55,214 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-08 01:23:55,214 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-08 01:23:55,214 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-08 01:23:55,215 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-08 01:23:55,215 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-08 01:23:55,215 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-08 01:23:55,215 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-08 01:23:55,215 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-08 01:23:55,215 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-08 01:23:55,215 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-08 01:23:55,216 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-08 01:23:55,216 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-08 01:23:55,216 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-08 01:23:55,216 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-08 01:23:55,216 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-08 01:23:55,216 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-08 01:23:55,216 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-08 01:23:55,217 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-08 01:23:55,217 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-08 01:23:55,217 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-08 01:23:55,217 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-08 01:23:55,217 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-08 01:23:55,217 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-08 01:23:55,217 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-08 01:23:55,218 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-08 01:23:55,218 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-08 01:23:55,218 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-08 01:23:55,218 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-08 01:23:55,218 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-08 01:23:55,218 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-08 01:23:55,218 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-08 01:23:55,219 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-08 01:23:55,219 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-08 01:23:55,219 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-08 01:23:55,219 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-08 01:23:55,219 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-08 01:23:55,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 01:23:55,220 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2019-09-08 01:23:55,220 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_or_die_slave [2019-09-08 01:23:55,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 01:23:55,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 01:23:55,220 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_or_die_master [2019-09-08 01:23:55,220 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_slave [2019-09-08 01:23:55,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 01:23:55,221 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2019-09-08 01:23:55,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 01:23:55,221 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-09-08 01:23:55,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-08 01:23:55,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 01:23:55,221 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2019-09-08 01:23:55,222 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy_slave [2019-09-08 01:23:55,222 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy_nested_lists [2019-09-08 01:23:55,222 INFO L130 BoogieDeclarations]: Found specification of procedure dll_reinit_nested_lists [2019-09-08 01:23:55,222 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy_master [2019-09-08 01:23:55,222 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2019-09-08 01:23:55,222 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_master [2019-09-08 01:23:55,223 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_base [2019-09-08 01:23:55,223 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_full [2019-09-08 01:23:55,223 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_dangling [2019-09-08 01:23:55,223 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_init [2019-09-08 01:23:55,223 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 01:23:55,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 01:23:55,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 01:23:56,060 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 01:23:56,060 INFO L283 CfgBuilder]: Removed 38 assume(true) statements. [2019-09-08 01:23:56,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:23:56 BoogieIcfgContainer [2019-09-08 01:23:56,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 01:23:56,063 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 01:23:56,063 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 01:23:56,066 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 01:23:56,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:23:54" (1/3) ... [2019-09-08 01:23:56,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d2640f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:23:56, skipping insertion in model container [2019-09-08 01:23:56,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:23:55" (2/3) ... [2019-09-08 01:23:56,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d2640f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:23:56, skipping insertion in model container [2019-09-08 01:23:56,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:23:56" (3/3) ... [2019-09-08 01:23:56,070 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_of_dll-1.i [2019-09-08 01:23:56,078 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 01:23:56,086 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 01:23:56,118 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 01:23:56,149 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 01:23:56,149 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 01:23:56,150 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 01:23:56,150 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 01:23:56,150 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 01:23:56,150 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 01:23:56,150 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 01:23:56,150 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 01:23:56,150 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 01:23:56,171 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states. [2019-09-08 01:23:56,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 01:23:56,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:23:56,180 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:23:56,182 INFO L418 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:23:56,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:23:56,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1405399524, now seen corresponding path program 1 times [2019-09-08 01:23:56,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:23:56,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:23:56,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:56,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:23:56,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:23:56,382 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 01:23:56,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:23:56,385 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:23:56,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:23:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:23:56,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 1 conjunts are in the unsatisfiable core [2019-09-08 01:23:56,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:23:56,534 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 01:23:56,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 01:23:56,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2019-09-08 01:23:56,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 01:23:56,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 01:23:56,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 01:23:56,566 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 2 states. [2019-09-08 01:23:56,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:23:56,638 INFO L93 Difference]: Finished difference Result 329 states and 517 transitions. [2019-09-08 01:23:56,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 01:23:56,639 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 59 [2019-09-08 01:23:56,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:23:56,652 INFO L225 Difference]: With dead ends: 329 [2019-09-08 01:23:56,652 INFO L226 Difference]: Without dead ends: 155 [2019-09-08 01:23:56,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 01:23:56,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-08 01:23:56,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-09-08 01:23:56,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-08 01:23:56,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 184 transitions. [2019-09-08 01:23:56,710 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 184 transitions. Word has length 59 [2019-09-08 01:23:56,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:23:56,710 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 184 transitions. [2019-09-08 01:23:56,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 01:23:56,710 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 184 transitions. [2019-09-08 01:23:56,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 01:23:56,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:23:56,714 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:23:56,714 INFO L418 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:23:56,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:23:56,715 INFO L82 PathProgramCache]: Analyzing trace with hash 747676979, now seen corresponding path program 1 times [2019-09-08 01:23:56,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:23:56,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:23:56,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:56,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:23:56,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:23:57,259 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 01:23:57,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:23:57,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 01:23:57,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 01:23:57,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 01:23:57,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2019-09-08 01:23:57,262 INFO L87 Difference]: Start difference. First operand 155 states and 184 transitions. Second operand 21 states. [2019-09-08 01:23:58,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:23:58,142 INFO L93 Difference]: Finished difference Result 336 states and 416 transitions. [2019-09-08 01:23:58,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 01:23:58,142 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2019-09-08 01:23:58,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:23:58,146 INFO L225 Difference]: With dead ends: 336 [2019-09-08 01:23:58,146 INFO L226 Difference]: Without dead ends: 267 [2019-09-08 01:23:58,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2019-09-08 01:23:58,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-09-08 01:23:58,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 217. [2019-09-08 01:23:58,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-09-08 01:23:58,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 264 transitions. [2019-09-08 01:23:58,185 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 264 transitions. Word has length 60 [2019-09-08 01:23:58,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:23:58,186 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 264 transitions. [2019-09-08 01:23:58,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 01:23:58,186 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 264 transitions. [2019-09-08 01:23:58,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 01:23:58,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:23:58,188 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:23:58,188 INFO L418 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:23:58,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:23:58,189 INFO L82 PathProgramCache]: Analyzing trace with hash 65445028, now seen corresponding path program 1 times [2019-09-08 01:23:58,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:23:58,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:23:58,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:58,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:23:58,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:23:58,341 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 01:23:58,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:23:58,341 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:23:58,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:23:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:23:58,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 01:23:58,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:23:58,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:23:58,477 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 01:23:58,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:23:58,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-09-08 01:23:58,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 01:23:58,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 01:23:58,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 01:23:58,486 INFO L87 Difference]: Start difference. First operand 217 states and 264 transitions. Second operand 5 states. [2019-09-08 01:23:58,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:23:58,631 INFO L93 Difference]: Finished difference Result 378 states and 471 transitions. [2019-09-08 01:23:58,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 01:23:58,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-08 01:23:58,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:23:58,634 INFO L225 Difference]: With dead ends: 378 [2019-09-08 01:23:58,635 INFO L226 Difference]: Without dead ends: 168 [2019-09-08 01:23:58,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 01:23:58,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-08 01:23:58,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-09-08 01:23:58,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-08 01:23:58,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 199 transitions. [2019-09-08 01:23:58,653 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 199 transitions. Word has length 63 [2019-09-08 01:23:58,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:23:58,653 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 199 transitions. [2019-09-08 01:23:58,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 01:23:58,654 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 199 transitions. [2019-09-08 01:23:58,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 01:23:58,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:23:58,658 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:23:58,658 INFO L418 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:23:58,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:23:58,659 INFO L82 PathProgramCache]: Analyzing trace with hash 586330229, now seen corresponding path program 1 times [2019-09-08 01:23:58,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:23:58,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:23:58,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:58,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:23:58,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:23:59,198 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-09-08 01:23:59,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:23:59,198 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:23:59,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:23:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:23:59,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-08 01:23:59,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:23:59,497 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:23:59,497 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 1 case distinctions, treesize of input 31 treesize of output 47 [2019-09-08 01:23:59,498 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:23:59,525 INFO L567 ElimStorePlain]: treesize reduction 20, result has 60.8 percent of original size [2019-09-08 01:23:59,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:23:59,528 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:8 [2019-09-08 01:23:59,573 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 16 treesize of output 8 [2019-09-08 01:23:59,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:23:59,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:23:59,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:23:59,576 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-09-08 01:23:59,634 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 36 proven. 5 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-09-08 01:23:59,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:23:59,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 23 [2019-09-08 01:23:59,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 01:23:59,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 01:23:59,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-09-08 01:23:59,651 INFO L87 Difference]: Start difference. First operand 168 states and 199 transitions. Second operand 23 states. [2019-09-08 01:24:00,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:24:00,346 INFO L93 Difference]: Finished difference Result 299 states and 361 transitions. [2019-09-08 01:24:00,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 01:24:00,346 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 154 [2019-09-08 01:24:00,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:24:00,351 INFO L225 Difference]: With dead ends: 299 [2019-09-08 01:24:00,351 INFO L226 Difference]: Without dead ends: 229 [2019-09-08 01:24:00,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=791, Unknown=0, NotChecked=0, Total=870 [2019-09-08 01:24:00,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-09-08 01:24:00,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 194. [2019-09-08 01:24:00,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-08 01:24:00,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 230 transitions. [2019-09-08 01:24:00,388 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 230 transitions. Word has length 154 [2019-09-08 01:24:00,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:24:00,388 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 230 transitions. [2019-09-08 01:24:00,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 01:24:00,389 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 230 transitions. [2019-09-08 01:24:00,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 01:24:00,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:24:00,391 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:24:00,392 INFO L418 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:24:00,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:24:00,392 INFO L82 PathProgramCache]: Analyzing trace with hash -547179998, now seen corresponding path program 1 times [2019-09-08 01:24:00,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:24:00,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:24:00,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:24:00,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:24:00,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:24:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:24:00,936 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-08 01:24:00,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:24:00,936 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:24:00,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:24:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:24:01,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-08 01:24:01,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:24:01,300 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-09-08 01:24:01,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:24:01,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:24:01,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:24:01,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-09-08 01:24:01,415 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 8 treesize of output 4 [2019-09-08 01:24:01,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:24:01,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:24:01,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:24:01,420 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-08 01:24:02,982 WARN L860 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_slave_~ptr~0.offset Int) (alloc_or_die_slave_~ptr~0.base Int)) (and (<= (+ |c_#StackHeapBarrier| 1) alloc_or_die_slave_~ptr~0.base) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| alloc_or_die_slave_~ptr~0.base (store (store (select |c_old(#memory_$Pointer$.base)| alloc_or_die_slave_~ptr~0.base) alloc_or_die_slave_~ptr~0.offset 0) (+ alloc_or_die_slave_~ptr~0.offset 4) 0))))) is different from true [2019-09-08 01:24:10,653 WARN L188 SmtUtils]: Spent 1.66 s on a formula simplification that was a NOOP. DAG size: 25 [2019-09-08 01:24:15,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:24:15,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:24:15,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:24:15,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:24:15,065 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:1 [2019-09-08 01:24:15,103 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 114 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Stream closed [2019-09-08 01:24:15,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:24:15,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 22] total 33 [2019-09-08 01:24:15,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 01:24:15,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 01:24:15,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=905, Unknown=7, NotChecked=60, Total=1056 [2019-09-08 01:24:15,129 INFO L87 Difference]: Start difference. First operand 194 states and 230 transitions. Second operand 33 states. [2019-09-08 01:24:26,083 WARN L188 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2019-09-08 01:24:31,358 WARN L188 SmtUtils]: Spent 4.91 s on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-09-08 01:24:55,974 WARN L188 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-09-08 01:25:15,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:25:15,660 INFO L93 Difference]: Finished difference Result 405 states and 490 transitions. [2019-09-08 01:25:15,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 01:25:15,662 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 157 [2019-09-08 01:25:15,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:25:15,664 INFO L225 Difference]: With dead ends: 405 [2019-09-08 01:25:15,664 INFO L226 Difference]: Without dead ends: 218 [2019-09-08 01:25:15,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 40.6s TimeCoverageRelationStatistics Valid=270, Invalid=3027, Unknown=13, NotChecked=112, Total=3422 [2019-09-08 01:25:15,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-08 01:25:15,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 213. [2019-09-08 01:25:15,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-09-08 01:25:15,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 251 transitions. [2019-09-08 01:25:15,684 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 251 transitions. Word has length 157 [2019-09-08 01:25:15,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:25:15,684 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 251 transitions. [2019-09-08 01:25:15,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 01:25:15,685 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 251 transitions. [2019-09-08 01:25:15,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 01:25:15,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:25:15,687 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:25:15,688 INFO L418 AbstractCegarLoop]: === Iteration 6 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:25:15,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:25:15,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1709746076, now seen corresponding path program 1 times [2019-09-08 01:25:15,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:25:15,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:25:15,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:25:15,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:25:15,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:25:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:25:28,221 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-09-08 01:25:28,552 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-08 01:25:28,928 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-09-08 01:25:29,334 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-09-08 01:25:30,557 WARN L188 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2019-09-08 01:25:33,127 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-09-08 01:25:34,837 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 125 proven. 35 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 01:25:34,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:25:34,837 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:25:34,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:25:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:25:34,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 267 conjunts are in the unsatisfiable core [2019-09-08 01:25:34,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:25:35,661 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:25:35,661 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 1 case distinctions, treesize of input 27 treesize of output 39 [2019-09-08 01:25:35,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:25:35,711 INFO L567 ElimStorePlain]: treesize reduction 16, result has 77.1 percent of original size [2019-09-08 01:25:35,734 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:25:35,735 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 1 case distinctions, treesize of input 27 treesize of output 39 [2019-09-08 01:25:35,735 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:25:35,778 INFO L567 ElimStorePlain]: treesize reduction 16, result has 75.4 percent of original size [2019-09-08 01:25:35,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:25:35,782 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:59, output treesize:16 [2019-09-08 01:25:36,196 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 8 treesize of output 4 [2019-09-08 01:25:36,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:25:36,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:25:36,206 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-09-08 01:25:36,207 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:25:36,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:25:36,214 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:25:36,215 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:7 [2019-09-08 01:25:36,321 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 6 treesize of output 5 [2019-09-08 01:25:36,322 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:25:36,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:25:36,331 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:25:36,331 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-09-08 01:25:37,484 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-09-08 01:25:37,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:25:37,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:25:37,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:25:37,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2019-09-08 01:25:39,026 WARN L188 SmtUtils]: Spent 772.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-09-08 01:25:39,039 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 01:25:39,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:25:39,051 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:25:39,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-08 01:25:39,053 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:59, output treesize:55 [2019-09-08 01:25:40,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:25:40,016 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-09-08 01:25:40,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:25:40,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:25:40,037 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-09-08 01:25:40,037 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:25:40,046 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:25:40,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:25:40,047 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:7 [2019-09-08 01:25:41,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:28:03,321 WARN L188 SmtUtils]: Spent 4.11 s on a formula simplification that was a NOOP. DAG size: 45 [2019-09-08 01:28:05,361 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((dll_insert_slave_~item~0.base Int)) (let ((.cse3 (select (select (store |c_old(#memory_$Pointer$.offset)| dll_insert_slave_~item~0.base (store (store (select |c_old(#memory_$Pointer$.offset)| dll_insert_slave_~item~0.base) 0 0) 4 0)) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|))) (and (not (= dll_insert_slave_~item~0.base 0)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (let ((.cse4 (store (store (select |c_old(#memory_$Pointer$.base)| dll_insert_slave_~item~0.base) 0 0) 4 0))) (let ((.cse2 (select (select (store |c_old(#memory_$Pointer$.base)| dll_insert_slave_~item~0.base .cse4) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|))) (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| dll_insert_slave_~item~0.base (store .cse4 0 .cse2)))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ .cse3 4) dll_insert_slave_~item~0.base))))))) (store .cse0 |c_dll_insert_slave_#in~dll.base| (store (select .cse0 |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset| dll_insert_slave_~item~0.base)))) (not (= 0 .cse3)) (<= (+ |c_#StackHeapBarrier| 1) dll_insert_slave_~item~0.base)))) (exists ((v_prenex_1 Int)) (let ((.cse8 (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_1) 0 0) 4 0))) (let ((.cse7 (select (select (store |c_old(#memory_$Pointer$.base)| v_prenex_1 .cse8) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|))) (and (= (let ((.cse5 (let ((.cse6 (store |c_old(#memory_$Pointer$.base)| v_prenex_1 (store .cse8 0 .cse7)))) (store .cse6 .cse7 (store (select .cse6 .cse7) (+ (select (select (store |c_old(#memory_$Pointer$.offset)| v_prenex_1 (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_1) 0 0) 4 0)) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|) 4) v_prenex_1))))) (store .cse5 |c_dll_insert_slave_#in~dll.base| (store (select .cse5 |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset| v_prenex_1))) |c_#memory_$Pointer$.base|) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_1) (not (= v_prenex_1 0)) (not (= .cse7 0))))))) is different from true [2019-09-08 01:28:07,391 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((dll_insert_slave_~item~0.base Int)) (let ((.cse0 (select (select (store |c_old(#memory_$Pointer$.offset)| dll_insert_slave_~item~0.base (store (store (select |c_old(#memory_$Pointer$.offset)| dll_insert_slave_~item~0.base) 0 0) 4 0)) |c_##fun~$Pointer$~TO~VOID_#in~9.base|) |c_##fun~$Pointer$~TO~VOID_#in~9.offset|))) (and (not (= dll_insert_slave_~item~0.base 0)) (not (= 0 .cse0)) (= |c_#memory_$Pointer$.base| (let ((.cse1 (let ((.cse4 (store (store (select |c_old(#memory_$Pointer$.base)| dll_insert_slave_~item~0.base) 0 0) 4 0))) (let ((.cse3 (select (select (store |c_old(#memory_$Pointer$.base)| dll_insert_slave_~item~0.base .cse4) |c_##fun~$Pointer$~TO~VOID_#in~9.base|) |c_##fun~$Pointer$~TO~VOID_#in~9.offset|))) (let ((.cse2 (store |c_old(#memory_$Pointer$.base)| dll_insert_slave_~item~0.base (store .cse4 0 .cse3)))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ .cse0 4) dll_insert_slave_~item~0.base))))))) (store .cse1 |c_##fun~$Pointer$~TO~VOID_#in~9.base| (store (select .cse1 |c_##fun~$Pointer$~TO~VOID_#in~9.base|) |c_##fun~$Pointer$~TO~VOID_#in~9.offset| dll_insert_slave_~item~0.base)))) (<= (+ |c_#StackHeapBarrier| 1) dll_insert_slave_~item~0.base)))) (exists ((v_prenex_1 Int)) (let ((.cse8 (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_1) 0 0) 4 0))) (let ((.cse5 (select (select (store |c_old(#memory_$Pointer$.base)| v_prenex_1 .cse8) |c_##fun~$Pointer$~TO~VOID_#in~9.base|) |c_##fun~$Pointer$~TO~VOID_#in~9.offset|))) (and (<= (+ |c_#StackHeapBarrier| 1) v_prenex_1) (not (= v_prenex_1 0)) (not (= .cse5 0)) (= |c_#memory_$Pointer$.base| (let ((.cse6 (let ((.cse7 (store |c_old(#memory_$Pointer$.base)| v_prenex_1 (store .cse8 0 .cse5)))) (store .cse7 .cse5 (store (select .cse7 .cse5) (+ (select (select (store |c_old(#memory_$Pointer$.offset)| v_prenex_1 (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_1) 0 0) 4 0)) |c_##fun~$Pointer$~TO~VOID_#in~9.base|) |c_##fun~$Pointer$~TO~VOID_#in~9.offset|) 4) v_prenex_1))))) (store .cse6 |c_##fun~$Pointer$~TO~VOID_#in~9.base| (store (select .cse6 |c_##fun~$Pointer$~TO~VOID_#in~9.base|) |c_##fun~$Pointer$~TO~VOID_#in~9.offset| v_prenex_1))))))))) is different from true [2019-09-08 01:28:07,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:28:07,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:28:07,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:28:07,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:28:07,435 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 1204 treesize of output 1192 [2019-09-08 01:28:07,435 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:28:07,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:28:07,487 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-08 01:28:07,488 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:2381, output treesize:1185 [2019-09-08 01:28:31,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:28:31,858 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:28:31,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 15 [2019-09-08 01:28:31,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:28:32,153 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-09-08 01:28:32,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:28:32,154 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 1 xjuncts. [2019-09-08 01:28:32,154 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:15146, output treesize:15137 [2019-09-08 01:28:33,083 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-09-08 01:28:33,181 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:28:33,181 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 39 [2019-09-08 01:28:33,182 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:28:33,939 WARN L188 SmtUtils]: Spent 756.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 90 [2019-09-08 01:28:33,939 INFO L567 ElimStorePlain]: treesize reduction 16, result has 100.0 percent of original size [2019-09-08 01:28:33,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:28:33,945 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-09-08 01:28:33,945 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:56956, output treesize:81001 [2019-09-08 01:29:07,243 WARN L188 SmtUtils]: Spent 22.25 s on a formula simplification that was a NOOP. DAG size: 148 [2019-09-08 01:29:40,060 WARN L188 SmtUtils]: Spent 22.27 s on a formula simplification that was a NOOP. DAG size: 148 [2019-09-08 01:30:10,922 WARN L188 SmtUtils]: Spent 20.59 s on a formula simplification that was a NOOP. DAG size: 148 [2019-09-08 01:30:10,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:30:11,142 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:30:11,143 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.MultiDimensionalNestedStore.getInnermost(MultiDimensionalNestedStore.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:277) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:146) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.downgradeDimensionsIfNecessary(ArrayOccurrenceAnalysis.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-08 01:30:11,149 INFO L168 Benchmark]: Toolchain (without parser) took 376738.76 ms. Allocated memory was 133.2 MB in the beginning and 1.1 GB in the end (delta: 931.1 MB). Free memory was 87.9 MB in the beginning and 471.6 MB in the end (delta: -383.7 MB). Peak memory consumption was 547.5 MB. Max. memory is 7.1 GB. [2019-09-08 01:30:11,150 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 133.2 MB. Free memory was 107.6 MB in the beginning and 107.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-08 01:30:11,151 INFO L168 Benchmark]: CACSL2BoogieTranslator took 643.74 ms. Allocated memory was 133.2 MB in the beginning and 200.3 MB in the end (delta: 67.1 MB). Free memory was 87.7 MB in the beginning and 157.5 MB in the end (delta: -69.8 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-09-08 01:30:11,151 INFO L168 Benchmark]: Boogie Preprocessor took 82.97 ms. Allocated memory is still 200.3 MB. Free memory was 157.5 MB in the beginning and 153.7 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. [2019-09-08 01:30:11,152 INFO L168 Benchmark]: RCFGBuilder took 923.19 ms. Allocated memory is still 200.3 MB. Free memory was 153.1 MB in the beginning and 81.4 MB in the end (delta: 71.7 MB). Peak memory consumption was 71.7 MB. Max. memory is 7.1 GB. [2019-09-08 01:30:11,153 INFO L168 Benchmark]: TraceAbstraction took 375084.96 ms. Allocated memory was 200.3 MB in the beginning and 1.1 GB in the end (delta: 864.0 MB). Free memory was 81.4 MB in the beginning and 471.6 MB in the end (delta: -390.2 MB). Peak memory consumption was 473.8 MB. Max. memory is 7.1 GB. [2019-09-08 01:30:11,157 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.46 ms. Allocated memory is still 133.2 MB. Free memory was 107.6 MB in the beginning and 107.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 643.74 ms. Allocated memory was 133.2 MB in the beginning and 200.3 MB in the end (delta: 67.1 MB). Free memory was 87.7 MB in the beginning and 157.5 MB in the end (delta: -69.8 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 82.97 ms. Allocated memory is still 200.3 MB. Free memory was 157.5 MB in the beginning and 153.7 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 923.19 ms. Allocated memory is still 200.3 MB. Free memory was 153.1 MB in the beginning and 81.4 MB in the end (delta: 71.7 MB). Peak memory consumption was 71.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 375084.96 ms. Allocated memory was 200.3 MB in the beginning and 1.1 GB in the end (delta: 864.0 MB). Free memory was 81.4 MB in the beginning and 471.6 MB in the end (delta: -390.2 MB). Peak memory consumption was 473.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.MultiDimensionalNestedStore.getInnermost(MultiDimensionalNestedStore.java:121) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...