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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/heap-data/hash_fun.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 03:52:24,243 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 03:52:24,246 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 03:52:24,262 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 03:52:24,262 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 03:52:24,263 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 03:52:24,264 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 03:52:24,267 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 03:52:24,279 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 03:52:24,281 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 03:52:24,282 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 03:52:24,284 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 03:52:24,284 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 03:52:24,287 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 03:52:24,290 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 03:52:24,291 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 03:52:24,293 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 03:52:24,294 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 03:52:24,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 03:52:24,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 03:52:24,304 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 03:52:24,307 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 03:52:24,310 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 03:52:24,311 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 03:52:24,313 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 03:52:24,313 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 03:52:24,313 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 03:52:24,315 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 03:52:24,316 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 03:52:24,317 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 03:52:24,317 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 03:52:24,319 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 03:52:24,320 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 03:52:24,320 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 03:52:24,322 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 03:52:24,322 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 03:52:24,323 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 03:52:24,323 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 03:52:24,323 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 03:52:24,324 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 03:52:24,325 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 03:52:24,326 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-10-07 03:52:24,361 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 03:52:24,361 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 03:52:24,363 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 03:52:24,363 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 03:52:24,367 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 03:52:24,368 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 03:52:24,368 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 03:52:24,369 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 03:52:24,369 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 03:52:24,369 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 03:52:24,369 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 03:52:24,370 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 03:52:24,370 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 03:52:24,370 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 03:52:24,370 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 03:52:24,371 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 03:52:24,371 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 03:52:24,371 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 03:52:24,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 03:52:24,371 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 03:52:24,372 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 03:52:24,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 03:52:24,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 03:52:24,376 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 03:52:24,376 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 03:52:24,376 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 03:52:24,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 03:52:24,376 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 03:52:24,377 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 03:52:24,673 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 03:52:24,687 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 03:52:24,690 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 03:52:24,692 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 03:52:24,693 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 03:52:24,693 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/hash_fun.i [2019-10-07 03:52:24,775 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/140ff73db/a4ce79f3cc9f4045bbf816b30e824336/FLAG02681c0fd [2019-10-07 03:52:25,310 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 03:52:25,310 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/hash_fun.i [2019-10-07 03:52:25,331 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/140ff73db/a4ce79f3cc9f4045bbf816b30e824336/FLAG02681c0fd [2019-10-07 03:52:25,643 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/140ff73db/a4ce79f3cc9f4045bbf816b30e824336 [2019-10-07 03:52:25,654 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 03:52:25,656 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 03:52:25,657 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 03:52:25,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 03:52:25,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 03:52:25,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:52:25" (1/1) ... [2019-10-07 03:52:25,666 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c65c842 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:52:25, skipping insertion in model container [2019-10-07 03:52:25,666 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:52:25" (1/1) ... [2019-10-07 03:52:25,674 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 03:52:25,714 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 03:52:26,245 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:52:26,258 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 03:52:26,302 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:52:26,369 INFO L192 MainTranslator]: Completed translation [2019-10-07 03:52:26,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:52:26 WrapperNode [2019-10-07 03:52:26,370 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 03:52:26,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 03:52:26,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 03:52:26,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 03:52:26,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:52:26" (1/1) ... [2019-10-07 03:52:26,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:52:26" (1/1) ... [2019-10-07 03:52:26,418 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:52:26" (1/1) ... [2019-10-07 03:52:26,418 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:52:26" (1/1) ... [2019-10-07 03:52:26,437 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:52:26" (1/1) ... [2019-10-07 03:52:26,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:52:26" (1/1) ... [2019-10-07 03:52:26,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:52:26" (1/1) ... [2019-10-07 03:52:26,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 03:52:26,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 03:52:26,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 03:52:26,455 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 03:52:26,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:52:26" (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-10-07 03:52:26,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 03:52:26,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 03:52:26,512 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-07 03:52:26,512 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-07 03:52:26,512 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_fun [2019-10-07 03:52:26,513 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_list [2019-10-07 03:52:26,513 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 03:52:26,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 03:52:26,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 03:52:26,514 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-07 03:52:26,514 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-07 03:52:26,514 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-07 03:52:26,514 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-07 03:52:26,514 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-07 03:52:26,515 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-07 03:52:26,515 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-07 03:52:26,515 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-07 03:52:26,515 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-07 03:52:26,515 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-07 03:52:26,516 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-07 03:52:26,516 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-07 03:52:26,516 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-07 03:52:26,516 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-07 03:52:26,516 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-07 03:52:26,516 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-07 03:52:26,517 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-07 03:52:26,517 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-07 03:52:26,517 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-07 03:52:26,517 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-07 03:52:26,517 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-07 03:52:26,517 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-07 03:52:26,517 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-07 03:52:26,517 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-07 03:52:26,518 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-07 03:52:26,518 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-07 03:52:26,518 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-07 03:52:26,518 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-07 03:52:26,518 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-07 03:52:26,518 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-07 03:52:26,518 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-07 03:52:26,519 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-07 03:52:26,519 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-07 03:52:26,519 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-07 03:52:26,519 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-07 03:52:26,519 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-07 03:52:26,519 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-07 03:52:26,519 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-07 03:52:26,520 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-07 03:52:26,520 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-07 03:52:26,520 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-07 03:52:26,520 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-07 03:52:26,520 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-07 03:52:26,520 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-07 03:52:26,520 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-07 03:52:26,521 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-07 03:52:26,521 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-07 03:52:26,521 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-07 03:52:26,521 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-07 03:52:26,521 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-07 03:52:26,521 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-07 03:52:26,522 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-07 03:52:26,522 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 03:52:26,522 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-07 03:52:26,522 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-07 03:52:26,522 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-07 03:52:26,522 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-07 03:52:26,522 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-07 03:52:26,523 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-07 03:52:26,523 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-07 03:52:26,523 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-07 03:52:26,523 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-07 03:52:26,523 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-07 03:52:26,523 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-07 03:52:26,524 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-07 03:52:26,524 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 03:52:26,524 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-07 03:52:26,524 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-07 03:52:26,524 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-07 03:52:26,524 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-07 03:52:26,524 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-07 03:52:26,525 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-07 03:52:26,525 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-07 03:52:26,525 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-07 03:52:26,525 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-07 03:52:26,525 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-07 03:52:26,525 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-07 03:52:26,526 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-07 03:52:26,526 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-07 03:52:26,526 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-07 03:52:26,526 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-07 03:52:26,526 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-07 03:52:26,526 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-07 03:52:26,526 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-07 03:52:26,527 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-07 03:52:26,527 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-07 03:52:26,527 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-07 03:52:26,527 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-07 03:52:26,527 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-07 03:52:26,527 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-07 03:52:26,527 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-07 03:52:26,528 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-07 03:52:26,528 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-07 03:52:26,528 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-07 03:52:26,528 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-07 03:52:26,528 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-07 03:52:26,528 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-07 03:52:26,528 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-07 03:52:26,529 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-07 03:52:26,529 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-07 03:52:26,529 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-07 03:52:26,529 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-07 03:52:26,529 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-07 03:52:26,529 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-07 03:52:26,529 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-07 03:52:26,530 INFO L130 BoogieDeclarations]: Found specification of procedure hash_fun [2019-10-07 03:52:26,530 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_list [2019-10-07 03:52:26,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 03:52:26,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 03:52:26,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 03:52:26,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 03:52:26,531 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 03:52:26,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 03:52:26,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-07 03:52:26,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 03:52:26,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 03:52:26,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 03:52:26,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 03:52:27,221 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 03:52:27,222 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-07 03:52:27,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:52:27 BoogieIcfgContainer [2019-10-07 03:52:27,223 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 03:52:27,224 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 03:52:27,225 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 03:52:27,228 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 03:52:27,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:52:25" (1/3) ... [2019-10-07 03:52:27,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da5a232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:52:27, skipping insertion in model container [2019-10-07 03:52:27,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:52:26" (2/3) ... [2019-10-07 03:52:27,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da5a232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:52:27, skipping insertion in model container [2019-10-07 03:52:27,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:52:27" (3/3) ... [2019-10-07 03:52:27,232 INFO L109 eAbstractionObserver]: Analyzing ICFG hash_fun.i [2019-10-07 03:52:27,243 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 03:52:27,251 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 03:52:27,264 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 03:52:27,286 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 03:52:27,287 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 03:52:27,287 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 03:52:27,287 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 03:52:27,287 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 03:52:27,288 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 03:52:27,288 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 03:52:27,288 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 03:52:27,310 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-10-07 03:52:27,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-07 03:52:27,317 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:52:27,318 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:52:27,320 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:52:27,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:52:27,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1208309427, now seen corresponding path program 1 times [2019-10-07 03:52:27,336 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:52:27,336 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:52:27,336 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:52:27,337 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:52:27,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:52:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:52:27,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:52:27,485 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:52:27,485 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:52:27,486 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-07 03:52:27,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-07 03:52:27,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-07 03:52:27,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 03:52:27,509 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2019-10-07 03:52:27,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:52:27,529 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2019-10-07 03:52:27,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-07 03:52:27,531 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-10-07 03:52:27,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:52:27,544 INFO L225 Difference]: With dead ends: 36 [2019-10-07 03:52:27,544 INFO L226 Difference]: Without dead ends: 22 [2019-10-07 03:52:27,548 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-10-07 03:52:27,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-07 03:52:27,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-07 03:52:27,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-07 03:52:27,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-10-07 03:52:27,585 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 10 [2019-10-07 03:52:27,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:52:27,586 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-10-07 03:52:27,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-07 03:52:27,586 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-10-07 03:52:27,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 03:52:27,587 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:52:27,587 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:52:27,587 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:52:27,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:52:27,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1850516525, now seen corresponding path program 1 times [2019-10-07 03:52:27,588 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:52:27,588 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:52:27,589 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:52:27,589 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:52:27,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:52:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:52:27,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:52:27,724 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:52:27,725 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:52:27,725 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 03:52:27,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 03:52:27,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 03:52:27,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:52:27,729 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 4 states. [2019-10-07 03:52:27,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:52:27,789 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2019-10-07 03:52:27,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 03:52:27,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-07 03:52:27,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:52:27,791 INFO L225 Difference]: With dead ends: 37 [2019-10-07 03:52:27,791 INFO L226 Difference]: Without dead ends: 29 [2019-10-07 03:52:27,792 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:52:27,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-07 03:52:27,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-07 03:52:27,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-07 03:52:27,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-10-07 03:52:27,808 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 11 [2019-10-07 03:52:27,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:52:27,809 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-10-07 03:52:27,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 03:52:27,809 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2019-10-07 03:52:27,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-07 03:52:27,818 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:52:27,819 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:52:27,819 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:52:27,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:52:27,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1555299807, now seen corresponding path program 1 times [2019-10-07 03:52:27,820 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:52:27,820 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:52:27,820 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:52:27,820 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:52:27,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:52:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:52:28,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:52:28,107 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:52:28,108 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:52:28,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:52:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:52:28,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-07 03:52:28,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:52:28,483 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-10-07 03:52:28,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:52:28,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:52:28,556 INFO L341 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-10-07 03:52:28,556 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2019-10-07 03:52:28,557 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-10-07 03:52:28,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:52:28,584 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-10-07 03:52:28,585 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-07 03:52:28,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:52:28,607 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 03:52:28,609 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:59, output treesize:41 [2019-10-07 03:52:28,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:52:28,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:52:28,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:52:28,745 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:52:28,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:52:28,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:52:28,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:52:28,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:52:28,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:52:28,986 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_28|], 2=[|v_#memory_int_29|]} [2019-10-07 03:52:29,030 INFO L341 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2019-10-07 03:52:29,030 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2019-10-07 03:52:29,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:52:29,078 INFO L341 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2019-10-07 03:52:29,079 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2019-10-07 03:52:29,079 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:52:29,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:52:29,125 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 33 treesize of output 25 [2019-10-07 03:52:29,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:52:29,134 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-07 03:52:29,140 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 33 treesize of output 25 [2019-10-07 03:52:29,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:52:29,143 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-07 03:52:29,225 INFO L567 ElimStorePlain]: treesize reduction 10, result has 76.7 percent of original size [2019-10-07 03:52:29,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:52:29,227 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-10-07 03:52:29,227 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:95, output treesize:16 [2019-10-07 03:52:29,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:52:29,287 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_22|], 2=[|v_#memory_int_30|]} [2019-10-07 03:52:29,303 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-07 03:52:29,306 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 0 case distinctions, treesize of input 32 treesize of output 1 [2019-10-07 03:52:29,306 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:52:29,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:52:29,308 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_30| vanished before elimination [2019-10-07 03:52:29,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 03:52:29,309 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:1 [2019-10-07 03:52:29,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 03:52:29,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:52:29,343 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 03:52:29,371 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-07 03:52:29,371 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 03:52:29,377 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 03:52:29,384 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 03:52:29,384 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 03:52:29,507 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-07 03:52:43,278 INFO L199 IcfgInterpreter]: Interpreting procedure append_to_list with input of size 47 for LOIs [2019-10-07 03:52:43,313 INFO L199 IcfgInterpreter]: Interpreting procedure hash_fun with input of size 36 for LOIs [2019-10-07 03:52:43,317 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 03:52:43,321 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 03:52:43,321 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 03:52:43,321 INFO L193 IcfgInterpreter]: Reachable states at location append_to_listENTRY satisfy 1565#(and (<= 0 |append_to_list_#in~hash|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 (+ |append_to_list_#in~hash| 2147483648)) (< |append_to_list_#in~list.base| |#StackHeapBarrier|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 |append_to_list_#in~hash|) (= |append_to_list_#in~list.offset| 0) (<= |append_to_list_#in~hash| 2147483647) (<= |append_to_list_#in~list.offset| 0) (<= |append_to_list_#in~hash| 1000100) (= |#valid| |old(#valid)|) (not (= 0 |append_to_list_#in~list.base|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= 0 |append_to_list_#in~list.offset|) (= |#NULL.offset| 0) (<= |append_to_list_#in~hash| 1000099) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 03:52:43,321 INFO L193 IcfgInterpreter]: Reachable states at location L579-2 satisfy 1145#(and (or (and (= 0 |#NULL.base|) (not (= |main_~#list~0.base| 0)) (= |main_~#list~0.offset| 0) (= 0 (select (select |old(#memory_$Pointer$.base)| |main_~#list~0.base|) |main_~#list~0.offset|)) (<= main_~base~0 1000000) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (< main_~base~0 main_~hash~0) (< main_~hash~0 (+ main_~base~0 100)) (<= main_~hash~0 1000100) (<= 0 main_~base~0) (< |main_~#list~0.base| |#StackHeapBarrier|) (= (select (select |old(#memory_$Pointer$.offset)| |main_~#list~0.base|) |main_~#list~0.offset|) 0) (= 0 (select |old(#valid)| 0)) (<= main_~hash~0 2147483647) (<= 0 (+ main_~hash~0 2147483648)) (= |#NULL.offset| 0) (<= 0 main_~hash~0)) (and (= 0 |#NULL.base|) (= |#length| (store |old(#length)| |main_~#list~0.base| 4)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (< |main_~#list~0.base| |#StackHeapBarrier|) (not (= |main_~#list~0.base| 0)) (= |#valid| (store |old(#valid)| |main_~#list~0.base| 1)) (= |main_~#list~0.offset| 0) (= 0 (select |old(#valid)| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (<= 0 |main_~#list~0.offset|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#list~0.offset| 0) (<= 0 (+ main_~base~0 2147483648)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~base~0 2147483647)) [2019-10-07 03:52:43,321 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 1583#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 03:52:43,322 INFO L193 IcfgInterpreter]: Reachable states at location L580-2 satisfy 741#(and (= |#NULL.base| 0) (<= 0 |main_~#list~0.offset|) (<= 0 main_~base~0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |main_~#list~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~base~0 1000000) (<= |main_~#list~0.offset| 0) (= |#NULL.offset| 0) (<= 0 main_~hash~0) (<= main_~hash~0 1000100)) [2019-10-07 03:52:43,322 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 274#(and (= |#NULL.base| 0) (<= 0 |main_~#list~0.offset|) (<= 0 main_~base~0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |main_~#list~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~base~0 1000000) (<= |main_~#list~0.offset| 0) (= |#NULL.offset| 0) (<= 0 main_~hash~0) (<= main_~hash~0 1000100)) [2019-10-07 03:52:43,322 INFO L193 IcfgInterpreter]: Reachable states at location hash_funEXIT satisfy 1579#(exists ((v_prenex_26 Int)) (or (and (<= 0 (+ |hash_fun_#res| 2147483648)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= |hash_fun_#res| 2147483647) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= 0 (+ |hash_fun_#res| 2147483648)) (= (select (select |#memory_$Pointer$.offset| v_prenex_26) 0) 0) (= 0 |#NULL.base|) (not (= 0 v_prenex_26)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (< v_prenex_26 |#StackHeapBarrier|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select (select |#memory_$Pointer$.base| v_prenex_26) 0)) (<= |hash_fun_#res| 2147483647) (= 0 (select |#valid| 0)) (= |#NULL.offset| 0) (= 4 (select |#length| v_prenex_26)) (= (select |#valid| v_prenex_26) 1)))) [2019-10-07 03:52:43,322 INFO L193 IcfgInterpreter]: Reachable states at location L579 satisfy 948#(and (or (and (<= 0 |main_~#list~0.offset|) (= 0 |#NULL.base|) (not (= |main_~#list~0.base| 0)) (= |main_~#list~0.offset| 0) (= 0 (select (select |old(#memory_$Pointer$.base)| |main_~#list~0.base|) |main_~#list~0.offset|)) (<= main_~base~0 1000000) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (< main_~base~0 main_~hash~0) (< main_~hash~0 (+ main_~base~0 100)) (<= main_~hash~0 1000100) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (<= 0 main_~base~0) (<= |#NULL.base| 0) (< |main_~#list~0.base| |#StackHeapBarrier|) (= (select (select |old(#memory_$Pointer$.offset)| |main_~#list~0.base|) |main_~#list~0.offset|) 0) (= 0 (select |old(#valid)| 0)) (<= main_~hash~0 2147483647) (<= 0 (+ main_~hash~0 2147483648)) (= |main_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |#NULL.offset| 0) (<= 0 main_~hash~0)) (and (<= 0 |main_~#list~0.offset|) (= 0 |#NULL.base|) (= |#length| (store |old(#length)| |main_~#list~0.base| 4)) (<= |#NULL.base| 0) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (< |main_~#list~0.base| |#StackHeapBarrier|) (not (= |main_~#list~0.base| 0)) (= |#valid| (store |old(#valid)| |main_~#list~0.base| 1)) (= |main_~#list~0.offset| 0) (= 0 (select |old(#valid)| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |main_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |#NULL.offset| 0) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (<= 0 |#NULL.base|) (<= |main_~#list~0.offset| 0) (<= 0 (+ main_~base~0 2147483648)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~base~0 2147483647)) [2019-10-07 03:52:43,322 INFO L193 IcfgInterpreter]: Reachable states at location L571-1 satisfy 1332#(and (or (and (<= 0 (+ |main_#t~nondet6| 2147483648)) (<= 0 |main_~#list~0.offset|) (= 0 |#NULL.base|) (= |#length| (store |old(#length)| |main_~#list~0.base| 4)) (<= |#NULL.base| 0) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (<= 0 |#NULL.base|) (< |main_~#list~0.base| |#StackHeapBarrier|) (not (= |main_~#list~0.base| 0)) (= |#valid| (store |old(#valid)| |main_~#list~0.base| 1)) (= |main_~#list~0.offset| 0) (= 0 (select |old(#valid)| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (<= |main_#t~nondet6| 2147483647) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (= |#memory_int| |old(#memory_int)|) (<= |main_~#list~0.offset| 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= 0 (+ main_~base~0 2147483648)) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (<= 0 |main_~#list~0.offset|) (= 0 |#NULL.base|) (<= 0 |#NULL.base|) (not (= |main_~#list~0.base| 0)) (= |main_~#list~0.offset| 0) (= 0 (select (select |old(#memory_$Pointer$.base)| |main_~#list~0.base|) |main_~#list~0.offset|)) (<= main_~base~0 1000000) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (< main_~base~0 main_~hash~0) (< main_~hash~0 (+ main_~base~0 100)) (<= 0 (+ main_~base~0 2147483648)) (<= main_~hash~0 1000100) (<= 0 (+ |main_#t~nondet6| 2147483648)) (<= 0 main_~base~0) (<= |#NULL.base| 0) (< |main_~#list~0.base| |#StackHeapBarrier|) (= (select (select |old(#memory_$Pointer$.offset)| |main_~#list~0.base|) |main_~#list~0.offset|) 0) (= 0 (select |old(#valid)| 0)) (<= |main_#t~nondet6| 2147483647) (<= main_~hash~0 2147483647) (<= |main_~#list~0.offset| 0) (<= 0 (+ main_~hash~0 2147483648)) (= |#NULL.offset| 0) (<= 0 main_~hash~0))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~base~0 2147483647)) [2019-10-07 03:52:43,322 INFO L193 IcfgInterpreter]: Reachable states at location L581 satisfy 399#(and (= |#NULL.base| 0) (<= 0 |main_~#list~0.offset|) (<= 0 main_~base~0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |main_~#list~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~base~0 1000000) (<= |main_~#list~0.offset| 0) (= |#NULL.offset| 0) (<= 0 main_~hash~0) (<= main_~hash~0 1000100)) [2019-10-07 03:52:43,323 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 03:52:43,323 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 03:52:43,323 INFO L193 IcfgInterpreter]: Reachable states at location L572-1 satisfy 1412#(and (or (and (<= 0 |main_~#list~0.offset|) (= 0 |#NULL.base|) (not (= |main_~#list~0.base| 0)) (= |main_~#list~0.offset| 0) (= 0 (select (select |old(#memory_$Pointer$.base)| |main_~#list~0.base|) |main_~#list~0.offset|)) (<= main_~base~0 1000000) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (< main_~base~0 main_~hash~0) (< main_~hash~0 (+ main_~base~0 100)) (<= main_~hash~0 1000100) (<= 0 main_~base~0) (< |main_~#list~0.base| |#StackHeapBarrier|) (= (select (select |old(#memory_$Pointer$.offset)| |main_~#list~0.base|) |main_~#list~0.offset|) 0) (= 0 (select |old(#valid)| 0)) (<= main_~hash~0 2147483647) (<= 0 (+ main_~hash~0 2147483648)) (= |#NULL.offset| 0) (<= 0 main_~hash~0)) (and (<= 0 |main_~#list~0.offset|) (= 0 |#NULL.base|) (= |#length| (store |old(#length)| |main_~#list~0.base| 4)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (< |main_~#list~0.base| |#StackHeapBarrier|) (not (= |main_~#list~0.base| 0)) (= |#valid| (store |old(#valid)| |main_~#list~0.base| 1)) (= |main_~#list~0.offset| 0) (= 0 (select |old(#valid)| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#list~0.offset| 0) (<= 0 (+ main_~base~0 2147483648)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~base~0 2147483647)) [2019-10-07 03:52:43,323 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 1588#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 03:52:43,323 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 03:52:43,323 INFO L193 IcfgInterpreter]: Reachable states at location L572 satisfy 1239#(and (or (and (<= 0 |main_~#list~0.offset|) (= 0 |#NULL.base|) (not (= |main_~#list~0.base| 0)) (= |main_~#list~0.offset| 0) (= 0 (select (select |old(#memory_$Pointer$.base)| |main_~#list~0.base|) |main_~#list~0.offset|)) (<= main_~base~0 1000000) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (< main_~base~0 main_~hash~0) (< main_~hash~0 (+ main_~base~0 100)) (<= main_~hash~0 1000100) (<= 0 main_~base~0) (<= |#NULL.base| 0) (< |main_~#list~0.base| |#StackHeapBarrier|) (= (select (select |old(#memory_$Pointer$.offset)| |main_~#list~0.base|) |main_~#list~0.offset|) 0) (= 0 (select |old(#valid)| 0)) (<= main_~hash~0 2147483647) (<= 0 (+ main_~hash~0 2147483648)) (= |#NULL.offset| 0) (<= 0 main_~hash~0)) (and (<= 0 |main_~#list~0.offset|) (= 0 |#NULL.base|) (= |#length| (store |old(#length)| |main_~#list~0.base| 4)) (<= |#NULL.base| 0) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (< |main_~#list~0.base| |#StackHeapBarrier|) (not (= |main_~#list~0.base| 0)) (= |#valid| (store |old(#valid)| |main_~#list~0.base| 1)) (= |main_~#list~0.offset| 0) (= 0 (select |old(#valid)| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (<= 0 |#NULL.base|) (<= |main_~#list~0.offset| 0) (<= 0 (+ main_~base~0 2147483648)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~base~0 2147483647)) [2019-10-07 03:52:43,323 INFO L193 IcfgInterpreter]: Reachable states at location L574-1 satisfy 1561#(or (and (<= 0 |main_~#list~0.offset|) (<= |main_#t~ret7| 2147483647) (= 0 |#NULL.base|) (not (= |main_~#list~0.base| 0)) (<= 0 |#NULL.base|) (= |main_~#list~0.offset| 0) (<= 0 |#NULL.offset|) (= 0 (select (select |old(#memory_$Pointer$.base)| |main_~#list~0.base|) |main_~#list~0.offset|)) (<= main_~base~0 1000000) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (< main_~base~0 main_~hash~0) (< main_~hash~0 (+ main_~base~0 100)) (<= 0 (+ main_~base~0 2147483648)) (<= main_~hash~0 1000100) (<= 0 main_~base~0) (<= 0 (+ |main_#t~ret7| 2147483648)) (<= |#NULL.base| 0) (< |main_~#list~0.base| |#StackHeapBarrier|) (= (select (select |old(#memory_$Pointer$.offset)| |main_~#list~0.base|) |main_~#list~0.offset|) 0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= main_~hash~0 2147483647) (<= 0 (+ main_~hash~0 2147483648)) (<= |main_~#list~0.offset| 0) (= |#NULL.offset| 0) (<= 0 main_~hash~0) (<= main_~base~0 2147483647)) (and (<= 0 |main_~#list~0.offset|) (<= |main_#t~ret7| 2147483647) (= 0 |#NULL.base|) (= |#length| (store |old(#length)| |main_~#list~0.base| 4)) (not (= |main_~#list~0.base| 0)) (<= 0 |#NULL.base|) (= |main_~#list~0.offset| 0) (<= 0 |#NULL.offset|) (<= main_~base~0 1000000) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= 0 (+ main_~base~0 2147483648)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (<= 0 main_~base~0) (<= 0 (+ |main_#t~ret7| 2147483648)) (<= |#NULL.base| 0) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (< |main_~#list~0.base| |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |main_~#list~0.base| 1)) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |#memory_int| |old(#memory_int)|) (<= |main_~#list~0.offset| 0) (= |#NULL.offset| 0) (<= main_~base~0 2147483647))) [2019-10-07 03:52:43,324 INFO L193 IcfgInterpreter]: Reachable states at location hash_funENTRY satisfy 1574#(exists ((v_prenex_26 Int)) (or (and (= (select (select |#memory_$Pointer$.offset| v_prenex_26) 0) 0) (not (= 0 v_prenex_26)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (< v_prenex_26 |#StackHeapBarrier|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select (select |#memory_$Pointer$.base| v_prenex_26) 0)) (= 0 (select |#valid| 0)) (= |#NULL.offset| 0) (= 4 (select |#length| v_prenex_26)) (= (select |#valid| v_prenex_26) 1)) (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 03:52:43,324 INFO L193 IcfgInterpreter]: Reachable states at location append_to_listEXIT satisfy 1570#(exists ((v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int)) (and (= 0 |#NULL.base|) (< |#StackHeapBarrier| |append_to_list_#t~malloc3.base|) (<= 0 |#NULL.base|) (= (store (store |old(#memory_$Pointer$.offset)| append_to_list_~node~0.base (store (store (select |old(#memory_$Pointer$.offset)| append_to_list_~node~0.base) (+ append_to_list_~node~0.offset 4) (select (select |old(#memory_$Pointer$.offset)| append_to_list_~list.base) append_to_list_~list.offset)) append_to_list_~node~0.offset v_DerPreprocessor_3)) append_to_list_~list.base (store (select (store |old(#memory_$Pointer$.offset)| append_to_list_~node~0.base (store (store (select |old(#memory_$Pointer$.offset)| append_to_list_~node~0.base) (+ append_to_list_~node~0.offset 4) (select (select |old(#memory_$Pointer$.offset)| append_to_list_~list.base) append_to_list_~list.offset)) append_to_list_~node~0.offset v_DerPreprocessor_3)) append_to_list_~list.base) append_to_list_~list.offset append_to_list_~node~0.offset)) |#memory_$Pointer$.offset|) (<= 0 (+ |append_to_list_#in~hash| 2147483648)) (= (select |old(#valid)| |append_to_list_#t~malloc3.base|) 0) (< |append_to_list_#in~list.base| |#StackHeapBarrier|) (<= 0 |#NULL.offset|) (<= 1 |append_to_list_#in~hash|) (= |append_to_list_#in~list.offset| 0) (<= |append_to_list_#in~hash| 2147483647) (<= |append_to_list_#in~hash| 1000100) (= (store |old(#length)| |append_to_list_#t~malloc3.base| 8) |#length|) (= (store (store |old(#memory_int)| append_to_list_~node~0.base (store (store (select |old(#memory_int)| append_to_list_~node~0.base) (+ append_to_list_~node~0.offset 4) v_DerPreprocessor_5) append_to_list_~node~0.offset append_to_list_~hash)) append_to_list_~list.base (store (select (store |old(#memory_int)| append_to_list_~node~0.base (store (store (select |old(#memory_int)| append_to_list_~node~0.base) (+ append_to_list_~node~0.offset 4) v_DerPreprocessor_5) append_to_list_~node~0.offset append_to_list_~hash)) append_to_list_~list.base) append_to_list_~list.offset (select (select |#memory_int| append_to_list_~list.base) append_to_list_~list.offset))) |#memory_int|) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| append_to_list_~node~0.base (store (store (select |old(#memory_$Pointer$.base)| append_to_list_~node~0.base) (+ append_to_list_~node~0.offset 4) (select (select |old(#memory_$Pointer$.base)| append_to_list_~list.base) append_to_list_~list.offset)) append_to_list_~node~0.offset v_DerPreprocessor_4)) append_to_list_~list.base (store (select (store |old(#memory_$Pointer$.base)| append_to_list_~node~0.base (store (store (select |old(#memory_$Pointer$.base)| append_to_list_~node~0.base) (+ append_to_list_~node~0.offset 4) (select (select |old(#memory_$Pointer$.base)| append_to_list_~list.base) append_to_list_~list.offset)) append_to_list_~node~0.offset v_DerPreprocessor_4)) append_to_list_~list.base) append_to_list_~list.offset append_to_list_~node~0.base))) (<= 0 |append_to_list_#in~hash|) (= |append_to_list_#t~malloc3.offset| 0) (<= |#NULL.base| 0) (= |append_to_list_#t~malloc3.offset| append_to_list_~node~0.offset) (= |append_to_list_#in~hash| append_to_list_~hash) (= append_to_list_~list.base |append_to_list_#in~list.base|) (= |append_to_list_#in~list.offset| append_to_list_~list.offset) (= |append_to_list_#t~malloc3.base| append_to_list_~node~0.base) (<= |#NULL.offset| 0) (= |#valid| (store |old(#valid)| |append_to_list_#t~malloc3.base| 1)) (<= |append_to_list_#in~list.offset| 0) (not (= 0 |append_to_list_#in~list.base|)) (not (= |append_to_list_#t~malloc3.base| 0)) (<= 0 |append_to_list_#in~list.offset|) (= |#NULL.offset| 0) (<= |append_to_list_#in~hash| 1000099))) [2019-10-07 03:52:43,324 INFO L193 IcfgInterpreter]: Reachable states at location L574 satisfy 1047#(and (or (and (<= 0 |main_~#list~0.offset|) (<= 0 main_~base~0) (= 0 |#NULL.base|) (= |#length| (store |old(#length)| |main_~#list~0.base| 4)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (< |main_~#list~0.base| |#StackHeapBarrier|) (not (= |main_~#list~0.base| 0)) (= |#valid| (store |old(#valid)| |main_~#list~0.base| 1)) (= |main_~#list~0.offset| 0) (= 0 (select |old(#valid)| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= 0 (+ main_~base~0 2147483648)) (= |#NULL.offset| 0) (<= main_~base~0 2147483647) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (<= 0 |main_~#list~0.offset|) (= 0 |#NULL.base|) (not (= |main_~#list~0.base| 0)) (= |main_~#list~0.offset| 0) (= 0 (select (select |old(#memory_$Pointer$.base)| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (< main_~base~0 main_~hash~0) (< main_~hash~0 (+ main_~base~0 100)) (<= 0 (+ main_~base~0 2147483648)) (<= main_~hash~0 1000100) (<= 0 main_~base~0) (< |main_~#list~0.base| |#StackHeapBarrier|) (= (select (select |old(#memory_$Pointer$.offset)| |main_~#list~0.base|) |main_~#list~0.offset|) 0) (= 0 (select |old(#valid)| 0)) (<= main_~hash~0 2147483647) (<= 0 (+ main_~hash~0 2147483648)) (= |#NULL.offset| 0) (<= 0 main_~hash~0) (<= main_~base~0 2147483647))) (<= main_~base~0 1000000) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#list~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 03:52:43,324 INFO L193 IcfgInterpreter]: Reachable states at location L575 satisfy 1486#(and (or (and (<= 0 |main_~#list~0.offset|) (<= main_~base~0 1000099) (= 0 |#NULL.base|) (<= 0 (+ main_~base~0 2147483747)) (not (= |main_~#list~0.base| 0)) (= |main_~#list~0.offset| 0) (= 0 (select (select |old(#memory_$Pointer$.base)| |main_~#list~0.base|) |main_~#list~0.offset|)) (<= main_~base~0 1000000) (<= 0 (+ main_~base~0 99)) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (<= 0 (+ main_~base~0 2147483648)) (<= 0 main_~base~0) (<= |#NULL.base| 0) (< |main_~#list~0.base| |#StackHeapBarrier|) (= (select (select |old(#memory_$Pointer$.offset)| |main_~#list~0.base|) |main_~#list~0.offset|) 0) (= 0 (select |old(#valid)| 0)) (<= main_~base~0 2147483646) (= |#NULL.offset| 0) (<= main_~base~0 2147483647)) (and (<= 0 |main_~#list~0.offset|) (= 0 |#NULL.base|) (= |#length| (store |old(#length)| |main_~#list~0.base| 4)) (not (= |main_~#list~0.base| 0)) (= |main_~#list~0.offset| 0) (<= main_~base~0 1000000) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= 0 (+ main_~base~0 2147483648)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (<= 0 main_~base~0) (<= |#NULL.base| 0) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (< |main_~#list~0.base| |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |main_~#list~0.base| 1)) (= 0 (select |old(#valid)| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= main_~base~0 2147483647))) (<= main_~hash~0 2147483647) (<= 0 |#NULL.base|) (<= 0 (+ main_~hash~0 2147483648)) (<= |main_~#list~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 03:52:43,324 INFO L193 IcfgInterpreter]: Reachable states at location L576 satisfy 1549#(and (or (and (<= 0 |main_~#list~0.offset|) (= 0 |#NULL.base|) (= |#length| (store |old(#length)| |main_~#list~0.base| 4)) (<= 0 |#NULL.base|) (not (= |main_~#list~0.base| 0)) (= |main_~#list~0.offset| 0) (<= main_~base~0 1000000) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (< main_~base~0 main_~hash~0) (< main_~hash~0 (+ main_~base~0 100)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= 0 (+ main_~base~0 2147483648)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (<= 0 main_~base~0) (<= |#NULL.base| 0) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (< |main_~#list~0.base| |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |main_~#list~0.base| 1)) (= 0 (select |old(#valid)| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (<= main_~hash~0 2147483647) (<= 0 (+ main_~hash~0 2147483648)) (= |#memory_int| |old(#memory_int)|) (<= |main_~#list~0.offset| 0) (= |#NULL.offset| 0) (<= main_~base~0 2147483647)) (and (<= 0 |main_~#list~0.offset|) (<= main_~base~0 1000099) (= 0 |#NULL.base|) (<= 0 (+ main_~base~0 2147483747)) (<= 0 |#NULL.base|) (not (= |main_~#list~0.base| 0)) (= |main_~#list~0.offset| 0) (= 0 (select (select |old(#memory_$Pointer$.base)| |main_~#list~0.base|) |main_~#list~0.offset|)) (<= main_~base~0 1000000) (= 0 (select |old(#valid)| |main_~#list~0.base|)) (<= 0 (+ main_~base~0 99)) (< main_~base~0 main_~hash~0) (< main_~hash~0 (+ main_~base~0 100)) (<= 0 (+ main_~base~0 2147483648)) (<= 0 main_~base~0) (<= |#NULL.base| 0) (< |main_~#list~0.base| |#StackHeapBarrier|) (= (select (select |old(#memory_$Pointer$.offset)| |main_~#list~0.base|) |main_~#list~0.offset|) 0) (= 0 (select |old(#valid)| 0)) (<= main_~base~0 2147483646) (<= main_~hash~0 2147483647) (<= 0 (+ main_~hash~0 2147483648)) (<= |main_~#list~0.offset| 0) (= |#NULL.offset| 0) (<= main_~base~0 2147483647))) (<= 0 main_~hash~0) (<= main_~hash~0 1000100) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 03:52:43,776 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-10-07 03:52:44,085 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-10-07 03:52:44,398 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2019-10-07 03:52:44,871 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-10-07 03:52:45,060 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 39 [2019-10-07 03:52:45,303 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 38 [2019-10-07 03:52:45,933 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-10-07 03:52:45,936 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 03:52:45,936 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 16] total 30 [2019-10-07 03:52:45,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-07 03:52:45,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-07 03:52:45,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2019-10-07 03:52:45,940 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 30 states. [2019-10-07 03:52:46,238 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-10-07 03:52:46,505 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 73 [2019-10-07 03:52:46,753 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-10-07 03:52:47,231 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2019-10-07 03:52:48,007 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2019-10-07 03:52:48,306 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-10-07 03:52:48,667 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-10-07 03:52:48,941 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-10-07 03:52:49,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:52:49,297 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2019-10-07 03:52:49,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-07 03:52:49,298 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 22 [2019-10-07 03:52:49,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:52:49,300 INFO L225 Difference]: With dead ends: 76 [2019-10-07 03:52:49,300 INFO L226 Difference]: Without dead ends: 53 [2019-10-07 03:52:49,302 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=396, Invalid=1860, Unknown=0, NotChecked=0, Total=2256 [2019-10-07 03:52:49,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-07 03:52:49,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2019-10-07 03:52:49,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-07 03:52:49,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-10-07 03:52:49,311 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 22 [2019-10-07 03:52:49,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:52:49,311 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-10-07 03:52:49,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-07 03:52:49,312 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-10-07 03:52:49,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-07 03:52:49,313 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:52:49,313 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:52:49,519 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:52:49,519 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:52:49,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:52:49,520 INFO L82 PathProgramCache]: Analyzing trace with hash -874488367, now seen corresponding path program 1 times [2019-10-07 03:52:49,520 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:52:49,520 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:52:49,520 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:52:49,521 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:52:49,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:52:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:52:49,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:52:49,737 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:52:49,737 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:52:49,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:52:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:52:49,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-07 03:52:49,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:52:56,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:52:56,370 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:52:57,140 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-10-07 03:52:58,132 WARN L191 SmtUtils]: Spent 837.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-10-07 03:52:58,619 WARN L191 SmtUtils]: Spent 344.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-10-07 03:52:58,622 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-10-07 03:53:00,536 WARN L191 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 183 DAG size of output: 83 [2019-10-07 03:53:00,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:53:00,566 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 03:53:00,567 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-07 03:53:00,568 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 03:53:00,568 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 03:53:00,569 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 03:53:00,569 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 03:53:00,616 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-07 03:53:16,918 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:53:16,920 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) 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) Caused by: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) 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:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) 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:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) 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.quantifier(PartialQuantifierElimination.java:146) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:275) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:263) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:237) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:216) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarizeInternal(FixpointLoopSummarizer.java:118) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:178) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:169) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) ... 21 more [2019-10-07 03:53:16,926 INFO L168 Benchmark]: Toolchain (without parser) took 51270.70 ms. Allocated memory was 139.5 MB in the beginning and 774.9 MB in the end (delta: 635.4 MB). Free memory was 102.7 MB in the beginning and 203.4 MB in the end (delta: -100.7 MB). Peak memory consumption was 534.7 MB. Max. memory is 7.1 GB. [2019-10-07 03:53:16,926 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-10-07 03:53:16,926 INFO L168 Benchmark]: CACSL2BoogieTranslator took 712.93 ms. Allocated memory was 139.5 MB in the beginning and 205.0 MB in the end (delta: 65.5 MB). Free memory was 102.5 MB in the beginning and 170.5 MB in the end (delta: -68.0 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. [2019-10-07 03:53:16,927 INFO L168 Benchmark]: Boogie Preprocessor took 82.63 ms. Allocated memory is still 205.0 MB. Free memory was 170.5 MB in the beginning and 167.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-10-07 03:53:16,927 INFO L168 Benchmark]: RCFGBuilder took 769.87 ms. Allocated memory is still 205.0 MB. Free memory was 167.8 MB in the beginning and 119.3 MB in the end (delta: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 7.1 GB. [2019-10-07 03:53:16,927 INFO L168 Benchmark]: TraceAbstraction took 49700.33 ms. Allocated memory was 205.0 MB in the beginning and 774.9 MB in the end (delta: 569.9 MB). Free memory was 118.7 MB in the beginning and 203.4 MB in the end (delta: -84.7 MB). Peak memory consumption was 485.2 MB. Max. memory is 7.1 GB. [2019-10-07 03:53:16,928 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.20 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 712.93 ms. Allocated memory was 139.5 MB in the beginning and 205.0 MB in the end (delta: 65.5 MB). Free memory was 102.5 MB in the beginning and 170.5 MB in the end (delta: -68.0 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 82.63 ms. Allocated memory is still 205.0 MB. Free memory was 170.5 MB in the beginning and 167.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 769.87 ms. Allocated memory is still 205.0 MB. Free memory was 167.8 MB in the beginning and 119.3 MB in the end (delta: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 49700.33 ms. Allocated memory was 205.0 MB in the beginning and 774.9 MB in the end (delta: 569.9 MB). Free memory was 118.7 MB in the beginning and 203.4 MB in the end (delta: -84.7 MB). Peak memory consumption was 485.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...