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.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-token_false-unreach-call_false-valid-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:24:02,108 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:24:02,110 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:24:02,123 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:24:02,123 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:24:02,124 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:24:02,126 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:24:02,128 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:24:02,130 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:24:02,131 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:24:02,132 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:24:02,132 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:24:02,133 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:24:02,134 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:24:02,135 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:24:02,136 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:24:02,137 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:24:02,139 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:24:02,141 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:24:02,143 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:24:02,144 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:24:02,145 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:24:02,147 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:24:02,148 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:24:02,148 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:24:02,149 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:24:02,150 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:24:02,150 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:24:02,151 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:24:02,152 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:24:02,153 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:24:02,153 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:24:02,153 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:24:02,154 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:24:02,155 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:24:02,155 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:24:02,156 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:24:02,173 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:24:02,173 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:24:02,174 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:24:02,174 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:24:02,175 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:24:02,175 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:24:02,175 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:24:02,175 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:24:02,176 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:24:02,176 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:24:02,176 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:24:02,176 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:24:02,176 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:24:02,177 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:24:02,177 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:24:02,177 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:24:02,177 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:24:02,177 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:24:02,178 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:24:02,178 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:24:02,178 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:24:02,178 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:24:02,178 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:24:02,179 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:24:02,179 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:24:02,179 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:24:02,179 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:24:02,179 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:24:02,180 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:24:02,180 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:24:02,224 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:24:02,237 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:24:02,241 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:24:02,243 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:24:02,244 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:24:02,245 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-token_false-unreach-call_false-valid-memcleanup.i [2018-11-14 17:24:02,309 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7638bc764/242f8187c14647fd98eb487cfc4394b9/FLAGcfe86de54 [2018-11-14 17:24:02,874 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:24:02,875 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-token_false-unreach-call_false-valid-memcleanup.i [2018-11-14 17:24:02,889 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7638bc764/242f8187c14647fd98eb487cfc4394b9/FLAGcfe86de54 [2018-11-14 17:24:02,905 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7638bc764/242f8187c14647fd98eb487cfc4394b9 [2018-11-14 17:24:02,918 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:24:02,920 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:24:02,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:24:02,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:24:02,925 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:24:02,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:24:02" (1/1) ... [2018-11-14 17:24:02,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fe5f185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:02, skipping insertion in model container [2018-11-14 17:24:02,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:24:02" (1/1) ... [2018-11-14 17:24:02,941 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:24:03,000 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:24:03,341 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:24:03,352 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:24:03,439 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:24:03,512 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:24:03,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:03 WrapperNode [2018-11-14 17:24:03,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:24:03,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:24:03,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:24:03,514 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:24:03,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:03" (1/1) ... [2018-11-14 17:24:03,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:03" (1/1) ... [2018-11-14 17:24:03,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:03" (1/1) ... [2018-11-14 17:24:03,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:03" (1/1) ... [2018-11-14 17:24:03,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:03" (1/1) ... [2018-11-14 17:24:03,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:03" (1/1) ... [2018-11-14 17:24:03,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:03" (1/1) ... [2018-11-14 17:24:03,702 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:24:03,702 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:24:03,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:24:03,703 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:24:03,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:03" (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 17:24:03,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:24:03,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:24:03,774 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:24:03,775 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 17:24:03,775 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 17:24:03,775 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 17:24:03,775 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 17:24:03,775 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 17:24:03,776 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 17:24:03,776 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 17:24:03,776 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 17:24:03,776 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 17:24:03,776 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 17:24:03,776 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 17:24:03,776 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 17:24:03,777 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 17:24:03,777 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 17:24:03,777 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 17:24:03,777 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 17:24:03,778 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 17:24:03,778 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 17:24:03,778 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 17:24:03,778 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 17:24:03,778 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 17:24:03,778 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 17:24:03,779 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 17:24:03,779 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 17:24:03,779 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 17:24:03,779 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 17:24:03,779 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 17:24:03,779 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 17:24:03,779 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 17:24:03,779 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 17:24:03,779 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 17:24:03,780 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 17:24:03,780 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 17:24:03,780 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 17:24:03,780 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 17:24:03,780 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 17:24:03,780 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 17:24:03,780 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 17:24:03,781 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 17:24:03,781 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 17:24:03,781 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 17:24:03,781 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 17:24:03,781 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 17:24:03,781 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 17:24:03,782 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 17:24:03,782 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 17:24:03,782 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 17:24:03,782 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 17:24:03,782 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 17:24:03,782 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 17:24:03,783 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 17:24:03,783 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 17:24:03,783 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 17:24:03,783 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 17:24:03,783 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 17:24:03,783 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 17:24:03,784 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 17:24:03,784 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 17:24:03,784 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 17:24:03,784 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 17:24:03,784 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 17:24:03,784 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 17:24:03,784 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 17:24:03,785 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 17:24:03,785 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 17:24:03,785 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 17:24:03,785 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 17:24:03,785 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 17:24:03,785 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 17:24:03,785 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 17:24:03,786 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 17:24:03,786 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 17:24:03,786 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 17:24:03,786 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 17:24:03,786 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 17:24:03,786 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 17:24:03,786 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 17:24:03,787 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 17:24:03,787 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 17:24:03,787 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 17:24:03,787 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 17:24:03,787 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 17:24:03,787 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 17:24:03,788 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 17:24:03,788 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 17:24:03,788 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 17:24:03,788 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 17:24:03,788 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 17:24:03,788 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 17:24:03,788 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 17:24:03,789 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 17:24:03,789 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 17:24:03,789 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 17:24:03,789 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 17:24:03,789 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 17:24:03,789 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 17:24:03,790 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 17:24:03,790 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 17:24:03,790 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 17:24:03,790 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 17:24:03,790 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 17:24:03,790 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 17:24:03,791 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 17:24:03,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:24:03,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:24:03,791 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:24:03,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:24:03,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 17:24:03,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:24:03,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 17:24:03,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:24:03,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:24:03,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:24:03,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:24:03,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:24:04,904 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:24:04,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:24:04 BoogieIcfgContainer [2018-11-14 17:24:04,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:24:04,906 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:24:04,906 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:24:04,910 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:24:04,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:24:02" (1/3) ... [2018-11-14 17:24:04,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@938d74a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:24:04, skipping insertion in model container [2018-11-14 17:24:04,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:03" (2/3) ... [2018-11-14 17:24:04,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@938d74a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:24:04, skipping insertion in model container [2018-11-14 17:24:04,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:24:04" (3/3) ... [2018-11-14 17:24:04,914 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-token_false-unreach-call_false-valid-memcleanup.i [2018-11-14 17:24:04,925 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:24:04,933 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-11-14 17:24:04,950 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-11-14 17:24:04,983 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:24:04,984 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:24:04,984 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:24:04,984 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:24:04,984 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:24:04,984 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:24:04,985 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:24:04,985 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:24:04,985 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:24:05,005 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-11-14 17:24:05,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 17:24:05,012 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:24:05,014 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:24:05,017 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:24:05,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:24:05,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1593703150, now seen corresponding path program 1 times [2018-11-14 17:24:05,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:24:05,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:24:05,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:05,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:24:05,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:24:05,202 INFO L256 TraceCheckUtils]: 0: Hoare triple {57#true} call ULTIMATE.init(); {57#true} is VALID [2018-11-14 17:24:05,206 INFO L273 TraceCheckUtils]: 1: Hoare triple {57#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {57#true} is VALID [2018-11-14 17:24:05,207 INFO L273 TraceCheckUtils]: 2: Hoare triple {57#true} assume true; {57#true} is VALID [2018-11-14 17:24:05,208 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {57#true} {57#true} #172#return; {57#true} is VALID [2018-11-14 17:24:05,209 INFO L256 TraceCheckUtils]: 4: Hoare triple {57#true} call #t~ret16 := main(); {57#true} is VALID [2018-11-14 17:24:05,209 INFO L273 TraceCheckUtils]: 5: Hoare triple {57#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset + 0, 4);call write~int(0, ~head~0.base, ~head~0.offset + 4, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {57#true} is VALID [2018-11-14 17:24:05,222 INFO L273 TraceCheckUtils]: 6: Hoare triple {57#true} assume !true; {58#false} is VALID [2018-11-14 17:24:05,223 INFO L273 TraceCheckUtils]: 7: Hoare triple {58#false} call write~int(1, ~x~0.base, ~x~0.offset + 4, 4);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc4.base, #t~malloc4.offset, ~x~0.base, ~x~0.offset + 0, 4);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset + 0, 4);call write~int(2, #t~mem5.base, #t~mem5.offset + 4, 4);havoc #t~mem5.base, #t~mem5.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {58#false} is VALID [2018-11-14 17:24:05,224 INFO L273 TraceCheckUtils]: 8: Hoare triple {58#false} assume true; {58#false} is VALID [2018-11-14 17:24:05,224 INFO L273 TraceCheckUtils]: 9: Hoare triple {58#false} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {58#false} is VALID [2018-11-14 17:24:05,224 INFO L273 TraceCheckUtils]: 10: Hoare triple {58#false} assume !false; {58#false} is VALID [2018-11-14 17:24:05,228 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 17:24:05,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:24:05,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:24:05,236 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 17:24:05,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:24:05,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:24:05,374 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:05,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:24:05,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:24:05,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:24:05,388 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-11-14 17:24:05,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:05,795 INFO L93 Difference]: Finished difference Result 102 states and 148 transitions. [2018-11-14 17:24:05,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:24:05,796 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 17:24:05,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:24:05,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:24:05,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 148 transitions. [2018-11-14 17:24:05,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:24:05,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 148 transitions. [2018-11-14 17:24:05,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 148 transitions. [2018-11-14 17:24:06,364 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:06,378 INFO L225 Difference]: With dead ends: 102 [2018-11-14 17:24:06,379 INFO L226 Difference]: Without dead ends: 48 [2018-11-14 17:24:06,383 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 17:24:06,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-14 17:24:06,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-14 17:24:06,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:24:06,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2018-11-14 17:24:06,445 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-14 17:24:06,445 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-14 17:24:06,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:06,451 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-14 17:24:06,451 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-14 17:24:06,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:06,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:06,452 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-14 17:24:06,453 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-14 17:24:06,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:06,458 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-14 17:24:06,458 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-14 17:24:06,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:06,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:06,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:24:06,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:24:06,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 17:24:06,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-11-14 17:24:06,465 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 11 [2018-11-14 17:24:06,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:24:06,465 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-11-14 17:24:06,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:24:06,466 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-14 17:24:06,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 17:24:06,466 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:24:06,467 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:24:06,467 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:24:06,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:24:06,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1276921565, now seen corresponding path program 1 times [2018-11-14 17:24:06,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:24:06,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:24:06,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:06,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:24:06,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:24:06,579 INFO L256 TraceCheckUtils]: 0: Hoare triple {333#true} call ULTIMATE.init(); {333#true} is VALID [2018-11-14 17:24:06,579 INFO L273 TraceCheckUtils]: 1: Hoare triple {333#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {333#true} is VALID [2018-11-14 17:24:06,580 INFO L273 TraceCheckUtils]: 2: Hoare triple {333#true} assume true; {333#true} is VALID [2018-11-14 17:24:06,581 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {333#true} {333#true} #172#return; {333#true} is VALID [2018-11-14 17:24:06,581 INFO L256 TraceCheckUtils]: 4: Hoare triple {333#true} call #t~ret16 := main(); {333#true} is VALID [2018-11-14 17:24:06,582 INFO L273 TraceCheckUtils]: 5: Hoare triple {333#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset + 0, 4);call write~int(0, ~head~0.base, ~head~0.offset + 4, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {333#true} is VALID [2018-11-14 17:24:06,582 INFO L273 TraceCheckUtils]: 6: Hoare triple {333#true} assume true; {333#true} is VALID [2018-11-14 17:24:06,582 INFO L273 TraceCheckUtils]: 7: Hoare triple {333#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {333#true} is VALID [2018-11-14 17:24:06,586 INFO L273 TraceCheckUtils]: 8: Hoare triple {333#true} assume !!(#t~nondet1 != 0);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset + 0, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset + 0, 4);~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~int(0, ~x~0.base, ~x~0.offset + 4, 4); {335#(not (= main_~x~0.base 0))} is VALID [2018-11-14 17:24:06,587 INFO L273 TraceCheckUtils]: 9: Hoare triple {335#(not (= main_~x~0.base 0))} assume true; {335#(not (= main_~x~0.base 0))} is VALID [2018-11-14 17:24:06,588 INFO L273 TraceCheckUtils]: 10: Hoare triple {335#(not (= main_~x~0.base 0))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {334#false} is VALID [2018-11-14 17:24:06,588 INFO L273 TraceCheckUtils]: 11: Hoare triple {334#false} assume !false; {334#false} is VALID [2018-11-14 17:24:06,589 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 17:24:06,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:24:06,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:24:06,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-14 17:24:06,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:24:06,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:24:06,704 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:06,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:24:06,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:24:06,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:24:06,706 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 3 states. [2018-11-14 17:24:06,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:06,968 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-14 17:24:06,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:24:06,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-14 17:24:06,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:24:06,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:24:06,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-14 17:24:06,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:24:06,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-14 17:24:06,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2018-11-14 17:24:07,147 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:07,150 INFO L225 Difference]: With dead ends: 48 [2018-11-14 17:24:07,150 INFO L226 Difference]: Without dead ends: 46 [2018-11-14 17:24:07,151 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 17:24:07,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-14 17:24:07,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-14 17:24:07,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:24:07,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-14 17:24:07,203 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-14 17:24:07,203 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-14 17:24:07,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:07,207 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-11-14 17:24:07,207 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-11-14 17:24:07,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:07,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:07,208 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-14 17:24:07,208 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-14 17:24:07,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:07,211 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-11-14 17:24:07,212 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-11-14 17:24:07,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:07,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:07,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:24:07,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:24:07,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-14 17:24:07,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-11-14 17:24:07,216 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 12 [2018-11-14 17:24:07,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:24:07,216 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-11-14 17:24:07,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:24:07,216 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-11-14 17:24:07,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 17:24:07,217 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:24:07,217 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:24:07,218 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:24:07,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:24:07,218 INFO L82 PathProgramCache]: Analyzing trace with hash 928632568, now seen corresponding path program 1 times [2018-11-14 17:24:07,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:24:07,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:24:07,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:07,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:24:07,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:24:07,350 INFO L256 TraceCheckUtils]: 0: Hoare triple {544#true} call ULTIMATE.init(); {544#true} is VALID [2018-11-14 17:24:07,350 INFO L273 TraceCheckUtils]: 1: Hoare triple {544#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {544#true} is VALID [2018-11-14 17:24:07,351 INFO L273 TraceCheckUtils]: 2: Hoare triple {544#true} assume true; {544#true} is VALID [2018-11-14 17:24:07,351 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {544#true} {544#true} #172#return; {544#true} is VALID [2018-11-14 17:24:07,351 INFO L256 TraceCheckUtils]: 4: Hoare triple {544#true} call #t~ret16 := main(); {544#true} is VALID [2018-11-14 17:24:07,352 INFO L273 TraceCheckUtils]: 5: Hoare triple {544#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset + 0, 4);call write~int(0, ~head~0.base, ~head~0.offset + 4, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {546#(not (= 0 main_~head~0.base))} is VALID [2018-11-14 17:24:07,354 INFO L273 TraceCheckUtils]: 6: Hoare triple {546#(not (= 0 main_~head~0.base))} assume true; {546#(not (= 0 main_~head~0.base))} is VALID [2018-11-14 17:24:07,354 INFO L273 TraceCheckUtils]: 7: Hoare triple {546#(not (= 0 main_~head~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {546#(not (= 0 main_~head~0.base))} is VALID [2018-11-14 17:24:07,356 INFO L273 TraceCheckUtils]: 8: Hoare triple {546#(not (= 0 main_~head~0.base))} assume !(#t~nondet1 != 0);havoc #t~nondet1; {546#(not (= 0 main_~head~0.base))} is VALID [2018-11-14 17:24:07,357 INFO L273 TraceCheckUtils]: 9: Hoare triple {546#(not (= 0 main_~head~0.base))} call write~int(1, ~x~0.base, ~x~0.offset + 4, 4);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc4.base, #t~malloc4.offset, ~x~0.base, ~x~0.offset + 0, 4);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset + 0, 4);call write~int(2, #t~mem5.base, #t~mem5.offset + 4, 4);havoc #t~mem5.base, #t~mem5.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {547#(not (= 0 main_~x~0.base))} is VALID [2018-11-14 17:24:07,363 INFO L273 TraceCheckUtils]: 10: Hoare triple {547#(not (= 0 main_~x~0.base))} assume true; {547#(not (= 0 main_~x~0.base))} is VALID [2018-11-14 17:24:07,363 INFO L273 TraceCheckUtils]: 11: Hoare triple {547#(not (= 0 main_~x~0.base))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {545#false} is VALID [2018-11-14 17:24:07,363 INFO L273 TraceCheckUtils]: 12: Hoare triple {545#false} assume !false; {545#false} is VALID [2018-11-14 17:24:07,365 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 17:24:07,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:24:07,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:24:07,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-14 17:24:07,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:24:07,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:24:07,404 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:07,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:24:07,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:24:07,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:24:07,404 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 4 states. [2018-11-14 17:24:07,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:07,720 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-11-14 17:24:07,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:24:07,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-14 17:24:07,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:24:07,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:24:07,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2018-11-14 17:24:07,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:24:07,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2018-11-14 17:24:07,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2018-11-14 17:24:07,862 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:07,866 INFO L225 Difference]: With dead ends: 75 [2018-11-14 17:24:07,866 INFO L226 Difference]: Without dead ends: 73 [2018-11-14 17:24:07,867 INFO L604 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 [2018-11-14 17:24:07,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-14 17:24:07,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2018-11-14 17:24:07,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:24:07,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 44 states. [2018-11-14 17:24:07,923 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 44 states. [2018-11-14 17:24:07,923 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 44 states. [2018-11-14 17:24:07,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:07,927 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-11-14 17:24:07,927 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-11-14 17:24:07,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:07,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:07,928 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 73 states. [2018-11-14 17:24:07,928 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 73 states. [2018-11-14 17:24:07,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:07,932 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-11-14 17:24:07,932 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-11-14 17:24:07,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:07,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:07,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:24:07,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:24:07,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 17:24:07,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-14 17:24:07,936 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 13 [2018-11-14 17:24:07,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:24:07,937 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-14 17:24:07,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:24:07,937 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-14 17:24:07,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 17:24:07,938 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:24:07,938 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:24:07,938 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:24:07,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:24:07,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1895008549, now seen corresponding path program 1 times [2018-11-14 17:24:07,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:24:07,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:24:07,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:07,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:24:07,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 17:24:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 17:24:08,040 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-14 17:24:08,068 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-14 17:24:08,068 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 17:24:08,069 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 17:24:08,069 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-14 17:24:08,069 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 17:24:08,069 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 17:24:08,069 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 17:24:08,069 WARN L170 areAnnotationChecker]: L1005-7 has no Hoare annotation [2018-11-14 17:24:08,069 WARN L170 areAnnotationChecker]: L1005-7 has no Hoare annotation [2018-11-14 17:24:08,070 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 17:24:08,070 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:24:08,070 WARN L170 areAnnotationChecker]: L999-1 has no Hoare annotation [2018-11-14 17:24:08,070 WARN L170 areAnnotationChecker]: L999-4 has no Hoare annotation [2018-11-14 17:24:08,070 WARN L170 areAnnotationChecker]: L999-2 has no Hoare annotation [2018-11-14 17:24:08,070 WARN L170 areAnnotationChecker]: L999-2 has no Hoare annotation [2018-11-14 17:24:08,070 WARN L170 areAnnotationChecker]: L1013-6 has no Hoare annotation [2018-11-14 17:24:08,071 WARN L170 areAnnotationChecker]: L1013-6 has no Hoare annotation [2018-11-14 17:24:08,071 WARN L170 areAnnotationChecker]: L1005-6 has no Hoare annotation [2018-11-14 17:24:08,071 WARN L170 areAnnotationChecker]: L1005-6 has no Hoare annotation [2018-11-14 17:24:08,071 WARN L170 areAnnotationChecker]: L1013-1 has no Hoare annotation [2018-11-14 17:24:08,071 WARN L170 areAnnotationChecker]: L1013-1 has no Hoare annotation [2018-11-14 17:24:08,071 WARN L170 areAnnotationChecker]: L1015-3 has no Hoare annotation [2018-11-14 17:24:08,072 WARN L170 areAnnotationChecker]: L1015-3 has no Hoare annotation [2018-11-14 17:24:08,072 WARN L170 areAnnotationChecker]: L1005-1 has no Hoare annotation [2018-11-14 17:24:08,072 WARN L170 areAnnotationChecker]: L1005-1 has no Hoare annotation [2018-11-14 17:24:08,072 WARN L170 areAnnotationChecker]: L1013-2 has no Hoare annotation [2018-11-14 17:24:08,072 WARN L170 areAnnotationChecker]: L1013-2 has no Hoare annotation [2018-11-14 17:24:08,072 WARN L170 areAnnotationChecker]: L1013-4 has no Hoare annotation [2018-11-14 17:24:08,072 WARN L170 areAnnotationChecker]: L1013-4 has no Hoare annotation [2018-11-14 17:24:08,073 WARN L170 areAnnotationChecker]: L1015 has no Hoare annotation [2018-11-14 17:24:08,073 WARN L170 areAnnotationChecker]: L1020-5 has no Hoare annotation [2018-11-14 17:24:08,073 WARN L170 areAnnotationChecker]: L1020-5 has no Hoare annotation [2018-11-14 17:24:08,073 WARN L170 areAnnotationChecker]: L1005-2 has no Hoare annotation [2018-11-14 17:24:08,073 WARN L170 areAnnotationChecker]: L1005-2 has no Hoare annotation [2018-11-14 17:24:08,073 WARN L170 areAnnotationChecker]: L1005-4 has no Hoare annotation [2018-11-14 17:24:08,073 WARN L170 areAnnotationChecker]: L1005-4 has no Hoare annotation [2018-11-14 17:24:08,074 WARN L170 areAnnotationChecker]: L1015-1 has no Hoare annotation [2018-11-14 17:24:08,074 WARN L170 areAnnotationChecker]: L1015-1 has no Hoare annotation [2018-11-14 17:24:08,074 WARN L170 areAnnotationChecker]: L1020 has no Hoare annotation [2018-11-14 17:24:08,074 WARN L170 areAnnotationChecker]: L1020 has no Hoare annotation [2018-11-14 17:24:08,074 WARN L170 areAnnotationChecker]: L1020-6 has no Hoare annotation [2018-11-14 17:24:08,074 WARN L170 areAnnotationChecker]: L1017-6 has no Hoare annotation [2018-11-14 17:24:08,074 WARN L170 areAnnotationChecker]: L1017-6 has no Hoare annotation [2018-11-14 17:24:08,074 WARN L170 areAnnotationChecker]: L1020-1 has no Hoare annotation [2018-11-14 17:24:08,074 WARN L170 areAnnotationChecker]: L1020-1 has no Hoare annotation [2018-11-14 17:24:08,075 WARN L170 areAnnotationChecker]: L1020-3 has no Hoare annotation [2018-11-14 17:24:08,075 WARN L170 areAnnotationChecker]: L1020-3 has no Hoare annotation [2018-11-14 17:24:08,075 WARN L170 areAnnotationChecker]: L1022-6 has no Hoare annotation [2018-11-14 17:24:08,075 WARN L170 areAnnotationChecker]: L1022-6 has no Hoare annotation [2018-11-14 17:24:08,075 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2018-11-14 17:24:08,075 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2018-11-14 17:24:08,075 WARN L170 areAnnotationChecker]: L1017-7 has no Hoare annotation [2018-11-14 17:24:08,075 WARN L170 areAnnotationChecker]: L1022-1 has no Hoare annotation [2018-11-14 17:24:08,075 WARN L170 areAnnotationChecker]: L1022-1 has no Hoare annotation [2018-11-14 17:24:08,075 WARN L170 areAnnotationChecker]: L1022-7 has no Hoare annotation [2018-11-14 17:24:08,076 WARN L170 areAnnotationChecker]: L1017-2 has no Hoare annotation [2018-11-14 17:24:08,076 WARN L170 areAnnotationChecker]: L1017-2 has no Hoare annotation [2018-11-14 17:24:08,076 WARN L170 areAnnotationChecker]: L1017-4 has no Hoare annotation [2018-11-14 17:24:08,076 WARN L170 areAnnotationChecker]: L1017-4 has no Hoare annotation [2018-11-14 17:24:08,076 WARN L170 areAnnotationChecker]: L1022-2 has no Hoare annotation [2018-11-14 17:24:08,076 WARN L170 areAnnotationChecker]: L1022-2 has no Hoare annotation [2018-11-14 17:24:08,076 WARN L170 areAnnotationChecker]: L1022-4 has no Hoare annotation [2018-11-14 17:24:08,076 WARN L170 areAnnotationChecker]: L1022-4 has no Hoare annotation [2018-11-14 17:24:08,076 WARN L170 areAnnotationChecker]: L1026-4 has no Hoare annotation [2018-11-14 17:24:08,076 WARN L170 areAnnotationChecker]: L1026-4 has no Hoare annotation [2018-11-14 17:24:08,077 WARN L170 areAnnotationChecker]: L1026-1 has no Hoare annotation [2018-11-14 17:24:08,077 WARN L170 areAnnotationChecker]: L1032-5 has no Hoare annotation [2018-11-14 17:24:08,077 WARN L170 areAnnotationChecker]: L1032-5 has no Hoare annotation [2018-11-14 17:24:08,077 WARN L170 areAnnotationChecker]: L1026-2 has no Hoare annotation [2018-11-14 17:24:08,077 WARN L170 areAnnotationChecker]: L1026-2 has no Hoare annotation [2018-11-14 17:24:08,077 WARN L170 areAnnotationChecker]: L1032 has no Hoare annotation [2018-11-14 17:24:08,077 WARN L170 areAnnotationChecker]: L1032 has no Hoare annotation [2018-11-14 17:24:08,077 WARN L170 areAnnotationChecker]: L1032-6 has no Hoare annotation [2018-11-14 17:24:08,077 WARN L170 areAnnotationChecker]: L1032-1 has no Hoare annotation [2018-11-14 17:24:08,077 WARN L170 areAnnotationChecker]: L1032-1 has no Hoare annotation [2018-11-14 17:24:08,078 WARN L170 areAnnotationChecker]: L1032-3 has no Hoare annotation [2018-11-14 17:24:08,078 WARN L170 areAnnotationChecker]: L1032-3 has no Hoare annotation [2018-11-14 17:24:08,078 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 17:24:08,078 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 17:24:08,078 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 17:24:08,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:24:08 BoogieIcfgContainer [2018-11-14 17:24:08,081 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 17:24:08,082 INFO L168 Benchmark]: Toolchain (without parser) took 5163.59 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -549.7 MB). Peak memory consumption was 191.6 MB. Max. memory is 7.1 GB. [2018-11-14 17:24:08,084 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:24:08,085 INFO L168 Benchmark]: CACSL2BoogieTranslator took 592.17 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-11-14 17:24:08,085 INFO L168 Benchmark]: Boogie Preprocessor took 188.33 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -808.9 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2018-11-14 17:24:08,086 INFO L168 Benchmark]: RCFGBuilder took 1203.02 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 77.6 MB). Peak memory consumption was 77.6 MB. Max. memory is 7.1 GB. [2018-11-14 17:24:08,087 INFO L168 Benchmark]: TraceAbstraction took 3174.81 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 160.5 MB). Peak memory consumption was 160.5 MB. Max. memory is 7.1 GB. [2018-11-14 17:24:08,091 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 592.17 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 188.33 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -808.9 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1203.02 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 77.6 MB). Peak memory consumption was 77.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3174.81 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 160.5 MB). Peak memory consumption was 160.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1020]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L992] EXPR, FCALL malloc(sizeof(SLL)) [L992] SLL* head = malloc(sizeof(SLL)); [L993] FCALL head->next = ((void*)0) [L994] FCALL head->data = 0 [L996] SLL* x = head; VAL [head={10:0}, malloc(sizeof(SLL))={10:0}, x={10:0}] [L999] COND FALSE !(__VERIFIER_nondet_int()) [L1007] FCALL x->data = 1 [L1008] EXPR, FCALL malloc(sizeof(SLL)) [L1008] FCALL x->next = malloc(sizeof(SLL)) [L1009] EXPR, FCALL x->next [L1009] FCALL x->next->data = 2 [L1011] x = head VAL [head={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={10:0}] [L1013] COND FALSE !(!(((void*)0) != x)) VAL [head={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={10:0}] [L1013] COND FALSE !(0) VAL [head={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={10:0}] [L1015] EXPR, FCALL x->data VAL [head={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={10:0}, x->data=1] [L1015] COND FALSE !(1 != x->data) [L1020] EXPR, FCALL x->data VAL [head={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={10:0}, x->data=1] [L1020] COND TRUE !(2 == x->data) [L1020] __VERIFIER_error() VAL [head={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 54 locations, 6 error locations. UNSAFE Result, 3.0s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 134 SDtfs, 87 SDslu, 62 SDs, 0 SdLazy, 39 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, 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, 29 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 33 ConstructedInterpolants, 0 QuantifiedInterpolants, 647 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...