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/forester-heap/sll-reverse_simple.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 03:50:12,736 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 03:50:12,740 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 03:50:12,757 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 03:50:12,758 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 03:50:12,760 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 03:50:12,762 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 03:50:12,771 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 03:50:12,776 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 03:50:12,779 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 03:50:12,781 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 03:50:12,782 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 03:50:12,782 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 03:50:12,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 03:50:12,786 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 03:50:12,788 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 03:50:12,789 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 03:50:12,791 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 03:50:12,792 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 03:50:12,797 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 03:50:12,801 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 03:50:12,804 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 03:50:12,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 03:50:12,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 03:50:12,810 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 03:50:12,810 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 03:50:12,810 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 03:50:12,812 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 03:50:12,813 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 03:50:12,814 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 03:50:12,814 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 03:50:12,815 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 03:50:12,816 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 03:50:12,817 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 03:50:12,818 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 03:50:12,818 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 03:50:12,819 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 03:50:12,819 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 03:50:12,819 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 03:50:12,820 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 03:50:12,821 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 03:50:12,822 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:50:12,854 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 03:50:12,854 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 03:50:12,855 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 03:50:12,855 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 03:50:12,856 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 03:50:12,856 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 03:50:12,856 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 03:50:12,860 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 03:50:12,861 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 03:50:12,861 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 03:50:12,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 03:50:12,861 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 03:50:12,861 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 03:50:12,861 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 03:50:12,862 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 03:50:12,862 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 03:50:12,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 03:50:12,862 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 03:50:12,863 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 03:50:12,863 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 03:50:12,863 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 03:50:12,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 03:50:12,864 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 03:50:12,864 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 03:50:12,864 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 03:50:12,864 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 03:50:12,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 03:50:12,865 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 03:50:12,865 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:50:13,151 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 03:50:13,163 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 03:50:13,167 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 03:50:13,168 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 03:50:13,168 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 03:50:13,169 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-reverse_simple.i [2019-10-07 03:50:13,232 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4abbb8655/1aaa4936459844abbbc4bd7ef4bc8a71/FLAG64e5be6af [2019-10-07 03:50:13,692 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 03:50:13,693 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-reverse_simple.i [2019-10-07 03:50:13,716 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4abbb8655/1aaa4936459844abbbc4bd7ef4bc8a71/FLAG64e5be6af [2019-10-07 03:50:13,986 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4abbb8655/1aaa4936459844abbbc4bd7ef4bc8a71 [2019-10-07 03:50:13,997 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 03:50:13,999 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 03:50:14,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 03:50:14,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 03:50:14,004 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 03:50:14,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:50:13" (1/1) ... [2019-10-07 03:50:14,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@442c89b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:50:14, skipping insertion in model container [2019-10-07 03:50:14,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:50:13" (1/1) ... [2019-10-07 03:50:14,015 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 03:50:14,051 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 03:50:14,483 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:50:14,498 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 03:50:14,541 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:50:14,599 INFO L192 MainTranslator]: Completed translation [2019-10-07 03:50:14,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:50:14 WrapperNode [2019-10-07 03:50:14,600 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 03:50:14,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 03:50:14,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 03:50:14,601 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 03:50:14,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:50:14" (1/1) ... [2019-10-07 03:50:14,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:50:14" (1/1) ... [2019-10-07 03:50:14,646 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:50:14" (1/1) ... [2019-10-07 03:50:14,646 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:50:14" (1/1) ... [2019-10-07 03:50:14,680 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:50:14" (1/1) ... [2019-10-07 03:50:14,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:50:14" (1/1) ... [2019-10-07 03:50:14,691 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:50:14" (1/1) ... [2019-10-07 03:50:14,697 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 03:50:14,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 03:50:14,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 03:50:14,697 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 03:50:14,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:50:14" (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:50:14,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 03:50:14,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 03:50:14,750 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 03:50:14,750 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-07 03:50:14,750 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-07 03:50:14,751 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-07 03:50:14,751 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-07 03:50:14,751 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-07 03:50:14,751 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-07 03:50:14,751 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-07 03:50:14,751 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-07 03:50:14,752 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-07 03:50:14,752 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-07 03:50:14,752 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-07 03:50:14,752 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-07 03:50:14,752 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-07 03:50:14,752 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-07 03:50:14,753 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-07 03:50:14,753 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-07 03:50:14,753 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-07 03:50:14,753 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-07 03:50:14,753 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-07 03:50:14,753 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-07 03:50:14,754 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-07 03:50:14,754 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-07 03:50:14,754 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-07 03:50:14,754 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-07 03:50:14,754 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-07 03:50:14,754 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-07 03:50:14,755 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-07 03:50:14,755 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-07 03:50:14,755 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-07 03:50:14,755 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-07 03:50:14,755 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-07 03:50:14,755 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-07 03:50:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-07 03:50:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-07 03:50:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-07 03:50:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-07 03:50:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-07 03:50:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-07 03:50:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-07 03:50:14,757 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-07 03:50:14,757 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-07 03:50:14,757 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-07 03:50:14,757 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-07 03:50:14,757 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-07 03:50:14,758 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-07 03:50:14,758 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-07 03:50:14,758 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-07 03:50:14,758 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-07 03:50:14,758 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-07 03:50:14,758 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-07 03:50:14,760 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 03:50:14,760 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-07 03:50:14,761 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-07 03:50:14,761 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-07 03:50:14,761 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-07 03:50:14,761 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-07 03:50:14,761 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-07 03:50:14,761 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-07 03:50:14,762 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-07 03:50:14,762 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-07 03:50:14,762 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-07 03:50:14,762 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-07 03:50:14,762 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-07 03:50:14,762 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 03:50:14,762 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-07 03:50:14,763 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-07 03:50:14,763 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-07 03:50:14,763 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-07 03:50:14,763 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-07 03:50:14,763 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-07 03:50:14,763 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-07 03:50:14,764 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-07 03:50:14,764 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-07 03:50:14,764 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-07 03:50:14,764 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-07 03:50:14,764 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-07 03:50:14,764 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-07 03:50:14,765 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-07 03:50:14,765 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-07 03:50:14,765 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-07 03:50:14,765 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-07 03:50:14,765 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-07 03:50:14,765 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-07 03:50:14,765 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-07 03:50:14,766 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-07 03:50:14,766 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-07 03:50:14,766 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-07 03:50:14,766 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-07 03:50:14,766 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-07 03:50:14,766 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-07 03:50:14,767 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-07 03:50:14,767 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-07 03:50:14,767 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-07 03:50:14,767 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-07 03:50:14,767 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-07 03:50:14,767 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-07 03:50:14,767 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-07 03:50:14,768 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-07 03:50:14,768 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-07 03:50:14,768 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-07 03:50:14,768 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-07 03:50:14,768 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-07 03:50:14,768 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-07 03:50:14,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 03:50:14,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 03:50:14,769 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 03:50:14,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 03:50:14,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 03:50:14,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 03:50:14,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 03:50:14,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 03:50:14,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 03:50:14,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 03:50:14,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 03:50:15,611 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 03:50:15,612 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-10-07 03:50:15,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:50:15 BoogieIcfgContainer [2019-10-07 03:50:15,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 03:50:15,615 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 03:50:15,615 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 03:50:15,618 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 03:50:15,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:50:13" (1/3) ... [2019-10-07 03:50:15,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e418046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:50:15, skipping insertion in model container [2019-10-07 03:50:15,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:50:14" (2/3) ... [2019-10-07 03:50:15,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e418046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:50:15, skipping insertion in model container [2019-10-07 03:50:15,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:50:15" (3/3) ... [2019-10-07 03:50:15,622 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-reverse_simple.i [2019-10-07 03:50:15,632 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 03:50:15,640 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-07 03:50:15,652 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-07 03:50:15,678 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 03:50:15,678 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 03:50:15,679 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 03:50:15,679 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 03:50:15,679 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 03:50:15,679 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 03:50:15,680 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 03:50:15,680 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 03:50:15,698 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-10-07 03:50:15,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-07 03:50:15,704 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:50:15,705 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:50:15,707 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:50:15,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:50:15,713 INFO L82 PathProgramCache]: Analyzing trace with hash 824743736, now seen corresponding path program 1 times [2019-10-07 03:50:15,720 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:50:15,720 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:50:15,721 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:50:15,721 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:50:15,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:50:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:50:15,889 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:50:15,890 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:50:15,892 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:50:15,893 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-07 03:50:15,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-07 03:50:15,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-07 03:50:15,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 03:50:15,915 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2019-10-07 03:50:15,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:50:15,947 INFO L93 Difference]: Finished difference Result 55 states and 83 transitions. [2019-10-07 03:50:15,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-07 03:50:15,948 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-10-07 03:50:15,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:50:15,964 INFO L225 Difference]: With dead ends: 55 [2019-10-07 03:50:15,964 INFO L226 Difference]: Without dead ends: 27 [2019-10-07 03:50:15,971 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:50:15,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-07 03:50:16,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-07 03:50:16,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-07 03:50:16,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-10-07 03:50:16,027 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2019-10-07 03:50:16,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:50:16,027 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-10-07 03:50:16,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-07 03:50:16,028 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-10-07 03:50:16,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 03:50:16,029 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:50:16,029 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:50:16,029 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:50:16,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:50:16,030 INFO L82 PathProgramCache]: Analyzing trace with hash 184584870, now seen corresponding path program 1 times [2019-10-07 03:50:16,031 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:50:16,031 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:50:16,031 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:50:16,031 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:50:16,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:50:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:50:16,212 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:50:16,213 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:50:16,213 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:50:16,213 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 03:50:16,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:50:16,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:50:16,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:50:16,216 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 5 states. [2019-10-07 03:50:16,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:50:16,402 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2019-10-07 03:50:16,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 03:50:16,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-10-07 03:50:16,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:50:16,404 INFO L225 Difference]: With dead ends: 56 [2019-10-07 03:50:16,405 INFO L226 Difference]: Without dead ends: 37 [2019-10-07 03:50:16,406 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-07 03:50:16,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-07 03:50:16,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2019-10-07 03:50:16,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-07 03:50:16,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-10-07 03:50:16,413 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 12 [2019-10-07 03:50:16,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:50:16,413 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-10-07 03:50:16,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:50:16,414 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-10-07 03:50:16,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 03:50:16,414 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:50:16,415 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:50:16,415 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:50:16,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:50:16,415 INFO L82 PathProgramCache]: Analyzing trace with hash 184583620, now seen corresponding path program 1 times [2019-10-07 03:50:16,416 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:50:16,416 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:50:16,416 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:50:16,416 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:50:16,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:50:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:50:16,476 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:50:16,477 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:50:16,479 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:50:16,480 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 03:50:16,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 03:50:16,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 03:50:16,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:50:16,481 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 4 states. [2019-10-07 03:50:16,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:50:16,573 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2019-10-07 03:50:16,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 03:50:16,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-07 03:50:16,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:50:16,575 INFO L225 Difference]: With dead ends: 51 [2019-10-07 03:50:16,575 INFO L226 Difference]: Without dead ends: 41 [2019-10-07 03:50:16,576 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:50:16,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-07 03:50:16,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2019-10-07 03:50:16,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-07 03:50:16,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2019-10-07 03:50:16,583 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 12 [2019-10-07 03:50:16,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:50:16,584 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2019-10-07 03:50:16,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 03:50:16,584 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2019-10-07 03:50:16,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-07 03:50:16,585 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:50:16,585 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:50:16,585 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:50:16,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:50:16,586 INFO L82 PathProgramCache]: Analyzing trace with hash 698560499, now seen corresponding path program 1 times [2019-10-07 03:50:16,586 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:50:16,586 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:50:16,586 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:50:16,587 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:50:16,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:50:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:50:16,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:50:16,746 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:50:16,746 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:50:16,746 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:50:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:50:16,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-07 03:50:16,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:50:16,963 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-07 03:50:16,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:16,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:16,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:50:16,992 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2019-10-07 03:50:16,992 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:17,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:17,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:50:17,016 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2019-10-07 03:50:17,016 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:17,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:17,027 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 03:50:17,027 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:54, output treesize:23 [2019-10-07 03:50:17,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:50:17,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:50:17,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:50:17,116 INFO L392 ElimStorePlain]: Different costs {0=[|#valid|], 1=[|v_#valid_28|]} [2019-10-07 03:50:17,135 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 03:50:17,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:17,147 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 03:50:17,147 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:17,418 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-10-07 03:50:17,418 INFO L567 ElimStorePlain]: treesize reduction 14, result has 92.1 percent of original size [2019-10-07 03:50:17,484 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:17,484 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-07 03:50:17,485 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:17,611 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-10-07 03:50:17,612 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:17,623 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_46|, |#memory_$Pointer$.offset|, v_prenex_1, |v_#memory_int_57|, v_prenex_2, |v_#memory_$Pointer$.offset_46|, |v_#memory_int_58|, v_prenex_4], 1=[|v_#memory_int_56|], 3=[v_prenex_3, v_prenex_5], 4=[|v_#memory_$Pointer$.offset_44|, |v_#memory_$Pointer$.base_44|]} [2019-10-07 03:50:17,623 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_46| vanished before elimination [2019-10-07 03:50:17,623 INFO L464 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2019-10-07 03:50:17,650 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-10-07 03:50:17,651 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:17,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:17,761 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:17,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:17,839 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:17,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:17,872 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_46| vanished before elimination [2019-10-07 03:50:17,886 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 18 treesize of output 7 [2019-10-07 03:50:17,886 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:17,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:17,924 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2019-10-07 03:50:17,924 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:17,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:17,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-10-07 03:50:17,948 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:17,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:17,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-10-07 03:50:17,968 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:17,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:17,989 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2019-10-07 03:50:17,990 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:18,006 INFO L567 ElimStorePlain]: treesize reduction 4, result has 84.6 percent of original size [2019-10-07 03:50:18,007 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_44| vanished before elimination [2019-10-07 03:50:18,007 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_44| vanished before elimination [2019-10-07 03:50:18,008 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, 13 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 03:50:18,008 INFO L221 ElimStorePlain]: Needed 12 recursive calls to eliminate 16 variables, input treesize:456, output treesize:23 [2019-10-07 03:50:18,046 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:18,046 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2019-10-07 03:50:18,047 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:18,066 INFO L567 ElimStorePlain]: treesize reduction 4, result has 69.2 percent of original size [2019-10-07 03:50:18,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 03:50:18,067 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:4 [2019-10-07 03:50:18,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:50:18,069 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:50:18,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:50:18,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:50:18,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:50:18,128 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_8, |v_#memory_$Pointer$.offset_48|, |v_#memory_int_57|, |#memory_int|], 2=[|v_#memory_$Pointer$.base_49|, |v_#memory_int_56|, v_prenex_6], 6=[v_prenex_9, v_prenex_7], 14=[|v_#memory_$Pointer$.offset_44|, |v_#memory_$Pointer$.base_44|]} [2019-10-07 03:50:18,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:18,172 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:18,666 WARN L191 SmtUtils]: Spent 493.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-10-07 03:50:18,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:18,681 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:18,953 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-10-07 03:50:18,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:18,965 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:19,228 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-10-07 03:50:19,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:19,254 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-07 03:50:19,265 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:19,266 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 119 [2019-10-07 03:50:19,267 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:19,519 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-10-07 03:50:19,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:19,526 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:50:19,693 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-10-07 03:50:19,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:19,706 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 111 treesize of output 105 [2019-10-07 03:50:19,707 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-07 03:50:19,833 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-10-07 03:50:19,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:19,841 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:50:19,845 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:50:19,967 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-10-07 03:50:19,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:19,990 INFO L496 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:50:19,995 INFO L496 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:50:20,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:20,065 INFO L496 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:50:20,070 INFO L496 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:50:20,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:20,143 INFO L496 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:50:20,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:20,198 INFO L496 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:50:20,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:50:20,261 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 11 dim-2 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2019-10-07 03:50:20,262 INFO L221 ElimStorePlain]: Needed 16 recursive calls to eliminate 12 variables, input treesize:454, output treesize:238 [2019-10-07 03:50:20,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:50:20,474 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 03:50:20,499 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-07 03:50:20,499 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 03:50:20,505 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 03:50:20,513 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 03:50:20,513 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 03:50:20,634 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-07 03:50:21,226 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 911 [2019-10-07 03:50:23,487 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 915 [2019-10-07 03:50:23,639 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 909 [2019-10-07 03:50:23,839 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 910 [2019-10-07 03:50:26,088 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 908 [2019-10-07 03:50:26,275 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 902 [2019-10-07 03:50:26,471 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 896 [2019-10-07 03:50:26,629 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 890 [2019-10-07 03:50:26,840 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 884 [2019-10-07 03:50:27,061 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 878 [2019-10-07 03:50:27,270 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 879 [2019-10-07 03:50:27,427 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 880 [2019-10-07 03:50:27,828 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 862 [2019-10-07 03:50:30,416 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 850 [2019-10-07 03:50:43,355 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 03:50:43,360 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 03:50:43,360 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 03:50:43,361 INFO L193 IcfgInterpreter]: Reachable states at location L995-3 satisfy 58#(exists ((v_DerPreprocessor_16 Int)) (or (and (= (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)))) |#memory_$Pointer$.offset|) (= 0 |#NULL.base|) (= |#memory_int| (store |old(#memory_int)| main_~head~0.base (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_DerPreprocessor_16) (+ main_~head~0.offset 4) 0))) (= main_~x~0.offset main_~head~0.offset) (= 0 |main_#t~malloc0.offset|) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem4.base|) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (<= 0 |#NULL.offset|) (= |main_#t~malloc0.base| main_~head~0.base) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (not (= 0 |main_#t~mem4.offset|)) (<= |main_#t~nondet5| 2147483647) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (= main_~head~0.base main_~x~0.base) (not (= |main_#t~malloc0.base| 0)) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|) (<= |#NULL.base| 0) (<= 0 (+ |main_#t~nondet5| 2147483648)) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) |main_#t~mem4.offset|) (= 0 |main_#t~nondet5|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (not |main_#t~short6|) (= main_~head~0.offset |main_#t~malloc0.offset|) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0)) (and (= (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)))) |#memory_$Pointer$.offset|) (= 0 |#NULL.base|) (= |#memory_int| (store |old(#memory_int)| main_~head~0.base (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_DerPreprocessor_16) (+ main_~head~0.offset 4) 0))) (= main_~x~0.offset main_~head~0.offset) (= 0 |main_#t~malloc0.offset|) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem4.base|) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (<= 0 |#NULL.offset|) (= |main_#t~malloc0.base| main_~head~0.base) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (not (= 0 |main_#t~mem4.offset|)) (<= |main_#t~nondet5| 2147483647) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (= main_~head~0.base main_~x~0.base) (not (= |main_#t~malloc0.base| 0)) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|) |main_#t~short6| (<= |#NULL.base| 0) (<= 0 (+ |main_#t~nondet5| 2147483648)) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) |main_#t~mem4.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~head~0.offset |main_#t~malloc0.offset|) (not (= 0 |main_#t~nondet5|)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0)) (and (= (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)))) |#memory_$Pointer$.offset|) (= 0 |#NULL.base|) (= |#memory_int| (store |old(#memory_int)| main_~head~0.base (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_DerPreprocessor_16) (+ main_~head~0.offset 4) 0))) (= main_~x~0.offset main_~head~0.offset) (= 0 |main_#t~malloc0.offset|) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem4.base|) (<= 0 |#NULL.base|) (not (= |main_#t~mem4.base| 0)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (<= 0 |#NULL.offset|) (= |main_#t~malloc0.base| main_~head~0.base) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (<= |main_#t~nondet5| 2147483647) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (= main_~head~0.base main_~x~0.base) (not (= |main_#t~malloc0.base| 0)) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|) (<= |#NULL.base| 0) (<= 0 (+ |main_#t~nondet5| 2147483648)) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) |main_#t~mem4.offset|) (= 0 |main_#t~nondet5|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (not |main_#t~short6|) (= main_~head~0.offset |main_#t~malloc0.offset|) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0)) (and (= (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)))) |#memory_$Pointer$.offset|) (= 0 |#NULL.base|) (= |#memory_int| (store |old(#memory_int)| main_~head~0.base (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_DerPreprocessor_16) (+ main_~head~0.offset 4) 0))) (= main_~x~0.offset main_~head~0.offset) (= 0 |main_#t~malloc0.offset|) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem4.base|) (<= 0 |#NULL.base|) (not (= |main_#t~mem4.base| 0)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (<= 0 |#NULL.offset|) (= |main_#t~malloc0.base| main_~head~0.base) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (<= |main_#t~nondet5| 2147483647) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (= main_~head~0.base main_~x~0.base) (not (= |main_#t~malloc0.base| 0)) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|) |main_#t~short6| (<= |#NULL.base| 0) (<= 0 (+ |main_#t~nondet5| 2147483648)) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) |main_#t~mem4.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~head~0.offset |main_#t~malloc0.offset|) (not (= 0 |main_#t~nondet5|)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0)) (and (= (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)))) |#memory_$Pointer$.offset|) (= 0 |#NULL.base|) (= |#memory_int| (store |old(#memory_int)| main_~head~0.base (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_DerPreprocessor_16) (+ main_~head~0.offset 4) 0))) (= main_~x~0.offset main_~head~0.offset) (= 0 |main_#t~malloc0.offset|) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem4.base|) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (<= 0 |#NULL.offset|) (= |main_#t~mem4.base| 0) (= |main_#t~malloc0.base| main_~head~0.base) (= 0 |main_#t~mem4.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (= main_~head~0.base main_~x~0.base) (not (= |main_#t~malloc0.base| 0)) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|) (<= |#NULL.base| 0) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) |main_#t~mem4.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (not |main_#t~short6|) (= main_~head~0.offset |main_#t~malloc0.offset|) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0)))) [2019-10-07 03:50:43,361 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 118#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 03:50:43,361 INFO L193 IcfgInterpreter]: Reachable states at location L1014-2 satisfy 90#true [2019-10-07 03:50:43,362 INFO L193 IcfgInterpreter]: Reachable states at location L991-1 satisfy 43#(and (<= 0 (+ |main_#t~nondet1| 2147483648)) (exists ((v_DerPreprocessor_16 Int)) (and (= (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)))) |#memory_$Pointer$.offset|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#memory_int| (store |old(#memory_int)| main_~head~0.base (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_DerPreprocessor_16) (+ main_~head~0.offset 4) 0))) (= 0 |main_#t~malloc0.offset|) (= main_~x~0.offset main_~head~0.offset) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= |main_#t~malloc0.base| main_~head~0.base) (= main_~head~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= main_~head~0.base main_~x~0.base) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|))) (<= |main_#t~nondet1| 2147483647)) [2019-10-07 03:50:43,362 INFO L193 IcfgInterpreter]: Reachable states at location L995-5 satisfy 53#(exists ((v_DerPreprocessor_16 Int)) (and (= (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)))) |#memory_$Pointer$.offset|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#memory_int| (store |old(#memory_int)| main_~head~0.base (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_DerPreprocessor_16) (+ main_~head~0.offset 4) 0))) (= main_~x~0.offset main_~head~0.offset) (= 0 |main_#t~malloc0.offset|) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= |main_#t~malloc0.base| main_~head~0.base) (= main_~head~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (= main_~head~0.base main_~x~0.base) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|))) [2019-10-07 03:50:43,362 INFO L193 IcfgInterpreter]: Reachable states at location L1035-3 satisfy 104#true [2019-10-07 03:50:43,362 INFO L193 IcfgInterpreter]: Reachable states at location L991-3 satisfy 38#(exists ((v_DerPreprocessor_16 Int)) (and (= (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)))) |#memory_$Pointer$.offset|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#memory_int| (store |old(#memory_int)| main_~head~0.base (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_DerPreprocessor_16) (+ main_~head~0.offset 4) 0))) (= 0 |main_#t~malloc0.offset|) (= main_~x~0.offset main_~head~0.offset) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= |main_#t~malloc0.base| main_~head~0.base) (= main_~head~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= main_~head~0.base main_~x~0.base) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|))) [2019-10-07 03:50:43,363 INFO L193 IcfgInterpreter]: Reachable states at location L1000-2 satisfy 68#(or (and (exists ((v_prenex_11 Int) (v_DerPreprocessor_16 Int) (v_prenex_10 Int)) (or (and (= (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)))) |#memory_$Pointer$.offset|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#memory_int| (store |old(#memory_int)| main_~head~0.base (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_DerPreprocessor_16) (+ main_~head~0.offset 4) 0))) (= main_~x~0.offset main_~head~0.offset) (= 0 |main_#t~malloc0.offset|) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= |main_#t~malloc0.base| main_~head~0.base) (= main_~head~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (= main_~head~0.base main_~x~0.base) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)) (and (= (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)))) |#memory_$Pointer$.offset|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~x~0.offset main_~head~0.offset) (= 0 |main_#t~malloc0.offset|) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= |main_#t~malloc0.base| main_~head~0.base) (= main_~head~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= |#memory_int| (store |old(#memory_int)| main_~head~0.base (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_prenex_10) (+ main_~head~0.offset 4) 0))) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (= main_~head~0.base main_~x~0.base) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)) (and (= (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)))) |#memory_$Pointer$.offset|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~x~0.offset main_~head~0.offset) (= 0 |main_#t~malloc0.offset|) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= |#memory_int| (store |old(#memory_int)| main_~head~0.base (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_prenex_11) (+ main_~head~0.offset 4) 0))) (= |main_#t~malloc0.base| main_~head~0.base) (= main_~head~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (= main_~head~0.base main_~x~0.base) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)))) (not (= 0 main_~x~0.base))) (and (exists ((v_prenex_11 Int) (v_DerPreprocessor_16 Int) (v_prenex_10 Int)) (or (and (= (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)))) |#memory_$Pointer$.offset|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#memory_int| (store |old(#memory_int)| main_~head~0.base (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_DerPreprocessor_16) (+ main_~head~0.offset 4) 0))) (= main_~x~0.offset main_~head~0.offset) (= 0 |main_#t~malloc0.offset|) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= |main_#t~malloc0.base| main_~head~0.base) (= main_~head~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (= main_~head~0.base main_~x~0.base) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)) (and (= (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)))) |#memory_$Pointer$.offset|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~x~0.offset main_~head~0.offset) (= 0 |main_#t~malloc0.offset|) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= |main_#t~malloc0.base| main_~head~0.base) (= main_~head~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= |#memory_int| (store |old(#memory_int)| main_~head~0.base (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_prenex_10) (+ main_~head~0.offset 4) 0))) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (= main_~head~0.base main_~x~0.base) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)) (and (= (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)))) |#memory_$Pointer$.offset|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~x~0.offset main_~head~0.offset) (= 0 |main_#t~malloc0.offset|) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= |#memory_int| (store |old(#memory_int)| main_~head~0.base (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_prenex_11) (+ main_~head~0.offset 4) 0))) (= |main_#t~malloc0.base| main_~head~0.base) (= main_~head~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (= main_~head~0.base main_~x~0.base) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)))) (not (= main_~x~0.offset 0)))) [2019-10-07 03:50:43,363 INFO L193 IcfgInterpreter]: Reachable states at location L991-4 satisfy 48#(exists ((v_DerPreprocessor_16 Int)) (and (= (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)))) |#memory_$Pointer$.offset|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#memory_int| (store |old(#memory_int)| main_~head~0.base (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_DerPreprocessor_16) (+ main_~head~0.offset 4) 0))) (= 0 |main_#t~malloc0.offset|) (= main_~x~0.offset main_~head~0.offset) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= |main_#t~malloc0.base| main_~head~0.base) (= main_~head~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= main_~head~0.base main_~x~0.base) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|))) [2019-10-07 03:50:43,363 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:50:43,363 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:50:43,364 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 123#(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:50:43,364 INFO L193 IcfgInterpreter]: Reachable states at location L1000-3 satisfy 63#(exists ((v_prenex_11 Int) (v_DerPreprocessor_16 Int) (v_prenex_10 Int)) (or (and (= (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)))) |#memory_$Pointer$.offset|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#memory_int| (store |old(#memory_int)| main_~head~0.base (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_DerPreprocessor_16) (+ main_~head~0.offset 4) 0))) (= main_~x~0.offset main_~head~0.offset) (= 0 |main_#t~malloc0.offset|) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= |main_#t~malloc0.base| main_~head~0.base) (= main_~head~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (= main_~head~0.base main_~x~0.base) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)) (and (= (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)))) |#memory_$Pointer$.offset|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~x~0.offset main_~head~0.offset) (= 0 |main_#t~malloc0.offset|) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= |main_#t~malloc0.base| main_~head~0.base) (= main_~head~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= |#memory_int| (store |old(#memory_int)| main_~head~0.base (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_prenex_10) (+ main_~head~0.offset 4) 0))) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (= main_~head~0.base main_~x~0.base) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)) (and (= (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)))) |#memory_$Pointer$.offset|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~x~0.offset main_~head~0.offset) (= 0 |main_#t~malloc0.offset|) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= |#memory_int| (store |old(#memory_int)| main_~head~0.base (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_prenex_11) (+ main_~head~0.offset 4) 0))) (= |main_#t~malloc0.base| main_~head~0.base) (= main_~head~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (= main_~head~0.base main_~x~0.base) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)))) [2019-10-07 03:50:43,364 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 03:50:43,367 INFO L193 IcfgInterpreter]: Reachable states at location L1000-4 satisfy 73#(or (and (exists ((v_prenex_11 Int) (v_DerPreprocessor_16 Int) (v_prenex_10 Int)) (or (and (= (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)))) |#memory_$Pointer$.offset|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#memory_int| (store |old(#memory_int)| main_~head~0.base (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_DerPreprocessor_16) (+ main_~head~0.offset 4) 0))) (= main_~x~0.offset main_~head~0.offset) (= 0 |main_#t~malloc0.offset|) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= |main_#t~malloc0.base| main_~head~0.base) (= main_~head~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (= main_~head~0.base main_~x~0.base) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)) (and (= (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)))) |#memory_$Pointer$.offset|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~x~0.offset main_~head~0.offset) (= 0 |main_#t~malloc0.offset|) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= |main_#t~malloc0.base| main_~head~0.base) (= main_~head~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= |#memory_int| (store |old(#memory_int)| main_~head~0.base (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_prenex_10) (+ main_~head~0.offset 4) 0))) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (= main_~head~0.base main_~x~0.base) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)) (and (= (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)))) |#memory_$Pointer$.offset|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~x~0.offset main_~head~0.offset) (= 0 |main_#t~malloc0.offset|) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= |#memory_int| (store |old(#memory_int)| main_~head~0.base (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_prenex_11) (+ main_~head~0.offset 4) 0))) (= |main_#t~malloc0.base| main_~head~0.base) (= main_~head~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (= main_~head~0.base main_~x~0.base) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)))) (not (= 0 main_~x~0.base))) (and (exists ((v_prenex_11 Int) (v_DerPreprocessor_16 Int) (v_prenex_10 Int)) (or (and (= (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)))) |#memory_$Pointer$.offset|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#memory_int| (store |old(#memory_int)| main_~head~0.base (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_DerPreprocessor_16) (+ main_~head~0.offset 4) 0))) (= main_~x~0.offset main_~head~0.offset) (= 0 |main_#t~malloc0.offset|) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= |main_#t~malloc0.base| main_~head~0.base) (= main_~head~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (= main_~head~0.base main_~x~0.base) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)) (and (= (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)))) |#memory_$Pointer$.offset|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~x~0.offset main_~head~0.offset) (= 0 |main_#t~malloc0.offset|) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= |main_#t~malloc0.base| main_~head~0.base) (= main_~head~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= |#memory_int| (store |old(#memory_int)| main_~head~0.base (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_prenex_10) (+ main_~head~0.offset 4) 0))) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (= main_~head~0.base main_~x~0.base) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)) (and (= (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)))) |#memory_$Pointer$.offset|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~x~0.offset main_~head~0.offset) (= 0 |main_#t~malloc0.offset|) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= |#memory_int| (store |old(#memory_int)| main_~head~0.base (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_prenex_11) (+ main_~head~0.offset 4) 0))) (= |main_#t~malloc0.base| main_~head~0.base) (= main_~head~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (= main_~head~0.base main_~x~0.base) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)))) (not (= main_~x~0.offset 0)))) [2019-10-07 03:50:43,368 INFO L193 IcfgInterpreter]: Reachable states at location L1029-2 satisfy 95#(and (= main_~prev~0.base main_~head~0.base) (= main_~head~0.offset main_~prev~0.offset) (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base)) [2019-10-07 03:50:43,368 INFO L193 IcfgInterpreter]: Reachable states at location mainErr2ASSERT_VIOLATIONERROR_FUNCTION satisfy 114#(and (<= 2 main_~t1~0) (or (and (= main_~prev~0.base main_~head~0.base) (not (= main_~x~0.offset 0)) (= main_~head~0.offset main_~prev~0.offset) (= main_~x~0.offset main_~head~0.offset) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) main_~t1~0) (not (= 1 main_~t2~0)) (= main_~head~0.base main_~x~0.base) (= main_~t2~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 4))) (= 2 main_~t1~0)) (and (= main_~prev~0.base main_~head~0.base) (= main_~head~0.offset main_~prev~0.offset) (not (= 0 main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) main_~t1~0) (not (= 1 main_~t2~0)) (= main_~head~0.base main_~x~0.base) (= main_~t2~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 4))) (= 2 main_~t1~0))) (<= main_~t1~0 2)) [2019-10-07 03:50:43,368 INFO L193 IcfgInterpreter]: Reachable states at location L1035 satisfy 109#(and (<= 2 main_~t1~0) (or (and (= main_~prev~0.base main_~head~0.base) (not (= main_~x~0.offset 0)) (= main_~head~0.offset main_~prev~0.offset) (= main_~x~0.offset main_~head~0.offset) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) main_~t1~0) (not (= 1 main_~t2~0)) (= main_~head~0.base main_~x~0.base) (= main_~t2~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 4))) (= 2 main_~t1~0)) (and (= main_~prev~0.base main_~head~0.base) (= main_~head~0.offset main_~prev~0.offset) (not (= 0 main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) main_~t1~0) (not (= 1 main_~t2~0)) (= main_~head~0.base main_~x~0.base) (= main_~t2~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 4))) (= 2 main_~t1~0))) (<= main_~t1~0 2)) [2019-10-07 03:50:43,513 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-10-07 03:50:44,134 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 03:50:44,134 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 10] total 20 [2019-10-07 03:50:44,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-07 03:50:44,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-07 03:50:44,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-10-07 03:50:44,137 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 20 states. [2019-10-07 03:50:44,508 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 126 [2019-10-07 03:50:44,943 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 124 [2019-10-07 03:50:45,547 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 68 [2019-10-07 03:50:47,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:50:47,630 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2019-10-07 03:50:47,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-07 03:50:47,636 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 18 [2019-10-07 03:50:47,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:50:47,637 INFO L225 Difference]: With dead ends: 76 [2019-10-07 03:50:47,637 INFO L226 Difference]: Without dead ends: 70 [2019-10-07 03:50:47,641 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2019-10-07 03:50:47,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-07 03:50:47,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 46. [2019-10-07 03:50:47,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-07 03:50:47,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2019-10-07 03:50:47,663 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 18 [2019-10-07 03:50:47,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:50:47,663 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2019-10-07 03:50:47,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-07 03:50:47,663 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2019-10-07 03:50:47,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-07 03:50:47,666 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:50:47,666 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:50:47,873 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:50:47,874 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:50:47,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:50:47,875 INFO L82 PathProgramCache]: Analyzing trace with hash 111266347, now seen corresponding path program 2 times [2019-10-07 03:50:47,875 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:50:47,875 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:50:47,875 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:50:47,875 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:50:47,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:50:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:50:48,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:50:48,191 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:50:48,191 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:50:48,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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:50:48,504 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-07 03:50:48,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 03:50:48,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-07 03:50:48,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:50:48,611 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 03:50:48,622 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 03:50:48,909 WARN L191 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-10-07 03:50:49,043 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-10-07 03:50:49,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:50:49,983 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:50:51,533 WARN L191 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 151 [2019-10-07 03:50:52,560 WARN L191 SmtUtils]: Spent 927.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-10-07 03:50:53,300 WARN L191 SmtUtils]: Spent 725.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2019-10-07 03:50:53,596 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-10-07 03:50:53,888 WARN L191 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-10-07 03:50:54,191 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-10-07 03:50:55,620 WARN L191 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 168 DAG size of output: 133 [2019-10-07 03:50:56,493 WARN L191 SmtUtils]: Spent 835.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 132 [2019-10-07 03:50:56,775 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2019-10-07 03:50:57,141 WARN L191 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-10-07 03:50:57,343 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:50:57,344 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.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) 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:50:57,357 INFO L168 Benchmark]: Toolchain (without parser) took 43352.18 ms. Allocated memory was 146.3 MB in the beginning and 450.9 MB in the end (delta: 304.6 MB). Free memory was 103.0 MB in the beginning and 148.6 MB in the end (delta: -45.6 MB). Peak memory consumption was 321.2 MB. Max. memory is 7.1 GB. [2019-10-07 03:50:57,358 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 146.3 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:50:57,359 INFO L168 Benchmark]: CACSL2BoogieTranslator took 600.24 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 102.5 MB in the beginning and 169.9 MB in the end (delta: -67.4 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-10-07 03:50:57,361 INFO L168 Benchmark]: Boogie Preprocessor took 96.00 ms. Allocated memory is still 202.9 MB. Free memory was 169.9 MB in the beginning and 166.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-10-07 03:50:57,361 INFO L168 Benchmark]: RCFGBuilder took 916.66 ms. Allocated memory is still 202.9 MB. Free memory was 166.9 MB in the beginning and 103.4 MB in the end (delta: 63.6 MB). Peak memory consumption was 63.6 MB. Max. memory is 7.1 GB. [2019-10-07 03:50:57,362 INFO L168 Benchmark]: TraceAbstraction took 41734.50 ms. Allocated memory was 202.9 MB in the beginning and 450.9 MB in the end (delta: 248.0 MB). Free memory was 103.4 MB in the beginning and 148.6 MB in the end (delta: -45.2 MB). Peak memory consumption was 265.0 MB. Max. memory is 7.1 GB. [2019-10-07 03:50:57,368 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 146.3 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 600.24 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 102.5 MB in the beginning and 169.9 MB in the end (delta: -67.4 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 96.00 ms. Allocated memory is still 202.9 MB. Free memory was 169.9 MB in the beginning and 166.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 916.66 ms. Allocated memory is still 202.9 MB. Free memory was 166.9 MB in the beginning and 103.4 MB in the end (delta: 63.6 MB). Peak memory consumption was 63.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 41734.50 ms. Allocated memory was 202.9 MB in the beginning and 450.9 MB in the end (delta: 248.0 MB). Free memory was 103.4 MB in the beginning and 148.6 MB in the end (delta: -45.2 MB). Peak memory consumption was 265.0 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...