java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:09:42,193 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:09:42,195 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:09:42,208 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:09:42,209 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:09:42,210 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:09:42,213 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:09:42,215 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:09:42,217 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:09:42,218 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:09:42,219 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:09:42,219 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:09:42,220 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:09:42,221 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:09:42,222 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:09:42,223 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:09:42,224 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:09:42,226 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:09:42,230 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:09:42,231 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:09:42,232 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:09:42,237 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:09:42,243 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:09:42,243 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:09:42,244 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:09:42,245 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:09:42,246 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:09:42,248 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:09:42,249 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:09:42,252 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:09:42,252 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:09:42,254 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:09:42,254 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:09:42,254 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:09:42,255 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:09:42,255 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:09:42,256 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 19:09:42,274 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:09:42,275 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:09:42,275 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:09:42,276 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:09:42,276 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:09:42,276 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:09:42,277 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:09:42,277 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:09:42,277 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:09:42,277 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:09:42,278 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:09:42,278 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:09:42,278 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:09:42,278 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:09:42,278 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:09:42,278 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:09:42,279 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:09:42,279 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:09:42,279 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:09:42,279 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:09:42,279 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:09:42,280 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:09:42,280 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:09:42,280 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:09:42,280 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:09:42,280 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:09:42,281 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:09:42,281 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:09:42,281 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:09:42,281 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:09:42,281 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:09:42,333 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:09:42,349 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:09:42,354 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:09:42,356 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:09:42,356 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:09:42,357 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i [2018-11-14 19:09:42,429 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6827ee63/b1574af6c8664f9b8d4b4e5697f15e51/FLAGb92c69a8e [2018-11-14 19:09:42,929 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:09:42,930 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i [2018-11-14 19:09:42,944 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6827ee63/b1574af6c8664f9b8d4b4e5697f15e51/FLAGb92c69a8e [2018-11-14 19:09:42,957 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6827ee63/b1574af6c8664f9b8d4b4e5697f15e51 [2018-11-14 19:09:42,966 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:09:42,968 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:09:42,969 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:09:42,969 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:09:42,973 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:09:42,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:09:42" (1/1) ... [2018-11-14 19:09:42,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d822f86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:09:42, skipping insertion in model container [2018-11-14 19:09:42,977 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:09:42" (1/1) ... [2018-11-14 19:09:42,988 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:09:43,036 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:09:43,391 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:09:43,402 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:09:43,493 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:09:43,567 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:09:43,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:09:43 WrapperNode [2018-11-14 19:09:43,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:09:43,568 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:09:43,569 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:09:43,569 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:09:43,656 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:09:43" (1/1) ... [2018-11-14 19:09:43,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:09:43" (1/1) ... [2018-11-14 19:09:43,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:09:43" (1/1) ... [2018-11-14 19:09:43,672 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:09:43" (1/1) ... [2018-11-14 19:09:43,707 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:09:43" (1/1) ... [2018-11-14 19:09:43,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:09:43" (1/1) ... [2018-11-14 19:09:43,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:09:43" (1/1) ... [2018-11-14 19:09:43,722 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:09:43,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:09:43,723 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:09:43,723 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:09:43,724 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:09:43" (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 [2018-11-14 19:09:43,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:09:43,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:09:43,794 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-14 19:09:43,795 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:09:43,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:09:43,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 19:09:43,795 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 19:09:43,795 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 19:09:43,795 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 19:09:43,796 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 19:09:43,796 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 19:09:43,796 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 19:09:43,796 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 19:09:43,796 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 19:09:43,796 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 19:09:43,797 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 19:09:43,797 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 19:09:43,797 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 19:09:43,797 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 19:09:43,797 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 19:09:43,798 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 19:09:43,798 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 19:09:43,798 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 19:09:43,798 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 19:09:43,798 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 19:09:43,798 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 19:09:43,798 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 19:09:43,798 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 19:09:43,799 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 19:09:43,799 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 19:09:43,799 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 19:09:43,799 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 19:09:43,799 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 19:09:43,799 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 19:09:43,799 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 19:09:43,800 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 19:09:43,800 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 19:09:43,800 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 19:09:43,800 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 19:09:43,800 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 19:09:43,800 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 19:09:43,801 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 19:09:43,801 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 19:09:43,801 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 19:09:43,801 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 19:09:43,801 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 19:09:43,801 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 19:09:43,801 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 19:09:43,802 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 19:09:43,802 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 19:09:43,802 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 19:09:43,802 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 19:09:43,802 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 19:09:43,802 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 19:09:43,802 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 19:09:43,803 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 19:09:43,803 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 19:09:43,803 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 19:09:43,803 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 19:09:43,803 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 19:09:43,803 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 19:09:43,804 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 19:09:43,804 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 19:09:43,804 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 19:09:43,804 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 19:09:43,804 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 19:09:43,804 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 19:09:43,804 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 19:09:43,805 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 19:09:43,805 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 19:09:43,805 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-11-14 19:09:43,805 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 19:09:43,805 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 19:09:43,805 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 19:09:43,805 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 19:09:43,806 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 19:09:43,806 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 19:09:43,806 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 19:09:43,806 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 19:09:43,806 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 19:09:43,806 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 19:09:43,807 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 19:09:43,807 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 19:09:43,807 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 19:09:43,807 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 19:09:43,807 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 19:09:43,807 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 19:09:43,807 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 19:09:43,808 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 19:09:43,808 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 19:09:43,808 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 19:09:43,808 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 19:09:43,808 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 19:09:43,808 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 19:09:43,809 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 19:09:43,809 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 19:09:43,809 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 19:09:43,809 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 19:09:43,809 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 19:09:43,809 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 19:09:43,810 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 19:09:43,810 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 19:09:43,810 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 19:09:43,810 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 19:09:43,810 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 19:09:43,810 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 19:09:43,811 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 19:09:43,811 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:09:43,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 19:09:43,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 19:09:43,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 19:09:43,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 19:09:43,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 19:09:43,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 19:09:43,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:09:43,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:09:43,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 19:09:44,632 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:09:44,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:09:44 BoogieIcfgContainer [2018-11-14 19:09:44,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:09:44,634 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:09:44,634 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:09:44,637 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:09:44,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:09:42" (1/3) ... [2018-11-14 19:09:44,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b55dde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:09:44, skipping insertion in model container [2018-11-14 19:09:44,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:09:43" (2/3) ... [2018-11-14 19:09:44,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b55dde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:09:44, skipping insertion in model container [2018-11-14 19:09:44,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:09:44" (3/3) ... [2018-11-14 19:09:44,640 INFO L112 eAbstractionObserver]: Analyzing ICFG alternating_list_false-unreach-call_false-valid-memcleanup.i [2018-11-14 19:09:44,649 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:09:44,657 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 19:09:44,673 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 19:09:44,705 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:09:44,706 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:09:44,706 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:09:44,706 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:09:44,706 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:09:44,707 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:09:44,707 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:09:44,707 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:09:44,708 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:09:44,731 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-14 19:09:44,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 19:09:44,737 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:09:44,739 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:09:44,741 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:09:44,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:09:44,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1673529273, now seen corresponding path program 1 times [2018-11-14 19:09:44,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:09:44,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:09:44,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:09:44,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:09:44,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:09:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:09:44,934 INFO L256 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {41#true} is VALID [2018-11-14 19:09:44,939 INFO L273 TraceCheckUtils]: 1: Hoare triple {41#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {41#true} is VALID [2018-11-14 19:09:44,939 INFO L273 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2018-11-14 19:09:44,940 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #103#return; {41#true} is VALID [2018-11-14 19:09:44,940 INFO L256 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret10 := main(); {41#true} is VALID [2018-11-14 19:09:44,941 INFO L273 TraceCheckUtils]: 5: Hoare triple {41#true} ~flag~0 := 1;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {41#true} is VALID [2018-11-14 19:09:44,941 INFO L273 TraceCheckUtils]: 6: Hoare triple {41#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {41#true} is VALID [2018-11-14 19:09:44,941 INFO L273 TraceCheckUtils]: 7: Hoare triple {41#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {41#true} is VALID [2018-11-14 19:09:44,955 INFO L273 TraceCheckUtils]: 8: Hoare triple {41#true} assume !true; {42#false} is VALID [2018-11-14 19:09:44,955 INFO L273 TraceCheckUtils]: 9: Hoare triple {42#false} call write~int(3, ~p~0.base, ~p~0.offset + 0, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~flag~0 := 1; {42#false} is VALID [2018-11-14 19:09:44,956 INFO L273 TraceCheckUtils]: 10: Hoare triple {42#false} assume true; {42#false} is VALID [2018-11-14 19:09:44,956 INFO L273 TraceCheckUtils]: 11: Hoare triple {42#false} call #t~mem4 := read~int(~p~0.base, ~p~0.offset + 0, 4); {42#false} is VALID [2018-11-14 19:09:44,956 INFO L273 TraceCheckUtils]: 12: Hoare triple {42#false} assume !!(#t~mem4 != 3);havoc #t~mem4; {42#false} is VALID [2018-11-14 19:09:44,957 INFO L273 TraceCheckUtils]: 13: Hoare triple {42#false} assume !(~flag~0 != 0);~flag~0 := 1;call #t~mem6 := read~int(~p~0.base, ~p~0.offset + 0, 4); {42#false} is VALID [2018-11-14 19:09:44,957 INFO L273 TraceCheckUtils]: 14: Hoare triple {42#false} assume #t~mem6 != 2;havoc #t~mem6; {42#false} is VALID [2018-11-14 19:09:44,957 INFO L273 TraceCheckUtils]: 15: Hoare triple {42#false} assume !false; {42#false} is VALID [2018-11-14 19:09:44,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:09:44,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:09:44,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 19:09:44,971 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 19:09:44,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:09:44,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 19:09:45,096 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:09:45,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 19:09:45,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 19:09:45,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:09:45,108 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-11-14 19:09:45,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:09:45,558 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2018-11-14 19:09:45,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 19:09:45,558 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 19:09:45,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:09:45,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:09:45,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 73 transitions. [2018-11-14 19:09:45,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:09:45,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 73 transitions. [2018-11-14 19:09:45,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 73 transitions. [2018-11-14 19:09:46,031 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:09:46,043 INFO L225 Difference]: With dead ends: 57 [2018-11-14 19:09:46,043 INFO L226 Difference]: Without dead ends: 25 [2018-11-14 19:09:46,046 INFO L604 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 [2018-11-14 19:09:46,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-14 19:09:46,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-14 19:09:46,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:09:46,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-14 19:09:46,091 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-14 19:09:46,092 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-14 19:09:46,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:09:46,098 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2018-11-14 19:09:46,098 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-14 19:09:46,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:09:46,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:09:46,099 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-14 19:09:46,099 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-14 19:09:46,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:09:46,106 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2018-11-14 19:09:46,106 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-14 19:09:46,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:09:46,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:09:46,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:09:46,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:09:46,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 19:09:46,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-11-14 19:09:46,118 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 16 [2018-11-14 19:09:46,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:09:46,119 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-14 19:09:46,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 19:09:46,119 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-14 19:09:46,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 19:09:46,124 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:09:46,124 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:09:46,124 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:09:46,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:09:46,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1336387516, now seen corresponding path program 1 times [2018-11-14 19:09:46,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:09:46,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:09:46,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:09:46,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:09:46,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:09:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:09:46,219 INFO L256 TraceCheckUtils]: 0: Hoare triple {198#true} call ULTIMATE.init(); {198#true} is VALID [2018-11-14 19:09:46,220 INFO L273 TraceCheckUtils]: 1: Hoare triple {198#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {198#true} is VALID [2018-11-14 19:09:46,220 INFO L273 TraceCheckUtils]: 2: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-14 19:09:46,220 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {198#true} {198#true} #103#return; {198#true} is VALID [2018-11-14 19:09:46,220 INFO L256 TraceCheckUtils]: 4: Hoare triple {198#true} call #t~ret10 := main(); {198#true} is VALID [2018-11-14 19:09:46,221 INFO L273 TraceCheckUtils]: 5: Hoare triple {198#true} ~flag~0 := 1;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {198#true} is VALID [2018-11-14 19:09:46,221 INFO L273 TraceCheckUtils]: 6: Hoare triple {198#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {198#true} is VALID [2018-11-14 19:09:46,221 INFO L273 TraceCheckUtils]: 7: Hoare triple {198#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {198#true} is VALID [2018-11-14 19:09:46,221 INFO L273 TraceCheckUtils]: 8: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-14 19:09:46,222 INFO L273 TraceCheckUtils]: 9: Hoare triple {198#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {198#true} is VALID [2018-11-14 19:09:46,222 INFO L273 TraceCheckUtils]: 10: Hoare triple {198#true} assume !(#t~nondet1 != 0);havoc #t~nondet1; {198#true} is VALID [2018-11-14 19:09:46,223 INFO L273 TraceCheckUtils]: 11: Hoare triple {198#true} call write~int(3, ~p~0.base, ~p~0.offset + 0, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~flag~0 := 1; {200#(= main_~flag~0 1)} is VALID [2018-11-14 19:09:46,225 INFO L273 TraceCheckUtils]: 12: Hoare triple {200#(= main_~flag~0 1)} assume true; {200#(= main_~flag~0 1)} is VALID [2018-11-14 19:09:46,228 INFO L273 TraceCheckUtils]: 13: Hoare triple {200#(= main_~flag~0 1)} call #t~mem4 := read~int(~p~0.base, ~p~0.offset + 0, 4); {200#(= main_~flag~0 1)} is VALID [2018-11-14 19:09:46,229 INFO L273 TraceCheckUtils]: 14: Hoare triple {200#(= main_~flag~0 1)} assume !!(#t~mem4 != 3);havoc #t~mem4; {200#(= main_~flag~0 1)} is VALID [2018-11-14 19:09:46,231 INFO L273 TraceCheckUtils]: 15: Hoare triple {200#(= main_~flag~0 1)} assume !(~flag~0 != 0);~flag~0 := 1;call #t~mem6 := read~int(~p~0.base, ~p~0.offset + 0, 4); {199#false} is VALID [2018-11-14 19:09:46,231 INFO L273 TraceCheckUtils]: 16: Hoare triple {199#false} assume #t~mem6 != 2;havoc #t~mem6; {199#false} is VALID [2018-11-14 19:09:46,231 INFO L273 TraceCheckUtils]: 17: Hoare triple {199#false} assume !false; {199#false} is VALID [2018-11-14 19:09:46,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:09:46,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:09:46,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 19:09:46,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-14 19:09:46,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:09:46,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 19:09:46,297 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:09:46,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 19:09:46,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 19:09:46,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:09:46,298 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 3 states. [2018-11-14 19:09:46,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:09:46,560 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2018-11-14 19:09:46,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 19:09:46,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-14 19:09:46,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:09:46,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:09:46,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2018-11-14 19:09:46,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:09:46,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2018-11-14 19:09:46,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 67 transitions. [2018-11-14 19:09:46,788 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:09:46,790 INFO L225 Difference]: With dead ends: 57 [2018-11-14 19:09:46,790 INFO L226 Difference]: Without dead ends: 40 [2018-11-14 19:09:46,791 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:09:46,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-14 19:09:46,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-11-14 19:09:46,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:09:46,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 37 states. [2018-11-14 19:09:46,817 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 37 states. [2018-11-14 19:09:46,818 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 37 states. [2018-11-14 19:09:46,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:09:46,821 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-14 19:09:46,821 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-14 19:09:46,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:09:46,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:09:46,822 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 40 states. [2018-11-14 19:09:46,823 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 40 states. [2018-11-14 19:09:46,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:09:46,826 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-14 19:09:46,826 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-14 19:09:46,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:09:46,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:09:46,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:09:46,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:09:46,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 19:09:46,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-11-14 19:09:46,830 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 18 [2018-11-14 19:09:46,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:09:46,831 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-11-14 19:09:46,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 19:09:46,831 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-14 19:09:46,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 19:09:46,832 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:09:46,832 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:09:46,832 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:09:46,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:09:46,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1336380572, now seen corresponding path program 1 times [2018-11-14 19:09:46,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:09:46,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:09:46,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:09:46,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:09:46,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:09:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:09:46,987 INFO L256 TraceCheckUtils]: 0: Hoare triple {399#true} call ULTIMATE.init(); {399#true} is VALID [2018-11-14 19:09:46,987 INFO L273 TraceCheckUtils]: 1: Hoare triple {399#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {399#true} is VALID [2018-11-14 19:09:46,988 INFO L273 TraceCheckUtils]: 2: Hoare triple {399#true} assume true; {399#true} is VALID [2018-11-14 19:09:46,988 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {399#true} {399#true} #103#return; {399#true} is VALID [2018-11-14 19:09:46,988 INFO L256 TraceCheckUtils]: 4: Hoare triple {399#true} call #t~ret10 := main(); {399#true} is VALID [2018-11-14 19:09:46,988 INFO L273 TraceCheckUtils]: 5: Hoare triple {399#true} ~flag~0 := 1;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {399#true} is VALID [2018-11-14 19:09:46,989 INFO L273 TraceCheckUtils]: 6: Hoare triple {399#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {399#true} is VALID [2018-11-14 19:09:46,989 INFO L273 TraceCheckUtils]: 7: Hoare triple {399#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {401#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:09:46,994 INFO L273 TraceCheckUtils]: 8: Hoare triple {401#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {401#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:09:47,003 INFO L273 TraceCheckUtils]: 9: Hoare triple {401#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {401#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:09:47,004 INFO L273 TraceCheckUtils]: 10: Hoare triple {401#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(#t~nondet1 != 0);havoc #t~nondet1; {401#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:09:47,005 INFO L273 TraceCheckUtils]: 11: Hoare triple {401#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~int(3, ~p~0.base, ~p~0.offset + 0, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~flag~0 := 1; {402#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:09:47,006 INFO L273 TraceCheckUtils]: 12: Hoare triple {402#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {402#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:09:47,007 INFO L273 TraceCheckUtils]: 13: Hoare triple {402#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem4 := read~int(~p~0.base, ~p~0.offset + 0, 4); {403#(= |main_#t~mem4| 3)} is VALID [2018-11-14 19:09:47,008 INFO L273 TraceCheckUtils]: 14: Hoare triple {403#(= |main_#t~mem4| 3)} assume !!(#t~mem4 != 3);havoc #t~mem4; {400#false} is VALID [2018-11-14 19:09:47,008 INFO L273 TraceCheckUtils]: 15: Hoare triple {400#false} assume ~flag~0 != 0;~flag~0 := 0;call #t~mem5 := read~int(~p~0.base, ~p~0.offset + 0, 4); {400#false} is VALID [2018-11-14 19:09:47,009 INFO L273 TraceCheckUtils]: 16: Hoare triple {400#false} assume #t~mem5 != 1;havoc #t~mem5; {400#false} is VALID [2018-11-14 19:09:47,010 INFO L273 TraceCheckUtils]: 17: Hoare triple {400#false} assume !false; {400#false} is VALID [2018-11-14 19:09:47,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:09:47,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:09:47,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 19:09:47,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-14 19:09:47,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:09:47,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:09:47,096 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:09:47,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:09:47,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:09:47,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:09:47,096 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 5 states. [2018-11-14 19:09:47,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:09:47,421 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2018-11-14 19:09:47,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:09:47,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-14 19:09:47,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:09:47,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:09:47,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2018-11-14 19:09:47,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:09:47,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2018-11-14 19:09:47,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2018-11-14 19:09:47,529 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:09:47,532 INFO L225 Difference]: With dead ends: 70 [2018-11-14 19:09:47,532 INFO L226 Difference]: Without dead ends: 52 [2018-11-14 19:09:47,533 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:09:47,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-14 19:09:47,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2018-11-14 19:09:47,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:09:47,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 40 states. [2018-11-14 19:09:47,553 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 40 states. [2018-11-14 19:09:47,553 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 40 states. [2018-11-14 19:09:47,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:09:47,557 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-11-14 19:09:47,557 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-11-14 19:09:47,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:09:47,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:09:47,558 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 52 states. [2018-11-14 19:09:47,558 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 52 states. [2018-11-14 19:09:47,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:09:47,562 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-11-14 19:09:47,562 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-11-14 19:09:47,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:09:47,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:09:47,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:09:47,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:09:47,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-14 19:09:47,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-11-14 19:09:47,567 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 18 [2018-11-14 19:09:47,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:09:47,567 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-11-14 19:09:47,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:09:47,567 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-14 19:09:47,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 19:09:47,568 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:09:47,569 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:09:47,569 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:09:47,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:09:47,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1570857321, now seen corresponding path program 1 times [2018-11-14 19:09:47,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:09:47,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:09:47,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:09:47,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:09:47,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:09:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 19:09:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 19:09:47,638 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-14 19:09:47,675 WARN L170 areAnnotationChecker]: exitENTRY has no Hoare annotation [2018-11-14 19:09:47,675 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-14 19:09:47,675 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 19:09:47,675 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 19:09:47,676 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-14 19:09:47,676 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 19:09:47,676 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 19:09:47,676 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 19:09:47,676 WARN L170 areAnnotationChecker]: L629 has no Hoare annotation [2018-11-14 19:09:47,676 WARN L170 areAnnotationChecker]: L629 has no Hoare annotation [2018-11-14 19:09:47,676 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 19:09:47,677 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 19:09:47,677 WARN L170 areAnnotationChecker]: L629-1 has no Hoare annotation [2018-11-14 19:09:47,677 WARN L170 areAnnotationChecker]: L629-1 has no Hoare annotation [2018-11-14 19:09:47,677 WARN L170 areAnnotationChecker]: L629-3 has no Hoare annotation [2018-11-14 19:09:47,677 WARN L170 areAnnotationChecker]: L632-4 has no Hoare annotation [2018-11-14 19:09:47,677 WARN L170 areAnnotationChecker]: L632-4 has no Hoare annotation [2018-11-14 19:09:47,678 WARN L170 areAnnotationChecker]: L632-1 has no Hoare annotation [2018-11-14 19:09:47,678 WARN L170 areAnnotationChecker]: L632-5 has no Hoare annotation [2018-11-14 19:09:47,678 WARN L170 areAnnotationChecker]: L632-2 has no Hoare annotation [2018-11-14 19:09:47,678 WARN L170 areAnnotationChecker]: L632-2 has no Hoare annotation [2018-11-14 19:09:47,678 WARN L170 areAnnotationChecker]: L648-4 has no Hoare annotation [2018-11-14 19:09:47,678 WARN L170 areAnnotationChecker]: L648-4 has no Hoare annotation [2018-11-14 19:09:47,678 WARN L170 areAnnotationChecker]: L633 has no Hoare annotation [2018-11-14 19:09:47,679 WARN L170 areAnnotationChecker]: L633 has no Hoare annotation [2018-11-14 19:09:47,679 WARN L170 areAnnotationChecker]: L648-1 has no Hoare annotation [2018-11-14 19:09:47,679 WARN L170 areAnnotationChecker]: L648-5 has no Hoare annotation [2018-11-14 19:09:47,679 WARN L170 areAnnotationChecker]: L633-2 has no Hoare annotation [2018-11-14 19:09:47,679 WARN L170 areAnnotationChecker]: L648-2 has no Hoare annotation [2018-11-14 19:09:47,679 WARN L170 areAnnotationChecker]: L648-2 has no Hoare annotation [2018-11-14 19:09:47,679 WARN L170 areAnnotationChecker]: L661-4 has no Hoare annotation [2018-11-14 19:09:47,680 WARN L170 areAnnotationChecker]: L661-4 has no Hoare annotation [2018-11-14 19:09:47,680 WARN L170 areAnnotationChecker]: L641 has no Hoare annotation [2018-11-14 19:09:47,680 WARN L170 areAnnotationChecker]: L641 has no Hoare annotation [2018-11-14 19:09:47,680 WARN L170 areAnnotationChecker]: L649 has no Hoare annotation [2018-11-14 19:09:47,680 WARN L170 areAnnotationChecker]: L649 has no Hoare annotation [2018-11-14 19:09:47,680 WARN L170 areAnnotationChecker]: L661-1 has no Hoare annotation [2018-11-14 19:09:47,680 WARN L170 areAnnotationChecker]: L661-5 has no Hoare annotation [2018-11-14 19:09:47,680 WARN L170 areAnnotationChecker]: L641-1 has no Hoare annotation [2018-11-14 19:09:47,681 WARN L170 areAnnotationChecker]: L641-1 has no Hoare annotation [2018-11-14 19:09:47,681 WARN L170 areAnnotationChecker]: L641-3 has no Hoare annotation [2018-11-14 19:09:47,681 WARN L170 areAnnotationChecker]: L651 has no Hoare annotation [2018-11-14 19:09:47,681 WARN L170 areAnnotationChecker]: L651 has no Hoare annotation [2018-11-14 19:09:47,681 WARN L170 areAnnotationChecker]: L655 has no Hoare annotation [2018-11-14 19:09:47,681 WARN L170 areAnnotationChecker]: L655 has no Hoare annotation [2018-11-14 19:09:47,681 WARN L170 areAnnotationChecker]: L661-2 has no Hoare annotation [2018-11-14 19:09:47,682 WARN L170 areAnnotationChecker]: L661-2 has no Hoare annotation [2018-11-14 19:09:47,682 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 19:09:47,682 WARN L170 areAnnotationChecker]: L656 has no Hoare annotation [2018-11-14 19:09:47,682 WARN L170 areAnnotationChecker]: L656 has no Hoare annotation [2018-11-14 19:09:47,682 WARN L170 areAnnotationChecker]: L649-2 has no Hoare annotation [2018-11-14 19:09:47,682 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 19:09:47,683 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 19:09:47,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 07:09:47 BoogieIcfgContainer [2018-11-14 19:09:47,685 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 19:09:47,687 INFO L168 Benchmark]: Toolchain (without parser) took 4719.98 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.8 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -555.0 MB). Peak memory consumption was 163.8 MB. Max. memory is 7.1 GB. [2018-11-14 19:09:47,689 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:09:47,689 INFO L168 Benchmark]: CACSL2BoogieTranslator took 599.54 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-14 19:09:47,690 INFO L168 Benchmark]: Boogie Preprocessor took 154.27 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -799.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2018-11-14 19:09:47,691 INFO L168 Benchmark]: RCFGBuilder took 909.74 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 63.3 MB). Peak memory consumption was 63.3 MB. Max. memory is 7.1 GB. [2018-11-14 19:09:47,692 INFO L168 Benchmark]: TraceAbstraction took 3051.67 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 149.2 MB). Peak memory consumption was 149.2 MB. Max. memory is 7.1 GB. [2018-11-14 19:09:47,696 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 599.54 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 154.27 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -799.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 909.74 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 63.3 MB). Peak memory consumption was 63.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3051.67 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 149.2 MB). Peak memory consumption was 149.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 668]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); VAL [a={10:0}, flag=1, malloc(sizeof(struct node))={10:0}] [L629] COND FALSE !(a == 0) VAL [a={10:0}, flag=1, malloc(sizeof(struct node))={10:0}] [L630] List t; [L631] List p = a; VAL [a={10:0}, flag=1, malloc(sizeof(struct node))={10:0}, p={10:0}] [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND TRUE \read(flag) [L634] FCALL p->h = 2 [L635] flag = 0 VAL [a={10:0}, flag=0, malloc(sizeof(struct node))={10:0}, p={10:0}] [L640] EXPR, FCALL malloc(sizeof(struct node)) [L640] t = (List) malloc(sizeof(struct node)) VAL [a={10:0}, flag=0, malloc(sizeof(struct node))={12:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, t={12:0}] [L641] COND FALSE !(t == 0) VAL [a={10:0}, flag=0, malloc(sizeof(struct node))={12:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, t={12:0}] [L642] FCALL p->n = t [L643] EXPR, FCALL p->n [L643] p = p->n [L632] COND FALSE !(__VERIFIER_nondet_int()) [L645] FCALL p->h = 3 [L646] p = a [L647] flag = 1 VAL [a={10:0}, flag=1, malloc(sizeof(struct node))={12:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, t={12:0}] [L648] EXPR, FCALL p->h VAL [a={10:0}, flag=1, malloc(sizeof(struct node))={12:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=2, t={12:0}] [L648] COND TRUE p->h != 3 [L649] COND TRUE \read(flag) [L650] flag = 0 [L651] EXPR, FCALL p->h VAL [a={10:0}, flag=0, malloc(sizeof(struct node))={12:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=2, t={12:0}] [L651] COND TRUE p->h != 1 [L668] __VERIFIER_error() VAL [a={10:0}, flag=0, malloc(sizeof(struct node))={12:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, t={12:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 1 error locations. UNSAFE Result, 2.9s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 99 SDtfs, 27 SDslu, 79 SDs, 0 SdLazy, 35 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 1585 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...