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/forester-heap/dll-01_false-unreach-call_false-valid-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:11:17,032 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:11:17,034 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:11:17,046 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:11:17,047 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:11:17,048 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:11:17,049 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:11:17,051 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:11:17,053 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:11:17,054 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:11:17,055 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:11:17,056 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:11:17,057 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:11:17,058 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:11:17,059 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:11:17,060 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:11:17,061 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:11:17,063 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:11:17,065 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:11:17,067 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:11:17,068 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:11:17,070 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:11:17,072 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:11:17,073 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:11:17,073 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:11:17,074 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:11:17,075 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:11:17,076 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:11:17,077 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:11:17,078 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:11:17,079 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:11:17,079 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:11:17,080 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:11:17,080 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:11:17,081 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:11:17,082 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:11:17,082 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:11:17,099 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:11:17,099 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:11:17,100 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:11:17,100 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:11:17,101 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:11:17,101 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:11:17,102 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:11:17,102 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:11:17,102 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:11:17,102 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:11:17,103 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:11:17,103 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:11:17,103 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:11:17,103 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:11:17,103 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:11:17,104 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:11:17,104 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:11:17,104 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:11:17,104 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:11:17,105 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:11:17,105 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:11:17,105 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:11:17,105 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:11:17,105 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:11:17,105 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:11:17,106 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:11:17,106 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:11:17,106 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:11:17,106 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:11:17,106 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:11:17,107 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:11:17,149 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:11:17,162 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:11:17,166 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:11:17,168 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:11:17,168 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:11:17,169 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-01_false-unreach-call_false-valid-memcleanup.i [2018-11-14 19:11:17,229 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/907d1c58b/64bd49c3a8dd4ef1acfba93cae6fdf2a/FLAGf486508e7 [2018-11-14 19:11:17,824 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:11:17,826 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01_false-unreach-call_false-valid-memcleanup.i [2018-11-14 19:11:17,845 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/907d1c58b/64bd49c3a8dd4ef1acfba93cae6fdf2a/FLAGf486508e7 [2018-11-14 19:11:17,861 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/907d1c58b/64bd49c3a8dd4ef1acfba93cae6fdf2a [2018-11-14 19:11:17,873 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:11:17,874 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:11:17,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:11:17,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:11:17,880 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:11:17,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:11:17" (1/1) ... [2018-11-14 19:11:17,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e4da681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:11:17, skipping insertion in model container [2018-11-14 19:11:17,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:11:17" (1/1) ... [2018-11-14 19:11:17,895 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:11:17,958 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:11:18,411 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:11:18,429 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:11:18,526 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:11:18,588 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:11:18,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:11:18 WrapperNode [2018-11-14 19:11:18,588 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:11:18,589 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:11:18,589 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:11:18,590 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:11:18,684 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:11:18" (1/1) ... [2018-11-14 19:11:18,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:11:18" (1/1) ... [2018-11-14 19:11:18,709 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:11:18" (1/1) ... [2018-11-14 19:11:18,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:11:18" (1/1) ... [2018-11-14 19:11:18,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:11:18" (1/1) ... [2018-11-14 19:11:18,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:11:18" (1/1) ... [2018-11-14 19:11:18,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:11:18" (1/1) ... [2018-11-14 19:11:18,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:11:18,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:11:18,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:11:18,786 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:11:18,789 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:11:18" (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:11:18,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:11:18,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:11:18,854 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:11:18,854 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 19:11:18,854 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 19:11:18,854 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 19:11:18,854 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 19:11:18,855 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 19:11:18,855 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 19:11:18,855 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 19:11:18,855 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 19:11:18,855 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 19:11:18,855 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 19:11:18,856 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 19:11:18,856 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 19:11:18,856 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 19:11:18,856 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 19:11:18,856 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 19:11:18,856 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 19:11:18,857 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 19:11:18,857 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 19:11:18,857 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 19:11:18,857 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 19:11:18,857 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 19:11:18,857 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 19:11:18,858 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 19:11:18,858 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 19:11:18,858 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 19:11:18,858 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 19:11:18,858 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 19:11:18,858 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 19:11:18,859 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 19:11:18,859 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 19:11:18,859 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 19:11:18,859 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 19:11:18,859 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 19:11:18,859 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 19:11:18,859 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 19:11:18,860 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 19:11:18,860 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 19:11:18,860 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 19:11:18,860 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 19:11:18,860 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 19:11:18,860 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 19:11:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 19:11:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 19:11:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 19:11:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 19:11:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 19:11:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 19:11:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 19:11:18,862 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 19:11:18,862 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 19:11:18,862 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 19:11:18,862 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 19:11:18,862 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 19:11:18,862 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 19:11:18,862 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 19:11:18,863 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 19:11:18,863 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 19:11:18,863 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 19:11:18,863 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 19:11:18,863 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 19:11:18,863 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 19:11:18,864 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 19:11:18,864 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 19:11:18,864 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 19:11:18,864 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 19:11:18,864 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 19:11:18,864 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 19:11:18,864 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 19:11:18,865 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 19:11:18,865 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 19:11:18,865 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 19:11:18,865 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 19:11:18,865 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 19:11:18,865 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 19:11:18,865 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 19:11:18,866 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 19:11:18,866 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 19:11:18,866 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 19:11:18,866 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 19:11:18,866 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 19:11:18,867 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 19:11:18,867 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 19:11:18,867 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 19:11:18,867 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 19:11:18,867 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 19:11:18,867 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 19:11:18,868 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 19:11:18,868 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 19:11:18,868 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 19:11:18,868 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 19:11:18,868 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 19:11:18,868 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 19:11:18,869 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 19:11:18,869 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 19:11:18,869 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 19:11:18,869 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 19:11:18,869 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 19:11:18,870 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 19:11:18,870 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 19:11:18,870 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 19:11:18,870 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 19:11:18,870 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 19:11:18,871 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 19:11:18,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 19:11:18,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:11:18,871 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:11:18,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 19:11:18,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 19:11:18,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 19:11:18,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 19:11:18,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:11:18,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:11:20,714 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:11:20,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:11:20 BoogieIcfgContainer [2018-11-14 19:11:20,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:11:20,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:11:20,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:11:20,720 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:11:20,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:11:17" (1/3) ... [2018-11-14 19:11:20,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6852d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:11:20, skipping insertion in model container [2018-11-14 19:11:20,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:11:18" (2/3) ... [2018-11-14 19:11:20,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6852d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:11:20, skipping insertion in model container [2018-11-14 19:11:20,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:11:20" (3/3) ... [2018-11-14 19:11:20,724 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-01_false-unreach-call_false-valid-memcleanup.i [2018-11-14 19:11:20,735 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:11:20,744 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-11-14 19:11:20,762 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2018-11-14 19:11:20,795 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:11:20,796 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:11:20,796 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:11:20,796 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:11:20,797 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:11:20,797 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:11:20,797 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:11:20,797 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:11:20,798 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:11:20,818 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2018-11-14 19:11:20,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-14 19:11:20,824 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:11:20,825 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:11:20,829 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:11:20,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:11:20,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1590476792, now seen corresponding path program 1 times [2018-11-14 19:11:20,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:11:20,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:11:20,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:20,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:11:20,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:11:21,184 INFO L256 TraceCheckUtils]: 0: Hoare triple {102#true} call ULTIMATE.init(); {102#true} is VALID [2018-11-14 19:11:21,190 INFO L273 TraceCheckUtils]: 1: Hoare triple {102#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {102#true} is VALID [2018-11-14 19:11:21,190 INFO L273 TraceCheckUtils]: 2: Hoare triple {102#true} assume true; {102#true} is VALID [2018-11-14 19:11:21,191 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {102#true} {102#true} #355#return; {102#true} is VALID [2018-11-14 19:11:21,191 INFO L256 TraceCheckUtils]: 4: Hoare triple {102#true} call #t~ret28 := main(); {102#true} is VALID [2018-11-14 19:11:21,205 INFO L273 TraceCheckUtils]: 5: Hoare triple {102#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 0, 4);call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 4, 4); {104#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 19:11:21,218 INFO L273 TraceCheckUtils]: 6: Hoare triple {104#(not (= 0 main_~list~0.base))} assume true; {104#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 19:11:21,231 INFO L273 TraceCheckUtils]: 7: Hoare triple {104#(not (= 0 main_~list~0.base))} assume !(~list~0.base != 0 || ~list~0.offset != 0); {103#false} is VALID [2018-11-14 19:11:21,232 INFO L273 TraceCheckUtils]: 8: Hoare triple {103#false} assume !false; {103#false} is VALID [2018-11-14 19:11:21,235 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:11:21,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:11:21,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 19:11:21,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-14 19:11:21,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:11:21,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 19:11:21,375 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:11:21,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 19:11:21,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 19:11:21,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:11:21,390 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 3 states. [2018-11-14 19:11:21,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:21,916 INFO L93 Difference]: Finished difference Result 210 states and 326 transitions. [2018-11-14 19:11:21,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 19:11:21,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-14 19:11:21,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:11:21,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:11:21,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 326 transitions. [2018-11-14 19:11:21,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:11:21,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 326 transitions. [2018-11-14 19:11:21,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 326 transitions. [2018-11-14 19:11:22,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 326 edges. 326 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:11:22,716 INFO L225 Difference]: With dead ends: 210 [2018-11-14 19:11:22,717 INFO L226 Difference]: Without dead ends: 112 [2018-11-14 19:11:22,721 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:11:22,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-14 19:11:22,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 92. [2018-11-14 19:11:22,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:11:22,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 92 states. [2018-11-14 19:11:22,809 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 92 states. [2018-11-14 19:11:22,809 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 92 states. [2018-11-14 19:11:22,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:22,819 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2018-11-14 19:11:22,819 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2018-11-14 19:11:22,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:11:22,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:11:22,821 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 112 states. [2018-11-14 19:11:22,821 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 112 states. [2018-11-14 19:11:22,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:22,830 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2018-11-14 19:11:22,830 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2018-11-14 19:11:22,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:11:22,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:11:22,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:11:22,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:11:22,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-14 19:11:22,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2018-11-14 19:11:22,840 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 9 [2018-11-14 19:11:22,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:11:22,840 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2018-11-14 19:11:22,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 19:11:22,841 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2018-11-14 19:11:22,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 19:11:22,841 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:11:22,842 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:11:22,842 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:11:22,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:11:22,843 INFO L82 PathProgramCache]: Analyzing trace with hash 528636434, now seen corresponding path program 1 times [2018-11-14 19:11:22,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:11:22,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:11:22,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:22,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:11:22,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:11:22,959 INFO L256 TraceCheckUtils]: 0: Hoare triple {660#true} call ULTIMATE.init(); {660#true} is VALID [2018-11-14 19:11:22,959 INFO L273 TraceCheckUtils]: 1: Hoare triple {660#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {660#true} is VALID [2018-11-14 19:11:22,959 INFO L273 TraceCheckUtils]: 2: Hoare triple {660#true} assume true; {660#true} is VALID [2018-11-14 19:11:22,960 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {660#true} {660#true} #355#return; {660#true} is VALID [2018-11-14 19:11:22,960 INFO L256 TraceCheckUtils]: 4: Hoare triple {660#true} call #t~ret28 := main(); {660#true} is VALID [2018-11-14 19:11:22,960 INFO L273 TraceCheckUtils]: 5: Hoare triple {660#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 0, 4);call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 4, 4); {660#true} is VALID [2018-11-14 19:11:22,960 INFO L273 TraceCheckUtils]: 6: Hoare triple {660#true} assume true; {660#true} is VALID [2018-11-14 19:11:22,961 INFO L273 TraceCheckUtils]: 7: Hoare triple {660#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {660#true} is VALID [2018-11-14 19:11:22,961 INFO L273 TraceCheckUtils]: 8: Hoare triple {660#true} assume true; {660#true} is VALID [2018-11-14 19:11:22,961 INFO L273 TraceCheckUtils]: 9: Hoare triple {660#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {660#true} is VALID [2018-11-14 19:11:22,962 INFO L273 TraceCheckUtils]: 10: Hoare triple {660#true} assume #t~nondet1 != 0;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 8, 4); {660#true} is VALID [2018-11-14 19:11:22,962 INFO L273 TraceCheckUtils]: 11: Hoare triple {660#true} assume true;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {660#true} is VALID [2018-11-14 19:11:22,966 INFO L273 TraceCheckUtils]: 12: Hoare triple {660#true} assume #t~short7; {662#|main_#t~short7|} is VALID [2018-11-14 19:11:22,967 INFO L273 TraceCheckUtils]: 13: Hoare triple {662#|main_#t~short7|} assume !#t~short7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~short7; {661#false} is VALID [2018-11-14 19:11:22,967 INFO L273 TraceCheckUtils]: 14: Hoare triple {661#false} assume !false; {661#false} is VALID [2018-11-14 19:11:22,968 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:11:22,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:11:22,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 19:11:22,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 19:11:22,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:11:22,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 19:11:23,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:11:23,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 19:11:23,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 19:11:23,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:11:23,002 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 3 states. [2018-11-14 19:11:23,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:23,244 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2018-11-14 19:11:23,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 19:11:23,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 19:11:23,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:11:23,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:11:23,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2018-11-14 19:11:23,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:11:23,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2018-11-14 19:11:23,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 104 transitions. [2018-11-14 19:11:23,410 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:11:23,415 INFO L225 Difference]: With dead ends: 95 [2018-11-14 19:11:23,415 INFO L226 Difference]: Without dead ends: 93 [2018-11-14 19:11:23,416 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:11:23,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-14 19:11:23,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-11-14 19:11:23,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:11:23,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 93 states. [2018-11-14 19:11:23,489 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 93 states. [2018-11-14 19:11:23,489 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 93 states. [2018-11-14 19:11:23,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:23,496 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2018-11-14 19:11:23,496 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-11-14 19:11:23,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:11:23,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:11:23,498 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 93 states. [2018-11-14 19:11:23,498 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 93 states. [2018-11-14 19:11:23,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:23,505 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2018-11-14 19:11:23,505 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-11-14 19:11:23,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:11:23,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:11:23,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:11:23,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:11:23,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-14 19:11:23,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2018-11-14 19:11:23,511 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 15 [2018-11-14 19:11:23,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:11:23,511 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2018-11-14 19:11:23,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 19:11:23,511 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-11-14 19:11:23,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 19:11:23,512 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:11:23,512 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:11:23,513 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:11:23,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:11:23,513 INFO L82 PathProgramCache]: Analyzing trace with hash 528638356, now seen corresponding path program 1 times [2018-11-14 19:11:23,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:11:23,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:11:23,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:23,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:11:23,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:11:23,640 INFO L256 TraceCheckUtils]: 0: Hoare triple {1059#true} call ULTIMATE.init(); {1059#true} is VALID [2018-11-14 19:11:23,640 INFO L273 TraceCheckUtils]: 1: Hoare triple {1059#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1059#true} is VALID [2018-11-14 19:11:23,640 INFO L273 TraceCheckUtils]: 2: Hoare triple {1059#true} assume true; {1059#true} is VALID [2018-11-14 19:11:23,641 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1059#true} {1059#true} #355#return; {1059#true} is VALID [2018-11-14 19:11:23,641 INFO L256 TraceCheckUtils]: 4: Hoare triple {1059#true} call #t~ret28 := main(); {1059#true} is VALID [2018-11-14 19:11:23,641 INFO L273 TraceCheckUtils]: 5: Hoare triple {1059#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 0, 4);call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 4, 4); {1059#true} is VALID [2018-11-14 19:11:23,641 INFO L273 TraceCheckUtils]: 6: Hoare triple {1059#true} assume true; {1059#true} is VALID [2018-11-14 19:11:23,642 INFO L273 TraceCheckUtils]: 7: Hoare triple {1059#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {1059#true} is VALID [2018-11-14 19:11:23,642 INFO L273 TraceCheckUtils]: 8: Hoare triple {1059#true} assume true; {1059#true} is VALID [2018-11-14 19:11:23,642 INFO L273 TraceCheckUtils]: 9: Hoare triple {1059#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1059#true} is VALID [2018-11-14 19:11:23,642 INFO L273 TraceCheckUtils]: 10: Hoare triple {1059#true} assume #t~nondet1 != 0;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 8, 4); {1059#true} is VALID [2018-11-14 19:11:23,643 INFO L273 TraceCheckUtils]: 11: Hoare triple {1059#true} assume true;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {1061#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))))} is VALID [2018-11-14 19:11:23,644 INFO L273 TraceCheckUtils]: 12: Hoare triple {1061#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))))} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {1062#|main_#t~short7|} is VALID [2018-11-14 19:11:23,645 INFO L273 TraceCheckUtils]: 13: Hoare triple {1062#|main_#t~short7|} assume !#t~short7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~short7; {1060#false} is VALID [2018-11-14 19:11:23,645 INFO L273 TraceCheckUtils]: 14: Hoare triple {1060#false} assume !false; {1060#false} is VALID [2018-11-14 19:11:23,647 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:11:23,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:11:23,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 19:11:23,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-14 19:11:23,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:11:23,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 19:11:23,676 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:11:23,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 19:11:23,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 19:11:23,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 19:11:23,677 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 4 states. [2018-11-14 19:11:24,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:24,064 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2018-11-14 19:11:24,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 19:11:24,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-14 19:11:24,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:11:24,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:11:24,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2018-11-14 19:11:24,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:11:24,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2018-11-14 19:11:24,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 102 transitions. [2018-11-14 19:11:24,263 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:11:24,267 INFO L225 Difference]: With dead ends: 94 [2018-11-14 19:11:24,267 INFO L226 Difference]: Without dead ends: 92 [2018-11-14 19:11:24,268 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 19:11:24,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-14 19:11:24,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-11-14 19:11:24,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:11:24,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 90 states. [2018-11-14 19:11:24,294 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 90 states. [2018-11-14 19:11:24,294 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 90 states. [2018-11-14 19:11:24,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:24,298 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2018-11-14 19:11:24,298 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2018-11-14 19:11:24,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:11:24,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:11:24,300 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 92 states. [2018-11-14 19:11:24,300 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 92 states. [2018-11-14 19:11:24,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:24,304 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2018-11-14 19:11:24,304 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2018-11-14 19:11:24,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:11:24,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:11:24,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:11:24,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:11:24,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-14 19:11:24,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2018-11-14 19:11:24,310 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 15 [2018-11-14 19:11:24,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:11:24,310 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2018-11-14 19:11:24,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 19:11:24,310 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2018-11-14 19:11:24,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 19:11:24,312 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:11:24,312 INFO L375 BasicCegarLoop]: trace histogram [1, 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:11:24,313 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:11:24,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:11:24,313 INFO L82 PathProgramCache]: Analyzing trace with hash 800249225, now seen corresponding path program 1 times [2018-11-14 19:11:24,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:11:24,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:11:24,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:24,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:11:24,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:11:24,477 INFO L256 TraceCheckUtils]: 0: Hoare triple {1453#true} call ULTIMATE.init(); {1453#true} is VALID [2018-11-14 19:11:24,477 INFO L273 TraceCheckUtils]: 1: Hoare triple {1453#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1453#true} is VALID [2018-11-14 19:11:24,478 INFO L273 TraceCheckUtils]: 2: Hoare triple {1453#true} assume true; {1453#true} is VALID [2018-11-14 19:11:24,478 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1453#true} {1453#true} #355#return; {1453#true} is VALID [2018-11-14 19:11:24,478 INFO L256 TraceCheckUtils]: 4: Hoare triple {1453#true} call #t~ret28 := main(); {1453#true} is VALID [2018-11-14 19:11:24,478 INFO L273 TraceCheckUtils]: 5: Hoare triple {1453#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 0, 4);call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 4, 4); {1453#true} is VALID [2018-11-14 19:11:24,479 INFO L273 TraceCheckUtils]: 6: Hoare triple {1453#true} assume true; {1453#true} is VALID [2018-11-14 19:11:24,479 INFO L273 TraceCheckUtils]: 7: Hoare triple {1453#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {1453#true} is VALID [2018-11-14 19:11:24,479 INFO L273 TraceCheckUtils]: 8: Hoare triple {1453#true} assume true; {1453#true} is VALID [2018-11-14 19:11:24,479 INFO L273 TraceCheckUtils]: 9: Hoare triple {1453#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1453#true} is VALID [2018-11-14 19:11:24,481 INFO L273 TraceCheckUtils]: 10: Hoare triple {1453#true} assume #t~nondet1 != 0;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 8, 4); {1455#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2018-11-14 19:11:24,482 INFO L273 TraceCheckUtils]: 11: Hoare triple {1455#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))} assume true;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {1456#(not |main_#t~short7|)} is VALID [2018-11-14 19:11:24,485 INFO L273 TraceCheckUtils]: 12: Hoare triple {1456#(not |main_#t~short7|)} assume #t~short7; {1454#false} is VALID [2018-11-14 19:11:24,486 INFO L273 TraceCheckUtils]: 13: Hoare triple {1454#false} assume !!#t~short7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~short7; {1454#false} is VALID [2018-11-14 19:11:24,486 INFO L273 TraceCheckUtils]: 14: Hoare triple {1454#false} assume true; {1454#false} is VALID [2018-11-14 19:11:24,486 INFO L273 TraceCheckUtils]: 15: Hoare triple {1454#false} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1454#false} is VALID [2018-11-14 19:11:24,486 INFO L273 TraceCheckUtils]: 16: Hoare triple {1454#false} assume true; {1454#false} is VALID [2018-11-14 19:11:24,487 INFO L273 TraceCheckUtils]: 17: Hoare triple {1454#false} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {1454#false} is VALID [2018-11-14 19:11:24,487 INFO L273 TraceCheckUtils]: 18: Hoare triple {1454#false} assume !!(#t~nondet8 != 0);havoc #t~nondet8;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(12);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~end~0.base, ~end~0.offset + 0, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 0, 4);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem10.base, #t~mem10.offset + 4, 4);havoc #t~mem10.base, #t~mem10.offset;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 0, 4);~end~0.base, ~end~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset + 0, 4); {1454#false} is VALID [2018-11-14 19:11:24,487 INFO L273 TraceCheckUtils]: 19: Hoare triple {1454#false} assume true; {1454#false} is VALID [2018-11-14 19:11:24,488 INFO L273 TraceCheckUtils]: 20: Hoare triple {1454#false} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {1454#false} is VALID [2018-11-14 19:11:24,488 INFO L273 TraceCheckUtils]: 21: Hoare triple {1454#false} assume !false; {1454#false} is VALID [2018-11-14 19:11:24,490 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:11:24,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:11:24,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 19:11:24,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-14 19:11:24,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:11:24,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 19:11:24,530 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:11:24,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 19:11:24,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 19:11:24,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 19:11:24,532 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 4 states. [2018-11-14 19:11:25,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:25,088 INFO L93 Difference]: Finished difference Result 228 states and 250 transitions. [2018-11-14 19:11:25,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 19:11:25,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-14 19:11:25,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:11:25,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:11:25,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2018-11-14 19:11:25,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:11:25,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2018-11-14 19:11:25,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 250 transitions. [2018-11-14 19:11:25,579 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:11:25,583 INFO L225 Difference]: With dead ends: 228 [2018-11-14 19:11:25,583 INFO L226 Difference]: Without dead ends: 151 [2018-11-14 19:11:25,584 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 19:11:25,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-14 19:11:25,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 92. [2018-11-14 19:11:25,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:11:25,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand 92 states. [2018-11-14 19:11:25,618 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 92 states. [2018-11-14 19:11:25,618 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 92 states. [2018-11-14 19:11:25,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:25,623 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2018-11-14 19:11:25,623 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2018-11-14 19:11:25,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:11:25,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:11:25,625 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 151 states. [2018-11-14 19:11:25,625 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 151 states. [2018-11-14 19:11:25,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:25,631 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2018-11-14 19:11:25,631 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2018-11-14 19:11:25,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:11:25,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:11:25,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:11:25,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:11:25,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-14 19:11:25,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2018-11-14 19:11:25,635 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 22 [2018-11-14 19:11:25,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:11:25,636 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2018-11-14 19:11:25,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 19:11:25,636 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2018-11-14 19:11:25,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 19:11:25,637 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:11:25,637 INFO L375 BasicCegarLoop]: trace histogram [1, 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:11:25,637 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:11:25,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:11:25,638 INFO L82 PathProgramCache]: Analyzing trace with hash 407222215, now seen corresponding path program 1 times [2018-11-14 19:11:25,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:11:25,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:11:25,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:25,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:11:25,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:11:25,764 INFO L256 TraceCheckUtils]: 0: Hoare triple {2112#true} call ULTIMATE.init(); {2112#true} is VALID [2018-11-14 19:11:25,765 INFO L273 TraceCheckUtils]: 1: Hoare triple {2112#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2112#true} is VALID [2018-11-14 19:11:25,765 INFO L273 TraceCheckUtils]: 2: Hoare triple {2112#true} assume true; {2112#true} is VALID [2018-11-14 19:11:25,766 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2112#true} {2112#true} #355#return; {2112#true} is VALID [2018-11-14 19:11:25,766 INFO L256 TraceCheckUtils]: 4: Hoare triple {2112#true} call #t~ret28 := main(); {2112#true} is VALID [2018-11-14 19:11:25,772 INFO L273 TraceCheckUtils]: 5: Hoare triple {2112#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 0, 4);call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 4, 4); {2114#(= (select |#valid| main_~list~0.base) 1)} is VALID [2018-11-14 19:11:25,773 INFO L273 TraceCheckUtils]: 6: Hoare triple {2114#(= (select |#valid| main_~list~0.base) 1)} assume true; {2114#(= (select |#valid| main_~list~0.base) 1)} is VALID [2018-11-14 19:11:25,773 INFO L273 TraceCheckUtils]: 7: Hoare triple {2114#(= (select |#valid| main_~list~0.base) 1)} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {2114#(= (select |#valid| main_~list~0.base) 1)} is VALID [2018-11-14 19:11:25,774 INFO L273 TraceCheckUtils]: 8: Hoare triple {2114#(= (select |#valid| main_~list~0.base) 1)} assume true; {2114#(= (select |#valid| main_~list~0.base) 1)} is VALID [2018-11-14 19:11:25,774 INFO L273 TraceCheckUtils]: 9: Hoare triple {2114#(= (select |#valid| main_~list~0.base) 1)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2114#(= (select |#valid| main_~list~0.base) 1)} is VALID [2018-11-14 19:11:25,775 INFO L273 TraceCheckUtils]: 10: Hoare triple {2114#(= (select |#valid| main_~list~0.base) 1)} assume #t~nondet1 != 0;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 8, 4); {2114#(= (select |#valid| main_~list~0.base) 1)} is VALID [2018-11-14 19:11:25,776 INFO L273 TraceCheckUtils]: 11: Hoare triple {2114#(= (select |#valid| main_~list~0.base) 1)} assume true;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {2114#(= (select |#valid| main_~list~0.base) 1)} is VALID [2018-11-14 19:11:25,776 INFO L273 TraceCheckUtils]: 12: Hoare triple {2114#(= (select |#valid| main_~list~0.base) 1)} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {2114#(= (select |#valid| main_~list~0.base) 1)} is VALID [2018-11-14 19:11:25,777 INFO L273 TraceCheckUtils]: 13: Hoare triple {2114#(= (select |#valid| main_~list~0.base) 1)} assume !!#t~short7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~short7; {2114#(= (select |#valid| main_~list~0.base) 1)} is VALID [2018-11-14 19:11:25,778 INFO L273 TraceCheckUtils]: 14: Hoare triple {2114#(= (select |#valid| main_~list~0.base) 1)} assume true; {2114#(= (select |#valid| main_~list~0.base) 1)} is VALID [2018-11-14 19:11:25,779 INFO L273 TraceCheckUtils]: 15: Hoare triple {2114#(= (select |#valid| main_~list~0.base) 1)} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {2115#(= (select |#valid| main_~end~0.base) 1)} is VALID [2018-11-14 19:11:25,779 INFO L273 TraceCheckUtils]: 16: Hoare triple {2115#(= (select |#valid| main_~end~0.base) 1)} assume true; {2115#(= (select |#valid| main_~end~0.base) 1)} is VALID [2018-11-14 19:11:25,780 INFO L273 TraceCheckUtils]: 17: Hoare triple {2115#(= (select |#valid| main_~end~0.base) 1)} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {2115#(= (select |#valid| main_~end~0.base) 1)} is VALID [2018-11-14 19:11:25,782 INFO L273 TraceCheckUtils]: 18: Hoare triple {2115#(= (select |#valid| main_~end~0.base) 1)} assume !!(#t~nondet8 != 0);havoc #t~nondet8;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(12);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~end~0.base, ~end~0.offset + 0, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 0, 4);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem10.base, #t~mem10.offset + 4, 4);havoc #t~mem10.base, #t~mem10.offset;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 0, 4);~end~0.base, ~end~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset + 0, 4); {2116#(not (= main_~end~0.base 0))} is VALID [2018-11-14 19:11:25,783 INFO L273 TraceCheckUtils]: 19: Hoare triple {2116#(not (= main_~end~0.base 0))} assume true; {2116#(not (= main_~end~0.base 0))} is VALID [2018-11-14 19:11:25,784 INFO L273 TraceCheckUtils]: 20: Hoare triple {2116#(not (= main_~end~0.base 0))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {2113#false} is VALID [2018-11-14 19:11:25,784 INFO L273 TraceCheckUtils]: 21: Hoare triple {2113#false} assume !false; {2113#false} is VALID [2018-11-14 19:11:25,787 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:11:25,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:11:25,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 19:11:25,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-14 19:11:25,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:11:25,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:11:25,843 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:11:25,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:11:25,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:11:25,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:11:25,844 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 5 states. [2018-11-14 19:11:26,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:26,602 INFO L93 Difference]: Finished difference Result 145 states and 159 transitions. [2018-11-14 19:11:26,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:11:26,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-14 19:11:26,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:11:26,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:11:26,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2018-11-14 19:11:26,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:11:26,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2018-11-14 19:11:26,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 157 transitions. [2018-11-14 19:11:26,884 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:11:26,888 INFO L225 Difference]: With dead ends: 145 [2018-11-14 19:11:26,888 INFO L226 Difference]: Without dead ends: 141 [2018-11-14 19:11:26,888 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:11:26,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-14 19:11:26,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 88. [2018-11-14 19:11:26,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:11:26,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand 88 states. [2018-11-14 19:11:26,919 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 88 states. [2018-11-14 19:11:26,919 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 88 states. [2018-11-14 19:11:26,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:26,924 INFO L93 Difference]: Finished difference Result 141 states and 155 transitions. [2018-11-14 19:11:26,924 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 155 transitions. [2018-11-14 19:11:26,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:11:26,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:11:26,925 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 141 states. [2018-11-14 19:11:26,925 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 141 states. [2018-11-14 19:11:26,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:26,930 INFO L93 Difference]: Finished difference Result 141 states and 155 transitions. [2018-11-14 19:11:26,930 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 155 transitions. [2018-11-14 19:11:26,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:11:26,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:11:26,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:11:26,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:11:26,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-14 19:11:26,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2018-11-14 19:11:26,934 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 22 [2018-11-14 19:11:26,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:11:26,935 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2018-11-14 19:11:26,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:11:26,935 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2018-11-14 19:11:26,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 19:11:26,935 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:11:26,936 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 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:11:26,936 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:11:26,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:11:26,937 INFO L82 PathProgramCache]: Analyzing trace with hash -260673469, now seen corresponding path program 1 times [2018-11-14 19:11:26,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:11:26,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:11:26,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:26,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:11:26,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:11:27,039 INFO L256 TraceCheckUtils]: 0: Hoare triple {2661#true} call ULTIMATE.init(); {2661#true} is VALID [2018-11-14 19:11:27,039 INFO L273 TraceCheckUtils]: 1: Hoare triple {2661#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2661#true} is VALID [2018-11-14 19:11:27,039 INFO L273 TraceCheckUtils]: 2: Hoare triple {2661#true} assume true; {2661#true} is VALID [2018-11-14 19:11:27,040 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2661#true} {2661#true} #355#return; {2661#true} is VALID [2018-11-14 19:11:27,040 INFO L256 TraceCheckUtils]: 4: Hoare triple {2661#true} call #t~ret28 := main(); {2661#true} is VALID [2018-11-14 19:11:27,041 INFO L273 TraceCheckUtils]: 5: Hoare triple {2661#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 0, 4);call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 4, 4); {2663#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 19:11:27,042 INFO L273 TraceCheckUtils]: 6: Hoare triple {2663#(not (= 0 main_~list~0.base))} assume true; {2663#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 19:11:27,042 INFO L273 TraceCheckUtils]: 7: Hoare triple {2663#(not (= 0 main_~list~0.base))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {2663#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 19:11:27,045 INFO L273 TraceCheckUtils]: 8: Hoare triple {2663#(not (= 0 main_~list~0.base))} assume true; {2663#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 19:11:27,045 INFO L273 TraceCheckUtils]: 9: Hoare triple {2663#(not (= 0 main_~list~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2663#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 19:11:27,047 INFO L273 TraceCheckUtils]: 10: Hoare triple {2663#(not (= 0 main_~list~0.base))} assume #t~nondet1 != 0;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 8, 4); {2663#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 19:11:27,049 INFO L273 TraceCheckUtils]: 11: Hoare triple {2663#(not (= 0 main_~list~0.base))} assume true;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {2663#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 19:11:27,049 INFO L273 TraceCheckUtils]: 12: Hoare triple {2663#(not (= 0 main_~list~0.base))} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {2663#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 19:11:27,052 INFO L273 TraceCheckUtils]: 13: Hoare triple {2663#(not (= 0 main_~list~0.base))} assume !!#t~short7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~short7; {2663#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 19:11:27,052 INFO L273 TraceCheckUtils]: 14: Hoare triple {2663#(not (= 0 main_~list~0.base))} assume true; {2663#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 19:11:27,055 INFO L273 TraceCheckUtils]: 15: Hoare triple {2663#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {2663#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 19:11:27,057 INFO L273 TraceCheckUtils]: 16: Hoare triple {2663#(not (= 0 main_~list~0.base))} assume true; {2663#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 19:11:27,057 INFO L273 TraceCheckUtils]: 17: Hoare triple {2663#(not (= 0 main_~list~0.base))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {2663#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 19:11:27,060 INFO L273 TraceCheckUtils]: 18: Hoare triple {2663#(not (= 0 main_~list~0.base))} assume !(#t~nondet8 != 0);havoc #t~nondet8; {2663#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 19:11:27,060 INFO L273 TraceCheckUtils]: 19: Hoare triple {2663#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {2664#(not (= 0 main_~end~0.base))} is VALID [2018-11-14 19:11:27,063 INFO L273 TraceCheckUtils]: 20: Hoare triple {2664#(not (= 0 main_~end~0.base))} assume true; {2664#(not (= 0 main_~end~0.base))} is VALID [2018-11-14 19:11:27,063 INFO L273 TraceCheckUtils]: 21: Hoare triple {2664#(not (= 0 main_~end~0.base))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {2662#false} is VALID [2018-11-14 19:11:27,063 INFO L273 TraceCheckUtils]: 22: Hoare triple {2662#false} assume !false; {2662#false} is VALID [2018-11-14 19:11:27,066 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:11:27,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:11:27,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 19:11:27,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-14 19:11:27,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:11:27,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 19:11:27,097 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:11:27,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 19:11:27,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 19:11:27,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 19:11:27,098 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 4 states. [2018-11-14 19:11:27,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:27,687 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2018-11-14 19:11:27,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 19:11:27,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-14 19:11:27,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:11:27,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:11:27,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2018-11-14 19:11:27,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:11:27,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2018-11-14 19:11:27,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 167 transitions. [2018-11-14 19:11:28,204 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:11:28,207 INFO L225 Difference]: With dead ends: 155 [2018-11-14 19:11:28,207 INFO L226 Difference]: Without dead ends: 133 [2018-11-14 19:11:28,209 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 19:11:28,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-14 19:11:28,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 88. [2018-11-14 19:11:28,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:11:28,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 88 states. [2018-11-14 19:11:28,514 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 88 states. [2018-11-14 19:11:28,514 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 88 states. [2018-11-14 19:11:28,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:28,518 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2018-11-14 19:11:28,518 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2018-11-14 19:11:28,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:11:28,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:11:28,519 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 133 states. [2018-11-14 19:11:28,519 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 133 states. [2018-11-14 19:11:28,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:28,522 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2018-11-14 19:11:28,522 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2018-11-14 19:11:28,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:11:28,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:11:28,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:11:28,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:11:28,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-14 19:11:28,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2018-11-14 19:11:28,526 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 23 [2018-11-14 19:11:28,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:11:28,527 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2018-11-14 19:11:28,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 19:11:28,527 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2018-11-14 19:11:28,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 19:11:28,527 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:11:28,528 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:11:28,528 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:11:28,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:11:28,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1441611381, now seen corresponding path program 1 times [2018-11-14 19:11:28,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:11:28,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:11:28,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:28,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:11:28,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:28,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:11:28,782 INFO L256 TraceCheckUtils]: 0: Hoare triple {3201#true} call ULTIMATE.init(); {3201#true} is VALID [2018-11-14 19:11:28,782 INFO L273 TraceCheckUtils]: 1: Hoare triple {3201#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3201#true} is VALID [2018-11-14 19:11:28,783 INFO L273 TraceCheckUtils]: 2: Hoare triple {3201#true} assume true; {3201#true} is VALID [2018-11-14 19:11:28,783 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3201#true} {3201#true} #355#return; {3201#true} is VALID [2018-11-14 19:11:28,783 INFO L256 TraceCheckUtils]: 4: Hoare triple {3201#true} call #t~ret28 := main(); {3201#true} is VALID [2018-11-14 19:11:28,783 INFO L273 TraceCheckUtils]: 5: Hoare triple {3201#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 0, 4);call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 4, 4); {3201#true} is VALID [2018-11-14 19:11:28,784 INFO L273 TraceCheckUtils]: 6: Hoare triple {3201#true} assume true; {3201#true} is VALID [2018-11-14 19:11:28,784 INFO L273 TraceCheckUtils]: 7: Hoare triple {3201#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {3201#true} is VALID [2018-11-14 19:11:28,784 INFO L273 TraceCheckUtils]: 8: Hoare triple {3201#true} assume true; {3201#true} is VALID [2018-11-14 19:11:28,784 INFO L273 TraceCheckUtils]: 9: Hoare triple {3201#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3201#true} is VALID [2018-11-14 19:11:28,785 INFO L273 TraceCheckUtils]: 10: Hoare triple {3201#true} assume #t~nondet1 != 0;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 8, 4); {3201#true} is VALID [2018-11-14 19:11:28,785 INFO L273 TraceCheckUtils]: 11: Hoare triple {3201#true} assume true;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {3201#true} is VALID [2018-11-14 19:11:28,785 INFO L273 TraceCheckUtils]: 12: Hoare triple {3201#true} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {3201#true} is VALID [2018-11-14 19:11:28,785 INFO L273 TraceCheckUtils]: 13: Hoare triple {3201#true} assume !!#t~short7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~short7; {3201#true} is VALID [2018-11-14 19:11:28,786 INFO L273 TraceCheckUtils]: 14: Hoare triple {3201#true} assume true; {3201#true} is VALID [2018-11-14 19:11:28,786 INFO L273 TraceCheckUtils]: 15: Hoare triple {3201#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {3201#true} is VALID [2018-11-14 19:11:28,786 INFO L273 TraceCheckUtils]: 16: Hoare triple {3201#true} assume true; {3201#true} is VALID [2018-11-14 19:11:28,786 INFO L273 TraceCheckUtils]: 17: Hoare triple {3201#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {3201#true} is VALID [2018-11-14 19:11:28,787 INFO L273 TraceCheckUtils]: 18: Hoare triple {3201#true} assume !(#t~nondet8 != 0);havoc #t~nondet8; {3201#true} is VALID [2018-11-14 19:11:28,787 INFO L273 TraceCheckUtils]: 19: Hoare triple {3201#true} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {3201#true} is VALID [2018-11-14 19:11:28,787 INFO L273 TraceCheckUtils]: 20: Hoare triple {3201#true} assume true; {3201#true} is VALID [2018-11-14 19:11:28,787 INFO L273 TraceCheckUtils]: 21: Hoare triple {3201#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {3201#true} is VALID [2018-11-14 19:11:28,788 INFO L273 TraceCheckUtils]: 22: Hoare triple {3201#true} assume true; {3201#true} is VALID [2018-11-14 19:11:28,788 INFO L273 TraceCheckUtils]: 23: Hoare triple {3201#true} assume true; {3201#true} is VALID [2018-11-14 19:11:28,801 INFO L273 TraceCheckUtils]: 24: Hoare triple {3201#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset);~len~0 := 0;call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 8, 4);~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset; {3203#(= main_~len~0 0)} is VALID [2018-11-14 19:11:28,813 INFO L273 TraceCheckUtils]: 25: Hoare triple {3203#(= main_~len~0 0)} assume true; {3203#(= main_~len~0 0)} is VALID [2018-11-14 19:11:28,826 INFO L273 TraceCheckUtils]: 26: Hoare triple {3203#(= main_~len~0 0)} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {3203#(= main_~len~0 0)} is VALID [2018-11-14 19:11:28,839 INFO L273 TraceCheckUtils]: 27: Hoare triple {3203#(= main_~len~0 0)} assume true; {3203#(= main_~len~0 0)} is VALID [2018-11-14 19:11:28,852 INFO L273 TraceCheckUtils]: 28: Hoare triple {3203#(= main_~len~0 0)} assume !(~len~0 <= 1); {3202#false} is VALID [2018-11-14 19:11:28,852 INFO L273 TraceCheckUtils]: 29: Hoare triple {3202#false} assume !false; {3202#false} is VALID [2018-11-14 19:11:28,854 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:11:28,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:11:28,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 19:11:28,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 19:11:28,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:11:28,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 19:11:28,929 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:11:28,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 19:11:28,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 19:11:28,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:11:28,930 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 3 states. [2018-11-14 19:11:29,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:29,416 INFO L93 Difference]: Finished difference Result 164 states and 182 transitions. [2018-11-14 19:11:29,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 19:11:29,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 19:11:29,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:11:29,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:11:29,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 178 transitions. [2018-11-14 19:11:29,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:11:29,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 178 transitions. [2018-11-14 19:11:29,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 178 transitions. [2018-11-14 19:11:29,567 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:11:29,571 INFO L225 Difference]: With dead ends: 164 [2018-11-14 19:11:29,571 INFO L226 Difference]: Without dead ends: 117 [2018-11-14 19:11:29,572 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:11:29,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-14 19:11:29,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 93. [2018-11-14 19:11:29,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:11:29,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 93 states. [2018-11-14 19:11:29,608 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 93 states. [2018-11-14 19:11:29,608 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 93 states. [2018-11-14 19:11:29,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:29,611 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2018-11-14 19:11:29,612 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 129 transitions. [2018-11-14 19:11:29,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:11:29,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:11:29,612 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 117 states. [2018-11-14 19:11:29,612 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 117 states. [2018-11-14 19:11:29,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:29,615 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2018-11-14 19:11:29,615 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 129 transitions. [2018-11-14 19:11:29,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:11:29,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:11:29,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:11:29,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:11:29,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-14 19:11:29,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2018-11-14 19:11:29,619 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 30 [2018-11-14 19:11:29,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:11:29,619 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2018-11-14 19:11:29,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 19:11:29,619 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2018-11-14 19:11:29,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 19:11:29,620 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:11:29,620 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:11:29,621 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:11:29,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:11:29,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1740492039, now seen corresponding path program 1 times [2018-11-14 19:11:29,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:11:29,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:11:29,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:29,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:11:29,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:11:29,685 INFO L256 TraceCheckUtils]: 0: Hoare triple {3722#true} call ULTIMATE.init(); {3722#true} is VALID [2018-11-14 19:11:29,685 INFO L273 TraceCheckUtils]: 1: Hoare triple {3722#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3722#true} is VALID [2018-11-14 19:11:29,685 INFO L273 TraceCheckUtils]: 2: Hoare triple {3722#true} assume true; {3722#true} is VALID [2018-11-14 19:11:29,686 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3722#true} {3722#true} #355#return; {3722#true} is VALID [2018-11-14 19:11:29,686 INFO L256 TraceCheckUtils]: 4: Hoare triple {3722#true} call #t~ret28 := main(); {3722#true} is VALID [2018-11-14 19:11:29,686 INFO L273 TraceCheckUtils]: 5: Hoare triple {3722#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 0, 4);call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 4, 4); {3722#true} is VALID [2018-11-14 19:11:29,686 INFO L273 TraceCheckUtils]: 6: Hoare triple {3722#true} assume true; {3722#true} is VALID [2018-11-14 19:11:29,687 INFO L273 TraceCheckUtils]: 7: Hoare triple {3722#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {3722#true} is VALID [2018-11-14 19:11:29,687 INFO L273 TraceCheckUtils]: 8: Hoare triple {3722#true} assume true; {3722#true} is VALID [2018-11-14 19:11:29,687 INFO L273 TraceCheckUtils]: 9: Hoare triple {3722#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3722#true} is VALID [2018-11-14 19:11:29,687 INFO L273 TraceCheckUtils]: 10: Hoare triple {3722#true} assume #t~nondet1 != 0;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 8, 4); {3722#true} is VALID [2018-11-14 19:11:29,687 INFO L273 TraceCheckUtils]: 11: Hoare triple {3722#true} assume true;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {3722#true} is VALID [2018-11-14 19:11:29,687 INFO L273 TraceCheckUtils]: 12: Hoare triple {3722#true} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {3722#true} is VALID [2018-11-14 19:11:29,688 INFO L273 TraceCheckUtils]: 13: Hoare triple {3722#true} assume !!#t~short7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~short7; {3722#true} is VALID [2018-11-14 19:11:29,688 INFO L273 TraceCheckUtils]: 14: Hoare triple {3722#true} assume true; {3722#true} is VALID [2018-11-14 19:11:29,688 INFO L273 TraceCheckUtils]: 15: Hoare triple {3722#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {3722#true} is VALID [2018-11-14 19:11:29,688 INFO L273 TraceCheckUtils]: 16: Hoare triple {3722#true} assume true; {3722#true} is VALID [2018-11-14 19:11:29,688 INFO L273 TraceCheckUtils]: 17: Hoare triple {3722#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {3722#true} is VALID [2018-11-14 19:11:29,688 INFO L273 TraceCheckUtils]: 18: Hoare triple {3722#true} assume !(#t~nondet8 != 0);havoc #t~nondet8; {3722#true} is VALID [2018-11-14 19:11:29,689 INFO L273 TraceCheckUtils]: 19: Hoare triple {3722#true} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {3722#true} is VALID [2018-11-14 19:11:29,689 INFO L273 TraceCheckUtils]: 20: Hoare triple {3722#true} assume true; {3722#true} is VALID [2018-11-14 19:11:29,689 INFO L273 TraceCheckUtils]: 21: Hoare triple {3722#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {3722#true} is VALID [2018-11-14 19:11:29,689 INFO L273 TraceCheckUtils]: 22: Hoare triple {3722#true} assume true; {3722#true} is VALID [2018-11-14 19:11:29,689 INFO L273 TraceCheckUtils]: 23: Hoare triple {3722#true} assume true; {3722#true} is VALID [2018-11-14 19:11:29,689 INFO L273 TraceCheckUtils]: 24: Hoare triple {3722#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset);~len~0 := 0;call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 8, 4);~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset; {3722#true} is VALID [2018-11-14 19:11:29,690 INFO L273 TraceCheckUtils]: 25: Hoare triple {3722#true} assume true; {3722#true} is VALID [2018-11-14 19:11:29,690 INFO L273 TraceCheckUtils]: 26: Hoare triple {3722#true} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {3724#(or (not (= 0 main_~inner~0.offset)) (not (= 0 main_~inner~0.base)))} is VALID [2018-11-14 19:11:29,691 INFO L273 TraceCheckUtils]: 27: Hoare triple {3724#(or (not (= 0 main_~inner~0.offset)) (not (= 0 main_~inner~0.base)))} assume ~len~0 == 0;~len~0 := 1; {3724#(or (not (= 0 main_~inner~0.offset)) (not (= 0 main_~inner~0.base)))} is VALID [2018-11-14 19:11:29,691 INFO L273 TraceCheckUtils]: 28: Hoare triple {3724#(or (not (= 0 main_~inner~0.offset)) (not (= 0 main_~inner~0.base)))} assume true; {3724#(or (not (= 0 main_~inner~0.offset)) (not (= 0 main_~inner~0.base)))} is VALID [2018-11-14 19:11:29,692 INFO L273 TraceCheckUtils]: 29: Hoare triple {3724#(or (not (= 0 main_~inner~0.offset)) (not (= 0 main_~inner~0.base)))} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {3723#false} is VALID [2018-11-14 19:11:29,692 INFO L273 TraceCheckUtils]: 30: Hoare triple {3723#false} assume !false; {3723#false} is VALID [2018-11-14 19:11:29,693 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:11:29,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:11:29,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 19:11:29,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-14 19:11:29,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:11:29,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 19:11:29,758 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:11:29,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 19:11:29,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 19:11:29,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:11:29,759 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 3 states. [2018-11-14 19:11:29,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:29,919 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2018-11-14 19:11:29,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 19:11:29,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-14 19:11:29,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:11:29,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:11:29,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2018-11-14 19:11:29,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:11:29,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2018-11-14 19:11:29,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2018-11-14 19:11:30,139 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:11:30,141 INFO L225 Difference]: With dead ends: 93 [2018-11-14 19:11:30,142 INFO L226 Difference]: Without dead ends: 91 [2018-11-14 19:11:30,142 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:11:30,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-14 19:11:30,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-11-14 19:11:30,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:11:30,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 91 states. [2018-11-14 19:11:30,194 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 91 states. [2018-11-14 19:11:30,194 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 91 states. [2018-11-14 19:11:30,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:30,203 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-11-14 19:11:30,203 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2018-11-14 19:11:30,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:11:30,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:11:30,204 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 91 states. [2018-11-14 19:11:30,204 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 91 states. [2018-11-14 19:11:30,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:30,210 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-11-14 19:11:30,210 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2018-11-14 19:11:30,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:11:30,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:11:30,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:11:30,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:11:30,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-14 19:11:30,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2018-11-14 19:11:30,218 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 31 [2018-11-14 19:11:30,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:11:30,218 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2018-11-14 19:11:30,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 19:11:30,218 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2018-11-14 19:11:30,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 19:11:30,219 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:11:30,219 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:11:30,220 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:11:30,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:11:30,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1322889158, now seen corresponding path program 1 times [2018-11-14 19:11:30,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:11:30,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:11:30,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:30,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:11:30,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:11:30,308 INFO L256 TraceCheckUtils]: 0: Hoare triple {4115#true} call ULTIMATE.init(); {4115#true} is VALID [2018-11-14 19:11:30,308 INFO L273 TraceCheckUtils]: 1: Hoare triple {4115#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4115#true} is VALID [2018-11-14 19:11:30,308 INFO L273 TraceCheckUtils]: 2: Hoare triple {4115#true} assume true; {4115#true} is VALID [2018-11-14 19:11:30,309 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4115#true} {4115#true} #355#return; {4115#true} is VALID [2018-11-14 19:11:30,309 INFO L256 TraceCheckUtils]: 4: Hoare triple {4115#true} call #t~ret28 := main(); {4115#true} is VALID [2018-11-14 19:11:30,309 INFO L273 TraceCheckUtils]: 5: Hoare triple {4115#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 0, 4);call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 4, 4); {4115#true} is VALID [2018-11-14 19:11:30,309 INFO L273 TraceCheckUtils]: 6: Hoare triple {4115#true} assume true; {4115#true} is VALID [2018-11-14 19:11:30,309 INFO L273 TraceCheckUtils]: 7: Hoare triple {4115#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {4115#true} is VALID [2018-11-14 19:11:30,309 INFO L273 TraceCheckUtils]: 8: Hoare triple {4115#true} assume true; {4115#true} is VALID [2018-11-14 19:11:30,310 INFO L273 TraceCheckUtils]: 9: Hoare triple {4115#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4115#true} is VALID [2018-11-14 19:11:30,310 INFO L273 TraceCheckUtils]: 10: Hoare triple {4115#true} assume #t~nondet1 != 0;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 8, 4); {4115#true} is VALID [2018-11-14 19:11:30,310 INFO L273 TraceCheckUtils]: 11: Hoare triple {4115#true} assume true;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {4115#true} is VALID [2018-11-14 19:11:30,310 INFO L273 TraceCheckUtils]: 12: Hoare triple {4115#true} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {4115#true} is VALID [2018-11-14 19:11:30,310 INFO L273 TraceCheckUtils]: 13: Hoare triple {4115#true} assume !!#t~short7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~short7; {4115#true} is VALID [2018-11-14 19:11:30,311 INFO L273 TraceCheckUtils]: 14: Hoare triple {4115#true} assume true; {4115#true} is VALID [2018-11-14 19:11:30,311 INFO L273 TraceCheckUtils]: 15: Hoare triple {4115#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4115#true} is VALID [2018-11-14 19:11:30,311 INFO L273 TraceCheckUtils]: 16: Hoare triple {4115#true} assume true; {4115#true} is VALID [2018-11-14 19:11:30,311 INFO L273 TraceCheckUtils]: 17: Hoare triple {4115#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {4115#true} is VALID [2018-11-14 19:11:30,311 INFO L273 TraceCheckUtils]: 18: Hoare triple {4115#true} assume !!(#t~nondet8 != 0);havoc #t~nondet8;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(12);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~end~0.base, ~end~0.offset + 0, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 0, 4);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem10.base, #t~mem10.offset + 4, 4);havoc #t~mem10.base, #t~mem10.offset;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 0, 4);~end~0.base, ~end~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset + 0, 4); {4115#true} is VALID [2018-11-14 19:11:30,311 INFO L273 TraceCheckUtils]: 19: Hoare triple {4115#true} assume true; {4115#true} is VALID [2018-11-14 19:11:30,312 INFO L273 TraceCheckUtils]: 20: Hoare triple {4115#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {4115#true} is VALID [2018-11-14 19:11:30,312 INFO L273 TraceCheckUtils]: 21: Hoare triple {4115#true} assume true; {4115#true} is VALID [2018-11-14 19:11:30,312 INFO L273 TraceCheckUtils]: 22: Hoare triple {4115#true} assume true; {4115#true} is VALID [2018-11-14 19:11:30,312 INFO L273 TraceCheckUtils]: 23: Hoare triple {4115#true} assume !!(~end~0.base != 0 || ~end~0.offset != 0); {4115#true} is VALID [2018-11-14 19:11:30,313 INFO L273 TraceCheckUtils]: 24: Hoare triple {4115#true} assume true; {4115#true} is VALID [2018-11-14 19:11:30,313 INFO L273 TraceCheckUtils]: 25: Hoare triple {4115#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; {4115#true} is VALID [2018-11-14 19:11:30,313 INFO L273 TraceCheckUtils]: 26: Hoare triple {4115#true} assume #t~nondet12 != 0;havoc #t~nondet12;call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset + 8, 4); {4115#true} is VALID [2018-11-14 19:11:30,313 INFO L273 TraceCheckUtils]: 27: Hoare triple {4115#true} assume true;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 8, 4);#t~short18 := #t~mem16.base != 0 || #t~mem16.offset != 0; {4115#true} is VALID [2018-11-14 19:11:30,324 INFO L273 TraceCheckUtils]: 28: Hoare triple {4115#true} assume #t~short18; {4117#|main_#t~short18|} is VALID [2018-11-14 19:11:30,342 INFO L273 TraceCheckUtils]: 29: Hoare triple {4117#|main_#t~short18|} assume !#t~short18;havoc #t~mem16.base, #t~mem16.offset;havoc #t~mem17.base, #t~mem17.offset;havoc #t~short18; {4116#false} is VALID [2018-11-14 19:11:30,342 INFO L273 TraceCheckUtils]: 30: Hoare triple {4116#false} assume !false; {4116#false} is VALID [2018-11-14 19:11:30,343 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:11:30,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:11:30,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 19:11:30,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-14 19:11:30,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:11:30,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 19:11:30,416 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:11:30,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 19:11:30,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 19:11:30,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:11:30,417 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand 3 states. [2018-11-14 19:11:30,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:30,597 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2018-11-14 19:11:30,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 19:11:30,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-14 19:11:30,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:11:30,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:11:30,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2018-11-14 19:11:30,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:11:30,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2018-11-14 19:11:30,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 94 transitions. [2018-11-14 19:11:30,681 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:11:30,682 INFO L225 Difference]: With dead ends: 94 [2018-11-14 19:11:30,683 INFO L226 Difference]: Without dead ends: 92 [2018-11-14 19:11:30,683 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:11:30,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-14 19:11:30,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-11-14 19:11:30,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:11:30,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 92 states. [2018-11-14 19:11:30,711 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2018-11-14 19:11:30,712 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2018-11-14 19:11:30,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:30,715 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2018-11-14 19:11:30,715 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2018-11-14 19:11:30,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:11:30,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:11:30,716 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2018-11-14 19:11:30,716 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2018-11-14 19:11:30,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:30,719 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2018-11-14 19:11:30,719 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2018-11-14 19:11:30,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:11:30,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:11:30,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:11:30,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:11:30,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-14 19:11:30,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2018-11-14 19:11:30,723 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 31 [2018-11-14 19:11:30,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:11:30,723 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2018-11-14 19:11:30,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 19:11:30,724 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2018-11-14 19:11:30,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 19:11:30,724 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:11:30,724 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:11:30,725 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:11:30,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:11:30,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1322887236, now seen corresponding path program 1 times [2018-11-14 19:11:30,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:11:30,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:11:30,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:30,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:11:30,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:11:30,851 INFO L256 TraceCheckUtils]: 0: Hoare triple {4512#true} call ULTIMATE.init(); {4512#true} is VALID [2018-11-14 19:11:30,852 INFO L273 TraceCheckUtils]: 1: Hoare triple {4512#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4512#true} is VALID [2018-11-14 19:11:30,852 INFO L273 TraceCheckUtils]: 2: Hoare triple {4512#true} assume true; {4512#true} is VALID [2018-11-14 19:11:30,852 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4512#true} {4512#true} #355#return; {4512#true} is VALID [2018-11-14 19:11:30,853 INFO L256 TraceCheckUtils]: 4: Hoare triple {4512#true} call #t~ret28 := main(); {4512#true} is VALID [2018-11-14 19:11:30,853 INFO L273 TraceCheckUtils]: 5: Hoare triple {4512#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 0, 4);call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 4, 4); {4512#true} is VALID [2018-11-14 19:11:30,853 INFO L273 TraceCheckUtils]: 6: Hoare triple {4512#true} assume true; {4512#true} is VALID [2018-11-14 19:11:30,854 INFO L273 TraceCheckUtils]: 7: Hoare triple {4512#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {4512#true} is VALID [2018-11-14 19:11:30,854 INFO L273 TraceCheckUtils]: 8: Hoare triple {4512#true} assume true; {4512#true} is VALID [2018-11-14 19:11:30,854 INFO L273 TraceCheckUtils]: 9: Hoare triple {4512#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4512#true} is VALID [2018-11-14 19:11:30,855 INFO L273 TraceCheckUtils]: 10: Hoare triple {4512#true} assume #t~nondet1 != 0;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 8, 4); {4512#true} is VALID [2018-11-14 19:11:30,855 INFO L273 TraceCheckUtils]: 11: Hoare triple {4512#true} assume true;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {4512#true} is VALID [2018-11-14 19:11:30,855 INFO L273 TraceCheckUtils]: 12: Hoare triple {4512#true} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {4512#true} is VALID [2018-11-14 19:11:30,855 INFO L273 TraceCheckUtils]: 13: Hoare triple {4512#true} assume !!#t~short7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~short7; {4512#true} is VALID [2018-11-14 19:11:30,856 INFO L273 TraceCheckUtils]: 14: Hoare triple {4512#true} assume true; {4512#true} is VALID [2018-11-14 19:11:30,856 INFO L273 TraceCheckUtils]: 15: Hoare triple {4512#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4512#true} is VALID [2018-11-14 19:11:30,856 INFO L273 TraceCheckUtils]: 16: Hoare triple {4512#true} assume true; {4512#true} is VALID [2018-11-14 19:11:30,856 INFO L273 TraceCheckUtils]: 17: Hoare triple {4512#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {4512#true} is VALID [2018-11-14 19:11:30,856 INFO L273 TraceCheckUtils]: 18: Hoare triple {4512#true} assume !!(#t~nondet8 != 0);havoc #t~nondet8;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(12);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~end~0.base, ~end~0.offset + 0, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 0, 4);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem10.base, #t~mem10.offset + 4, 4);havoc #t~mem10.base, #t~mem10.offset;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 0, 4);~end~0.base, ~end~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset + 0, 4); {4512#true} is VALID [2018-11-14 19:11:30,857 INFO L273 TraceCheckUtils]: 19: Hoare triple {4512#true} assume true; {4512#true} is VALID [2018-11-14 19:11:30,857 INFO L273 TraceCheckUtils]: 20: Hoare triple {4512#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {4512#true} is VALID [2018-11-14 19:11:30,857 INFO L273 TraceCheckUtils]: 21: Hoare triple {4512#true} assume true; {4512#true} is VALID [2018-11-14 19:11:30,857 INFO L273 TraceCheckUtils]: 22: Hoare triple {4512#true} assume true; {4512#true} is VALID [2018-11-14 19:11:30,857 INFO L273 TraceCheckUtils]: 23: Hoare triple {4512#true} assume !!(~end~0.base != 0 || ~end~0.offset != 0); {4512#true} is VALID [2018-11-14 19:11:30,858 INFO L273 TraceCheckUtils]: 24: Hoare triple {4512#true} assume true; {4512#true} is VALID [2018-11-14 19:11:30,858 INFO L273 TraceCheckUtils]: 25: Hoare triple {4512#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; {4512#true} is VALID [2018-11-14 19:11:30,858 INFO L273 TraceCheckUtils]: 26: Hoare triple {4512#true} assume #t~nondet12 != 0;havoc #t~nondet12;call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset + 8, 4); {4512#true} is VALID [2018-11-14 19:11:30,861 INFO L273 TraceCheckUtils]: 27: Hoare triple {4512#true} assume true;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 8, 4);#t~short18 := #t~mem16.base != 0 || #t~mem16.offset != 0; {4514#(or |main_#t~short18| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))))} is VALID [2018-11-14 19:11:30,862 INFO L273 TraceCheckUtils]: 28: Hoare triple {4514#(or |main_#t~short18| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))))} assume !#t~short18;call #t~mem17.base, #t~mem17.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 8, 4);#t~short18 := #t~mem17.base == 0 && #t~mem17.offset == 0; {4515#|main_#t~short18|} is VALID [2018-11-14 19:11:30,863 INFO L273 TraceCheckUtils]: 29: Hoare triple {4515#|main_#t~short18|} assume !#t~short18;havoc #t~mem16.base, #t~mem16.offset;havoc #t~mem17.base, #t~mem17.offset;havoc #t~short18; {4513#false} is VALID [2018-11-14 19:11:30,863 INFO L273 TraceCheckUtils]: 30: Hoare triple {4513#false} assume !false; {4513#false} is VALID [2018-11-14 19:11:30,864 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:11:30,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:11:30,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 19:11:30,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-11-14 19:11:30,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:11:30,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 19:11:30,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:11:30,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 19:11:30,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 19:11:30,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 19:11:30,902 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 4 states. [2018-11-14 19:11:31,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:31,132 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2018-11-14 19:11:31,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 19:11:31,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-11-14 19:11:31,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:11:31,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:11:31,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2018-11-14 19:11:31,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:11:31,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2018-11-14 19:11:31,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 92 transitions. [2018-11-14 19:11:31,217 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:11:31,219 INFO L225 Difference]: With dead ends: 93 [2018-11-14 19:11:31,219 INFO L226 Difference]: Without dead ends: 91 [2018-11-14 19:11:31,220 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 19:11:31,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-14 19:11:31,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2018-11-14 19:11:31,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:11:31,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 89 states. [2018-11-14 19:11:31,280 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 89 states. [2018-11-14 19:11:31,280 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 89 states. [2018-11-14 19:11:31,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:31,284 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-11-14 19:11:31,284 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2018-11-14 19:11:31,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:11:31,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:11:31,284 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 91 states. [2018-11-14 19:11:31,285 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 91 states. [2018-11-14 19:11:31,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:31,287 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-11-14 19:11:31,287 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2018-11-14 19:11:31,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:11:31,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:11:31,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:11:31,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:11:31,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-14 19:11:31,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2018-11-14 19:11:31,289 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 31 [2018-11-14 19:11:31,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:11:31,290 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2018-11-14 19:11:31,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 19:11:31,290 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-11-14 19:11:31,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 19:11:31,291 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:11:31,291 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:11:31,291 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:11:31,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:11:31,292 INFO L82 PathProgramCache]: Analyzing trace with hash 2145940021, now seen corresponding path program 1 times [2018-11-14 19:11:31,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:11:31,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:11:31,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:31,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:11:31,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:11:31,617 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-14 19:11:31,703 INFO L256 TraceCheckUtils]: 0: Hoare triple {4904#true} call ULTIMATE.init(); {4904#true} is VALID [2018-11-14 19:11:31,703 INFO L273 TraceCheckUtils]: 1: Hoare triple {4904#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4904#true} is VALID [2018-11-14 19:11:31,704 INFO L273 TraceCheckUtils]: 2: Hoare triple {4904#true} assume true; {4904#true} is VALID [2018-11-14 19:11:31,704 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4904#true} {4904#true} #355#return; {4904#true} is VALID [2018-11-14 19:11:31,705 INFO L256 TraceCheckUtils]: 4: Hoare triple {4904#true} call #t~ret28 := main(); {4904#true} is VALID [2018-11-14 19:11:31,705 INFO L273 TraceCheckUtils]: 5: Hoare triple {4904#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 0, 4);call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 4, 4); {4904#true} is VALID [2018-11-14 19:11:31,705 INFO L273 TraceCheckUtils]: 6: Hoare triple {4904#true} assume true; {4904#true} is VALID [2018-11-14 19:11:31,706 INFO L273 TraceCheckUtils]: 7: Hoare triple {4904#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {4904#true} is VALID [2018-11-14 19:11:31,706 INFO L273 TraceCheckUtils]: 8: Hoare triple {4904#true} assume true; {4904#true} is VALID [2018-11-14 19:11:31,706 INFO L273 TraceCheckUtils]: 9: Hoare triple {4904#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4904#true} is VALID [2018-11-14 19:11:31,706 INFO L273 TraceCheckUtils]: 10: Hoare triple {4904#true} assume #t~nondet1 != 0;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 8, 4); {4904#true} is VALID [2018-11-14 19:11:31,707 INFO L273 TraceCheckUtils]: 11: Hoare triple {4904#true} assume true;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {4906#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))))} is VALID [2018-11-14 19:11:31,708 INFO L273 TraceCheckUtils]: 12: Hoare triple {4906#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))))} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {4907#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2018-11-14 19:11:31,708 INFO L273 TraceCheckUtils]: 13: Hoare triple {4907#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !!#t~short7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~short7; {4907#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2018-11-14 19:11:31,709 INFO L273 TraceCheckUtils]: 14: Hoare triple {4907#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))} assume true; {4907#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2018-11-14 19:11:31,709 INFO L273 TraceCheckUtils]: 15: Hoare triple {4907#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4907#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2018-11-14 19:11:31,710 INFO L273 TraceCheckUtils]: 16: Hoare triple {4907#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))} assume true; {4907#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2018-11-14 19:11:31,711 INFO L273 TraceCheckUtils]: 17: Hoare triple {4907#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {4907#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2018-11-14 19:11:31,712 INFO L273 TraceCheckUtils]: 18: Hoare triple {4907#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !(#t~nondet8 != 0);havoc #t~nondet8; {4907#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2018-11-14 19:11:31,713 INFO L273 TraceCheckUtils]: 19: Hoare triple {4907#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4908#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2018-11-14 19:11:31,714 INFO L273 TraceCheckUtils]: 20: Hoare triple {4908#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))} assume true; {4908#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2018-11-14 19:11:31,715 INFO L273 TraceCheckUtils]: 21: Hoare triple {4908#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {4908#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2018-11-14 19:11:31,716 INFO L273 TraceCheckUtils]: 22: Hoare triple {4908#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))} assume true; {4908#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2018-11-14 19:11:31,721 INFO L273 TraceCheckUtils]: 23: Hoare triple {4908#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))} assume true; {4908#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2018-11-14 19:11:31,722 INFO L273 TraceCheckUtils]: 24: Hoare triple {4908#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset);~len~0 := 0;call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 8, 4);~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset; {4909#(and (= 0 main_~inner~0.offset) (= 0 main_~inner~0.base))} is VALID [2018-11-14 19:11:31,725 INFO L273 TraceCheckUtils]: 25: Hoare triple {4909#(and (= 0 main_~inner~0.offset) (= 0 main_~inner~0.base))} assume true; {4909#(and (= 0 main_~inner~0.offset) (= 0 main_~inner~0.base))} is VALID [2018-11-14 19:11:31,730 INFO L273 TraceCheckUtils]: 26: Hoare triple {4909#(and (= 0 main_~inner~0.offset) (= 0 main_~inner~0.base))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {4905#false} is VALID [2018-11-14 19:11:31,730 INFO L273 TraceCheckUtils]: 27: Hoare triple {4905#false} assume ~len~0 == 0;~len~0 := 1; {4905#false} is VALID [2018-11-14 19:11:31,730 INFO L273 TraceCheckUtils]: 28: Hoare triple {4905#false} assume true; {4905#false} is VALID [2018-11-14 19:11:31,731 INFO L273 TraceCheckUtils]: 29: Hoare triple {4905#false} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {4905#false} is VALID [2018-11-14 19:11:31,731 INFO L273 TraceCheckUtils]: 30: Hoare triple {4905#false} assume true; {4905#false} is VALID [2018-11-14 19:11:31,731 INFO L273 TraceCheckUtils]: 31: Hoare triple {4905#false} assume true;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, ~inner~0.offset + 8, 4); {4905#false} is VALID [2018-11-14 19:11:31,731 INFO L273 TraceCheckUtils]: 32: Hoare triple {4905#false} assume !(0 == #t~mem20.base && 0 == #t~mem20.offset);havoc #t~mem20.base, #t~mem20.offset; {4905#false} is VALID [2018-11-14 19:11:31,732 INFO L273 TraceCheckUtils]: 33: Hoare triple {4905#false} assume !false; {4905#false} is VALID [2018-11-14 19:11:31,739 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:11:31,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:11:31,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 19:11:31,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-11-14 19:11:31,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:11:31,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:11:31,783 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:11:31,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:11:31,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:11:31,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:11:31,784 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 6 states. [2018-11-14 19:11:32,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:32,646 INFO L93 Difference]: Finished difference Result 215 states and 239 transitions. [2018-11-14 19:11:32,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 19:11:32,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-11-14 19:11:32,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:11:32,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:11:32,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 221 transitions. [2018-11-14 19:11:32,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:11:32,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 221 transitions. [2018-11-14 19:11:32,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 221 transitions. [2018-11-14 19:11:32,914 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:11:32,917 INFO L225 Difference]: With dead ends: 215 [2018-11-14 19:11:32,918 INFO L226 Difference]: Without dead ends: 165 [2018-11-14 19:11:32,918 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-14 19:11:32,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-14 19:11:32,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 103. [2018-11-14 19:11:32,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:11:32,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand 103 states. [2018-11-14 19:11:32,983 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 103 states. [2018-11-14 19:11:32,983 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 103 states. [2018-11-14 19:11:32,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:32,987 INFO L93 Difference]: Finished difference Result 165 states and 183 transitions. [2018-11-14 19:11:32,987 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 183 transitions. [2018-11-14 19:11:32,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:11:32,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:11:32,988 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 165 states. [2018-11-14 19:11:32,988 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 165 states. [2018-11-14 19:11:32,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:32,991 INFO L93 Difference]: Finished difference Result 165 states and 183 transitions. [2018-11-14 19:11:32,991 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 183 transitions. [2018-11-14 19:11:32,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:11:32,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:11:32,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:11:32,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:11:32,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-14 19:11:32,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2018-11-14 19:11:32,994 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 34 [2018-11-14 19:11:32,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:11:32,995 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2018-11-14 19:11:32,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:11:32,995 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2018-11-14 19:11:32,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 19:11:32,996 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:11:32,996 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:11:32,996 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:11:32,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:11:32,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1793071797, now seen corresponding path program 1 times [2018-11-14 19:11:32,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:11:32,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:11:32,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:32,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:11:32,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:11:33,382 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:128) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-14 19:11:33,386 INFO L168 Benchmark]: Toolchain (without parser) took 15513.05 ms. Allocated memory was 1.6 GB in the beginning and 2.4 GB in the end (delta: 874.0 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -335.3 MB). Peak memory consumption was 538.7 MB. Max. memory is 7.1 GB. [2018-11-14 19:11:33,387 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:11:33,388 INFO L168 Benchmark]: CACSL2BoogieTranslator took 713.39 ms. Allocated memory is still 1.6 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 19:11:33,389 INFO L168 Benchmark]: Boogie Preprocessor took 196.55 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 753.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -818.6 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2018-11-14 19:11:33,389 INFO L168 Benchmark]: RCFGBuilder took 1929.34 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 89.0 MB). Peak memory consumption was 89.0 MB. Max. memory is 7.1 GB. [2018-11-14 19:11:33,390 INFO L168 Benchmark]: TraceAbstraction took 12668.66 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 120.6 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 373.1 MB). Peak memory consumption was 493.7 MB. Max. memory is 7.1 GB. [2018-11-14 19:11:33,395 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.20 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 713.39 ms. Allocated memory is still 1.6 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 196.55 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 753.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -818.6 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1929.34 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 89.0 MB). Peak memory consumption was 89.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12668.66 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 120.6 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 373.1 MB). Peak memory consumption was 493.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...