java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/list-ext3-properties/dll_nullified_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:16:36,992 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:16:36,997 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:16:37,018 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:16:37,018 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:16:37,019 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:16:37,020 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:16:37,022 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:16:37,024 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:16:37,025 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:16:37,026 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:16:37,026 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:16:37,027 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:16:37,028 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:16:37,029 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:16:37,030 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:16:37,031 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:16:37,033 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:16:37,035 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:16:37,036 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:16:37,038 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:16:37,039 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:16:37,041 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:16:37,047 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:16:37,047 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:16:37,048 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:16:37,049 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:16:37,050 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:16:37,051 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:16:37,052 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:16:37,053 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:16:37,053 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:16:37,057 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:16:37,057 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:16:37,058 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:16:37,059 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:16:37,060 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:16:37,093 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:16:37,094 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:16:37,097 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:16:37,097 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:16:37,098 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:16:37,098 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:16:37,098 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:16:37,098 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:16:37,099 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:16:37,099 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:16:37,099 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:16:37,099 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:16:37,099 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:16:37,101 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:16:37,102 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:16:37,102 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:16:37,102 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:16:37,102 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:16:37,102 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:16:37,104 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:16:37,104 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:16:37,104 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:16:37,104 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:16:37,105 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:16:37,105 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:16:37,105 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:16:37,105 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:16:37,105 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:16:37,106 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:16:37,106 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:16:37,106 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:16:37,183 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:16:37,196 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:16:37,200 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:16:37,201 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:16:37,202 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:16:37,203 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/dll_nullified_true-unreach-call_true-valid-memsafety.i [2018-11-14 19:16:37,266 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15f960b3d/6df51162d8454394b0e87e5e5acf49ae/FLAG1007de297 [2018-11-14 19:16:37,876 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:16:37,877 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/dll_nullified_true-unreach-call_true-valid-memsafety.i [2018-11-14 19:16:37,893 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15f960b3d/6df51162d8454394b0e87e5e5acf49ae/FLAG1007de297 [2018-11-14 19:16:37,908 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15f960b3d/6df51162d8454394b0e87e5e5acf49ae [2018-11-14 19:16:37,918 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:16:37,920 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:16:37,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:16:37,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:16:37,925 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:16:37,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:16:37" (1/1) ... [2018-11-14 19:16:37,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cfc748f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:16:37, skipping insertion in model container [2018-11-14 19:16:37,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:16:37" (1/1) ... [2018-11-14 19:16:37,941 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:16:38,002 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:16:38,413 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:16:38,429 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:16:38,506 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:16:38,648 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:16:38,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:16:38 WrapperNode [2018-11-14 19:16:38,649 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:16:38,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:16:38,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:16:38,650 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:16:38,665 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:16:38" (1/1) ... [2018-11-14 19:16:38,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:16:38" (1/1) ... [2018-11-14 19:16:38,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:16:38" (1/1) ... [2018-11-14 19:16:38,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:16:38" (1/1) ... [2018-11-14 19:16:38,712 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:16:38" (1/1) ... [2018-11-14 19:16:38,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:16:38" (1/1) ... [2018-11-14 19:16:38,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:16:38" (1/1) ... [2018-11-14 19:16:38,730 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:16:38,731 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:16:38,731 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:16:38,731 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:16:38,732 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:16:38" (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:16:38,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:16:38,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:16:38,819 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 19:16:38,819 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 19:16:38,819 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-14 19:16:38,820 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-11-14 19:16:38,820 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:16:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:16:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 19:16:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 19:16:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 19:16:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 19:16:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 19:16:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 19:16:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 19:16:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 19:16:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 19:16:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 19:16:38,825 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 19:16:38,825 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 19:16:38,826 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 19:16:38,826 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 19:16:38,826 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 19:16:38,826 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 19:16:38,827 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 19:16:38,827 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 19:16:38,827 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 19:16:38,827 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 19:16:38,827 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 19:16:38,827 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 19:16:38,827 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 19:16:38,828 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 19:16:38,828 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 19:16:38,828 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 19:16:38,828 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 19:16:38,828 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 19:16:38,828 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 19:16:38,828 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 19:16:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 19:16:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 19:16:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 19:16:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 19:16:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 19:16:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 19:16:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 19:16:38,830 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 19:16:38,830 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 19:16:38,830 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 19:16:38,830 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 19:16:38,830 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 19:16:38,830 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 19:16:38,832 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 19:16:38,832 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 19:16:38,832 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 19:16:38,832 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 19:16:38,832 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 19:16:38,832 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 19:16:38,833 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 19:16:38,833 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 19:16:38,833 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 19:16:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 19:16:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 19:16:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 19:16:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 19:16:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 19:16:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 19:16:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 19:16:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 19:16:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 19:16:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 19:16:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 19:16:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 19:16:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 19:16:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 19:16:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 19:16:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 19:16:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 19:16:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 19:16:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 19:16:38,837 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 19:16:38,838 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 19:16:38,838 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 19:16:38,838 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 19:16:38,839 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 19:16:38,839 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 19:16:38,839 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 19:16:38,839 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 19:16:38,839 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 19:16:38,839 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 19:16:38,842 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 19:16:38,842 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 19:16:38,843 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 19:16:38,843 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 19:16:38,843 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 19:16:38,843 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 19:16:38,843 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 19:16:38,843 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 19:16:38,844 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 19:16:38,844 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 19:16:38,844 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 19:16:38,844 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 19:16:38,844 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 19:16:38,844 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 19:16:38,846 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 19:16:38,846 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 19:16:38,846 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 19:16:38,847 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 19:16:38,847 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 19:16:38,847 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 19:16:38,847 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 19:16:38,847 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 19:16:38,848 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 19:16:38,848 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 19:16:38,848 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-11-14 19:16:38,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 19:16:38,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 19:16:38,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 19:16:38,848 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:16:38,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 19:16:38,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 19:16:38,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 19:16:38,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:16:38,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:16:38,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 19:16:39,978 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:16:39,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:16:39 BoogieIcfgContainer [2018-11-14 19:16:39,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:16:39,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:16:39,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:16:39,984 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:16:39,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:16:37" (1/3) ... [2018-11-14 19:16:39,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6694881e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:16:39, skipping insertion in model container [2018-11-14 19:16:39,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:16:38" (2/3) ... [2018-11-14 19:16:39,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6694881e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:16:39, skipping insertion in model container [2018-11-14 19:16:39,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:16:39" (3/3) ... [2018-11-14 19:16:39,987 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nullified_true-unreach-call_true-valid-memsafety.i [2018-11-14 19:16:39,998 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:16:40,007 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 19:16:40,025 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 19:16:40,058 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:16:40,058 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:16:40,058 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:16:40,059 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:16:40,059 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:16:40,059 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:16:40,059 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:16:40,059 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:16:40,060 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:16:40,080 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-11-14 19:16:40,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 19:16:40,087 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:16:40,088 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] [2018-11-14 19:16:40,091 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:16:40,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:16:40,098 INFO L82 PathProgramCache]: Analyzing trace with hash 495412484, now seen corresponding path program 1 times [2018-11-14 19:16:40,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:16:40,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:16:40,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:40,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:16:40,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:16:40,310 INFO L256 TraceCheckUtils]: 0: Hoare triple {44#true} call ULTIMATE.init(); {44#true} is VALID [2018-11-14 19:16:40,315 INFO L273 TraceCheckUtils]: 1: Hoare triple {44#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {44#true} is VALID [2018-11-14 19:16:40,315 INFO L273 TraceCheckUtils]: 2: Hoare triple {44#true} assume true; {44#true} is VALID [2018-11-14 19:16:40,316 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {44#true} {44#true} #118#return; {44#true} is VALID [2018-11-14 19:16:40,317 INFO L256 TraceCheckUtils]: 4: Hoare triple {44#true} call #t~ret18 := main(); {44#true} is VALID [2018-11-14 19:16:40,317 INFO L273 TraceCheckUtils]: 5: Hoare triple {44#true} ~len~0 := 5; {44#true} is VALID [2018-11-14 19:16:40,317 INFO L256 TraceCheckUtils]: 6: Hoare triple {44#true} call #t~ret4.base, #t~ret4.offset := dll_create(~len~0); {44#true} is VALID [2018-11-14 19:16:40,318 INFO L273 TraceCheckUtils]: 7: Hoare triple {44#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {44#true} is VALID [2018-11-14 19:16:40,331 INFO L273 TraceCheckUtils]: 8: Hoare triple {44#true} assume !true; {45#false} is VALID [2018-11-14 19:16:40,332 INFO L273 TraceCheckUtils]: 9: Hoare triple {45#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {45#false} is VALID [2018-11-14 19:16:40,332 INFO L273 TraceCheckUtils]: 10: Hoare triple {45#false} assume true; {45#false} is VALID [2018-11-14 19:16:40,332 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {45#false} {44#true} #114#return; {45#false} is VALID [2018-11-14 19:16:40,333 INFO L273 TraceCheckUtils]: 12: Hoare triple {45#false} ~head~1.base, ~head~1.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset; {45#false} is VALID [2018-11-14 19:16:40,333 INFO L273 TraceCheckUtils]: 13: Hoare triple {45#false} assume !true; {45#false} is VALID [2018-11-14 19:16:40,333 INFO L273 TraceCheckUtils]: 14: Hoare triple {45#false} assume true; {45#false} is VALID [2018-11-14 19:16:40,333 INFO L273 TraceCheckUtils]: 15: Hoare triple {45#false} assume !!(~head~1.base != 0 || ~head~1.offset != 0);call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~head~1.base, ~head~1.offset + 12, 4);~temp~0.base, ~temp~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;call #t~mem13 := read~int(~head~1.base, ~head~1.offset + 0, 4);#t~short15 := 0 != #t~mem13; {45#false} is VALID [2018-11-14 19:16:40,334 INFO L273 TraceCheckUtils]: 16: Hoare triple {45#false} assume #t~short15; {45#false} is VALID [2018-11-14 19:16:40,334 INFO L273 TraceCheckUtils]: 17: Hoare triple {45#false} #t~short17 := #t~short15; {45#false} is VALID [2018-11-14 19:16:40,335 INFO L273 TraceCheckUtils]: 18: Hoare triple {45#false} assume #t~short17; {45#false} is VALID [2018-11-14 19:16:40,335 INFO L273 TraceCheckUtils]: 19: Hoare triple {45#false} assume #t~short17;havoc #t~mem14;havoc #t~short15;havoc #t~mem13;havoc #t~mem16;havoc #t~short17; {45#false} is VALID [2018-11-14 19:16:40,335 INFO L273 TraceCheckUtils]: 20: Hoare triple {45#false} assume !false; {45#false} is VALID [2018-11-14 19:16:40,340 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:16:40,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:16:40,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 19:16:40,349 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-14 19:16:40,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:16:40,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 19:16:40,504 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:16:40,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 19:16:40,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 19:16:40,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:16:40,517 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states. [2018-11-14 19:16:40,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:40,693 INFO L93 Difference]: Finished difference Result 65 states and 86 transitions. [2018-11-14 19:16:40,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 19:16:40,693 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-14 19:16:40,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:16:40,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:16:40,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 86 transitions. [2018-11-14 19:16:40,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:16:40,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 86 transitions. [2018-11-14 19:16:40,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 86 transitions. [2018-11-14 19:16:41,129 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:16:41,140 INFO L225 Difference]: With dead ends: 65 [2018-11-14 19:16:41,141 INFO L226 Difference]: Without dead ends: 33 [2018-11-14 19:16:41,145 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:16:41,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-14 19:16:41,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-14 19:16:41,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:16:41,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-14 19:16:41,187 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-14 19:16:41,187 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-14 19:16:41,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:41,194 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2018-11-14 19:16:41,194 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2018-11-14 19:16:41,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:16:41,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:16:41,196 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-14 19:16:41,196 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-14 19:16:41,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:41,202 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2018-11-14 19:16:41,204 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2018-11-14 19:16:41,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:16:41,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:16:41,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:16:41,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:16:41,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 19:16:41,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2018-11-14 19:16:41,211 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 21 [2018-11-14 19:16:41,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:16:41,212 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-11-14 19:16:41,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 19:16:41,212 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2018-11-14 19:16:41,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 19:16:41,214 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:16:41,214 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:16:41,214 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:16:41,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:16:41,215 INFO L82 PathProgramCache]: Analyzing trace with hash 119463260, now seen corresponding path program 1 times [2018-11-14 19:16:41,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:16:41,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:16:41,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:41,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:16:41,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:16:41,543 INFO L256 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {234#true} is VALID [2018-11-14 19:16:41,544 INFO L273 TraceCheckUtils]: 1: Hoare triple {234#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {234#true} is VALID [2018-11-14 19:16:41,544 INFO L273 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2018-11-14 19:16:41,544 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #118#return; {234#true} is VALID [2018-11-14 19:16:41,545 INFO L256 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret18 := main(); {234#true} is VALID [2018-11-14 19:16:41,545 INFO L273 TraceCheckUtils]: 5: Hoare triple {234#true} ~len~0 := 5; {234#true} is VALID [2018-11-14 19:16:41,545 INFO L256 TraceCheckUtils]: 6: Hoare triple {234#true} call #t~ret4.base, #t~ret4.offset := dll_create(~len~0); {234#true} is VALID [2018-11-14 19:16:41,546 INFO L273 TraceCheckUtils]: 7: Hoare triple {234#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {234#true} is VALID [2018-11-14 19:16:41,546 INFO L273 TraceCheckUtils]: 8: Hoare triple {234#true} assume true; {234#true} is VALID [2018-11-14 19:16:41,546 INFO L273 TraceCheckUtils]: 9: Hoare triple {234#true} assume !(~len > 0); {234#true} is VALID [2018-11-14 19:16:41,547 INFO L273 TraceCheckUtils]: 10: Hoare triple {234#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {234#true} is VALID [2018-11-14 19:16:41,547 INFO L273 TraceCheckUtils]: 11: Hoare triple {234#true} assume true; {234#true} is VALID [2018-11-14 19:16:41,547 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {234#true} {234#true} #114#return; {234#true} is VALID [2018-11-14 19:16:41,548 INFO L273 TraceCheckUtils]: 13: Hoare triple {234#true} ~head~1.base, ~head~1.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset; {234#true} is VALID [2018-11-14 19:16:41,548 INFO L273 TraceCheckUtils]: 14: Hoare triple {234#true} assume true; {234#true} is VALID [2018-11-14 19:16:41,548 INFO L273 TraceCheckUtils]: 15: Hoare triple {234#true} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head~1.base, ~head~1.offset + 4, 4); {234#true} is VALID [2018-11-14 19:16:41,549 INFO L273 TraceCheckUtils]: 16: Hoare triple {234#true} assume !!(#t~mem11.base != 0 || #t~mem11.offset != 0);havoc #t~mem11.base, #t~mem11.offset;call #t~mem5 := read~int(~head~1.base, ~head~1.offset + 0, 4);#t~short7 := 0 != #t~mem5; {234#true} is VALID [2018-11-14 19:16:41,560 INFO L273 TraceCheckUtils]: 17: Hoare triple {234#true} assume #t~short7; {236#|main_#t~short7|} is VALID [2018-11-14 19:16:41,574 INFO L273 TraceCheckUtils]: 18: Hoare triple {236#|main_#t~short7|} #t~short9 := #t~short7; {237#|main_#t~short9|} is VALID [2018-11-14 19:16:41,592 INFO L273 TraceCheckUtils]: 19: Hoare triple {237#|main_#t~short9|} assume !#t~short9;call #t~mem8 := read~int(~head~1.base, ~head~1.offset + 16, 4);#t~short9 := 0 != #t~mem8; {235#false} is VALID [2018-11-14 19:16:41,592 INFO L273 TraceCheckUtils]: 20: Hoare triple {235#false} assume #t~short9;havoc #t~short7;havoc #t~mem8;havoc #t~mem5;havoc #t~mem6;havoc #t~short9; {235#false} is VALID [2018-11-14 19:16:41,593 INFO L273 TraceCheckUtils]: 21: Hoare triple {235#false} assume !false; {235#false} is VALID [2018-11-14 19:16:41,595 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:16:41,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:16:41,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 19:16:41,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-14 19:16:41,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:16:41,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 19:16:41,820 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:16:41,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 19:16:41,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 19:16:41,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 19:16:41,822 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 4 states. [2018-11-14 19:16:42,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:42,090 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2018-11-14 19:16:42,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:16:42,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-14 19:16:42,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:16:42,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:16:42,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2018-11-14 19:16:42,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:16:42,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2018-11-14 19:16:42,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2018-11-14 19:16:42,270 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:16:42,273 INFO L225 Difference]: With dead ends: 52 [2018-11-14 19:16:42,274 INFO L226 Difference]: Without dead ends: 37 [2018-11-14 19:16:42,275 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:16:42,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-14 19:16:42,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-14 19:16:42,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:16:42,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 36 states. [2018-11-14 19:16:42,288 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 36 states. [2018-11-14 19:16:42,288 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 36 states. [2018-11-14 19:16:42,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:42,293 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2018-11-14 19:16:42,293 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-14 19:16:42,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:16:42,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:16:42,294 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 37 states. [2018-11-14 19:16:42,294 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 37 states. [2018-11-14 19:16:42,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:42,297 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2018-11-14 19:16:42,298 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-14 19:16:42,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:16:42,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:16:42,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:16:42,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:16:42,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 19:16:42,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-14 19:16:42,302 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 22 [2018-11-14 19:16:42,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:16:42,302 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-14 19:16:42,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 19:16:42,303 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-14 19:16:42,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 19:16:42,304 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:16:42,304 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:16:42,304 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:16:42,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:16:42,304 INFO L82 PathProgramCache]: Analyzing trace with hash 119461338, now seen corresponding path program 1 times [2018-11-14 19:16:42,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:16:42,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:16:42,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:42,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:16:42,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:16:42,435 INFO L256 TraceCheckUtils]: 0: Hoare triple {424#true} call ULTIMATE.init(); {424#true} is VALID [2018-11-14 19:16:42,435 INFO L273 TraceCheckUtils]: 1: Hoare triple {424#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {424#true} is VALID [2018-11-14 19:16:42,436 INFO L273 TraceCheckUtils]: 2: Hoare triple {424#true} assume true; {424#true} is VALID [2018-11-14 19:16:42,436 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {424#true} {424#true} #118#return; {424#true} is VALID [2018-11-14 19:16:42,436 INFO L256 TraceCheckUtils]: 4: Hoare triple {424#true} call #t~ret18 := main(); {424#true} is VALID [2018-11-14 19:16:42,437 INFO L273 TraceCheckUtils]: 5: Hoare triple {424#true} ~len~0 := 5; {426#(<= 5 main_~len~0)} is VALID [2018-11-14 19:16:42,437 INFO L256 TraceCheckUtils]: 6: Hoare triple {426#(<= 5 main_~len~0)} call #t~ret4.base, #t~ret4.offset := dll_create(~len~0); {424#true} is VALID [2018-11-14 19:16:42,439 INFO L273 TraceCheckUtils]: 7: Hoare triple {424#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {427#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:42,444 INFO L273 TraceCheckUtils]: 8: Hoare triple {427#(<= |dll_create_#in~len| dll_create_~len)} assume true; {427#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:42,445 INFO L273 TraceCheckUtils]: 9: Hoare triple {427#(<= |dll_create_#in~len| dll_create_~len)} assume !(~len > 0); {428#(<= |dll_create_#in~len| 0)} is VALID [2018-11-14 19:16:42,450 INFO L273 TraceCheckUtils]: 10: Hoare triple {428#(<= |dll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {428#(<= |dll_create_#in~len| 0)} is VALID [2018-11-14 19:16:42,453 INFO L273 TraceCheckUtils]: 11: Hoare triple {428#(<= |dll_create_#in~len| 0)} assume true; {428#(<= |dll_create_#in~len| 0)} is VALID [2018-11-14 19:16:42,455 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {428#(<= |dll_create_#in~len| 0)} {426#(<= 5 main_~len~0)} #114#return; {425#false} is VALID [2018-11-14 19:16:42,455 INFO L273 TraceCheckUtils]: 13: Hoare triple {425#false} ~head~1.base, ~head~1.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset; {425#false} is VALID [2018-11-14 19:16:42,456 INFO L273 TraceCheckUtils]: 14: Hoare triple {425#false} assume true; {425#false} is VALID [2018-11-14 19:16:42,456 INFO L273 TraceCheckUtils]: 15: Hoare triple {425#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head~1.base, ~head~1.offset + 4, 4); {425#false} is VALID [2018-11-14 19:16:42,456 INFO L273 TraceCheckUtils]: 16: Hoare triple {425#false} assume !!(#t~mem11.base != 0 || #t~mem11.offset != 0);havoc #t~mem11.base, #t~mem11.offset;call #t~mem5 := read~int(~head~1.base, ~head~1.offset + 0, 4);#t~short7 := 0 != #t~mem5; {425#false} is VALID [2018-11-14 19:16:42,457 INFO L273 TraceCheckUtils]: 17: Hoare triple {425#false} assume #t~short7; {425#false} is VALID [2018-11-14 19:16:42,457 INFO L273 TraceCheckUtils]: 18: Hoare triple {425#false} #t~short9 := #t~short7; {425#false} is VALID [2018-11-14 19:16:42,457 INFO L273 TraceCheckUtils]: 19: Hoare triple {425#false} assume #t~short9; {425#false} is VALID [2018-11-14 19:16:42,458 INFO L273 TraceCheckUtils]: 20: Hoare triple {425#false} assume #t~short9;havoc #t~short7;havoc #t~mem8;havoc #t~mem5;havoc #t~mem6;havoc #t~short9; {425#false} is VALID [2018-11-14 19:16:42,458 INFO L273 TraceCheckUtils]: 21: Hoare triple {425#false} assume !false; {425#false} is VALID [2018-11-14 19:16:42,459 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:16:42,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:16:42,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 19:16:42,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-14 19:16:42,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:16:42,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:16:42,489 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:16:42,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:16:42,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:16:42,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:16:42,490 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 5 states. [2018-11-14 19:16:42,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:42,771 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2018-11-14 19:16:42,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:16:42,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-14 19:16:42,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:16:42,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:16:42,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2018-11-14 19:16:42,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:16:42,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2018-11-14 19:16:42,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 74 transitions. [2018-11-14 19:16:42,954 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:16:42,957 INFO L225 Difference]: With dead ends: 64 [2018-11-14 19:16:42,957 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 19:16:42,958 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:16:42,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 19:16:42,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2018-11-14 19:16:42,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:16:42,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 38 states. [2018-11-14 19:16:42,983 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 38 states. [2018-11-14 19:16:42,983 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 38 states. [2018-11-14 19:16:42,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:42,986 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2018-11-14 19:16:42,987 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2018-11-14 19:16:42,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:16:42,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:16:42,988 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 42 states. [2018-11-14 19:16:42,988 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 42 states. [2018-11-14 19:16:42,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:42,991 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2018-11-14 19:16:42,991 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2018-11-14 19:16:42,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:16:42,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:16:42,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:16:42,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:16:42,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 19:16:42,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-11-14 19:16:42,995 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 22 [2018-11-14 19:16:42,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:16:42,995 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-11-14 19:16:42,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:16:42,996 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-11-14 19:16:42,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 19:16:42,997 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:16:42,997 INFO L375 BasicCegarLoop]: trace histogram [2, 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:16:42,997 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:16:42,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:16:42,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1546478554, now seen corresponding path program 1 times [2018-11-14 19:16:42,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:16:42,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:16:43,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:43,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:16:43,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:16:43,104 INFO L256 TraceCheckUtils]: 0: Hoare triple {641#true} call ULTIMATE.init(); {641#true} is VALID [2018-11-14 19:16:43,104 INFO L273 TraceCheckUtils]: 1: Hoare triple {641#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {641#true} is VALID [2018-11-14 19:16:43,105 INFO L273 TraceCheckUtils]: 2: Hoare triple {641#true} assume true; {641#true} is VALID [2018-11-14 19:16:43,105 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {641#true} {641#true} #118#return; {641#true} is VALID [2018-11-14 19:16:43,105 INFO L256 TraceCheckUtils]: 4: Hoare triple {641#true} call #t~ret18 := main(); {641#true} is VALID [2018-11-14 19:16:43,105 INFO L273 TraceCheckUtils]: 5: Hoare triple {641#true} ~len~0 := 5; {641#true} is VALID [2018-11-14 19:16:43,105 INFO L256 TraceCheckUtils]: 6: Hoare triple {641#true} call #t~ret4.base, #t~ret4.offset := dll_create(~len~0); {641#true} is VALID [2018-11-14 19:16:43,106 INFO L273 TraceCheckUtils]: 7: Hoare triple {641#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {643#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} is VALID [2018-11-14 19:16:43,111 INFO L273 TraceCheckUtils]: 8: Hoare triple {643#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} assume true; {643#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} is VALID [2018-11-14 19:16:43,116 INFO L273 TraceCheckUtils]: 9: Hoare triple {643#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {643#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} is VALID [2018-11-14 19:16:43,118 INFO L273 TraceCheckUtils]: 10: Hoare triple {643#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {643#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} is VALID [2018-11-14 19:16:43,119 INFO L273 TraceCheckUtils]: 11: Hoare triple {643#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} call write~int(0, ~new_head~0.base, ~new_head~0.offset + 0, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 8, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 16, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);call write~$Pointer$(0, 0, ~new_head~0.base, ~new_head~0.offset + 12, 4); {643#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} is VALID [2018-11-14 19:16:43,120 INFO L273 TraceCheckUtils]: 12: Hoare triple {643#(and (= dll_create_~head~0.base 0) (= dll_create_~head~0.offset 0))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~head~0.offset + 12, 4); {642#false} is VALID [2018-11-14 19:16:43,120 INFO L273 TraceCheckUtils]: 13: Hoare triple {642#false} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {642#false} is VALID [2018-11-14 19:16:43,121 INFO L273 TraceCheckUtils]: 14: Hoare triple {642#false} assume true; {642#false} is VALID [2018-11-14 19:16:43,121 INFO L273 TraceCheckUtils]: 15: Hoare triple {642#false} assume !(~len > 0); {642#false} is VALID [2018-11-14 19:16:43,121 INFO L273 TraceCheckUtils]: 16: Hoare triple {642#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {642#false} is VALID [2018-11-14 19:16:43,122 INFO L273 TraceCheckUtils]: 17: Hoare triple {642#false} assume true; {642#false} is VALID [2018-11-14 19:16:43,122 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {642#false} {641#true} #114#return; {642#false} is VALID [2018-11-14 19:16:43,123 INFO L273 TraceCheckUtils]: 19: Hoare triple {642#false} ~head~1.base, ~head~1.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset; {642#false} is VALID [2018-11-14 19:16:43,123 INFO L273 TraceCheckUtils]: 20: Hoare triple {642#false} assume true; {642#false} is VALID [2018-11-14 19:16:43,123 INFO L273 TraceCheckUtils]: 21: Hoare triple {642#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head~1.base, ~head~1.offset + 4, 4); {642#false} is VALID [2018-11-14 19:16:43,124 INFO L273 TraceCheckUtils]: 22: Hoare triple {642#false} assume !!(#t~mem11.base != 0 || #t~mem11.offset != 0);havoc #t~mem11.base, #t~mem11.offset;call #t~mem5 := read~int(~head~1.base, ~head~1.offset + 0, 4);#t~short7 := 0 != #t~mem5; {642#false} is VALID [2018-11-14 19:16:43,124 INFO L273 TraceCheckUtils]: 23: Hoare triple {642#false} assume #t~short7; {642#false} is VALID [2018-11-14 19:16:43,125 INFO L273 TraceCheckUtils]: 24: Hoare triple {642#false} #t~short9 := #t~short7; {642#false} is VALID [2018-11-14 19:16:43,125 INFO L273 TraceCheckUtils]: 25: Hoare triple {642#false} assume #t~short9; {642#false} is VALID [2018-11-14 19:16:43,125 INFO L273 TraceCheckUtils]: 26: Hoare triple {642#false} assume #t~short9;havoc #t~short7;havoc #t~mem8;havoc #t~mem5;havoc #t~mem6;havoc #t~short9; {642#false} is VALID [2018-11-14 19:16:43,125 INFO L273 TraceCheckUtils]: 27: Hoare triple {642#false} assume !false; {642#false} is VALID [2018-11-14 19:16:43,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:16:43,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:16:43,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 19:16:43,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 19:16:43,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:16:43,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 19:16:43,176 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:16:43,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 19:16:43,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 19:16:43,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:16:43,178 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 3 states. [2018-11-14 19:16:43,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:43,316 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2018-11-14 19:16:43,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 19:16:43,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 19:16:43,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:16:43,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:16:43,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2018-11-14 19:16:43,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:16:43,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2018-11-14 19:16:43,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 81 transitions. [2018-11-14 19:16:43,460 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:16:43,462 INFO L225 Difference]: With dead ends: 70 [2018-11-14 19:16:43,463 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 19:16:43,463 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:16:43,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 19:16:43,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-14 19:16:43,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:16:43,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2018-11-14 19:16:43,499 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2018-11-14 19:16:43,499 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2018-11-14 19:16:43,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:43,502 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-11-14 19:16:43,502 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-14 19:16:43,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:16:43,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:16:43,503 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2018-11-14 19:16:43,504 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2018-11-14 19:16:43,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:43,506 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-11-14 19:16:43,507 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-14 19:16:43,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:16:43,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:16:43,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:16:43,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:16:43,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 19:16:43,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-11-14 19:16:43,510 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 28 [2018-11-14 19:16:43,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:16:43,511 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-14 19:16:43,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 19:16:43,511 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-14 19:16:43,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 19:16:43,512 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:16:43,512 INFO L375 BasicCegarLoop]: trace histogram [2, 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:16:43,513 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:16:43,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:16:43,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1727420388, now seen corresponding path program 1 times [2018-11-14 19:16:43,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:16:43,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:16:43,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:43,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:16:43,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:16:43,753 INFO L256 TraceCheckUtils]: 0: Hoare triple {864#true} call ULTIMATE.init(); {864#true} is VALID [2018-11-14 19:16:43,753 INFO L273 TraceCheckUtils]: 1: Hoare triple {864#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {864#true} is VALID [2018-11-14 19:16:43,754 INFO L273 TraceCheckUtils]: 2: Hoare triple {864#true} assume true; {864#true} is VALID [2018-11-14 19:16:43,754 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {864#true} {864#true} #118#return; {864#true} is VALID [2018-11-14 19:16:43,754 INFO L256 TraceCheckUtils]: 4: Hoare triple {864#true} call #t~ret18 := main(); {864#true} is VALID [2018-11-14 19:16:43,755 INFO L273 TraceCheckUtils]: 5: Hoare triple {864#true} ~len~0 := 5; {864#true} is VALID [2018-11-14 19:16:43,755 INFO L256 TraceCheckUtils]: 6: Hoare triple {864#true} call #t~ret4.base, #t~ret4.offset := dll_create(~len~0); {864#true} is VALID [2018-11-14 19:16:43,755 INFO L273 TraceCheckUtils]: 7: Hoare triple {864#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {864#true} is VALID [2018-11-14 19:16:43,755 INFO L273 TraceCheckUtils]: 8: Hoare triple {864#true} assume true; {864#true} is VALID [2018-11-14 19:16:43,756 INFO L273 TraceCheckUtils]: 9: Hoare triple {864#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {864#true} is VALID [2018-11-14 19:16:43,756 INFO L273 TraceCheckUtils]: 10: Hoare triple {864#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {864#true} is VALID [2018-11-14 19:16:43,757 INFO L273 TraceCheckUtils]: 11: Hoare triple {864#true} call write~int(0, ~new_head~0.base, ~new_head~0.offset + 0, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 8, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 16, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);call write~$Pointer$(0, 0, ~new_head~0.base, ~new_head~0.offset + 12, 4); {866#(= 0 (select (select |#memory_int| dll_create_~new_head~0.base) dll_create_~new_head~0.offset))} is VALID [2018-11-14 19:16:43,761 INFO L273 TraceCheckUtils]: 12: Hoare triple {866#(= 0 (select (select |#memory_int| dll_create_~new_head~0.base) dll_create_~new_head~0.offset))} assume !(~head~0.base != 0 || ~head~0.offset != 0); {866#(= 0 (select (select |#memory_int| dll_create_~new_head~0.base) dll_create_~new_head~0.offset))} is VALID [2018-11-14 19:16:43,762 INFO L273 TraceCheckUtils]: 13: Hoare triple {866#(= 0 (select (select |#memory_int| dll_create_~new_head~0.base) dll_create_~new_head~0.offset))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {867#(= 0 (select (select |#memory_int| dll_create_~head~0.base) dll_create_~head~0.offset))} is VALID [2018-11-14 19:16:43,763 INFO L273 TraceCheckUtils]: 14: Hoare triple {867#(= 0 (select (select |#memory_int| dll_create_~head~0.base) dll_create_~head~0.offset))} assume true; {867#(= 0 (select (select |#memory_int| dll_create_~head~0.base) dll_create_~head~0.offset))} is VALID [2018-11-14 19:16:43,763 INFO L273 TraceCheckUtils]: 15: Hoare triple {867#(= 0 (select (select |#memory_int| dll_create_~head~0.base) dll_create_~head~0.offset))} assume !(~len > 0); {867#(= 0 (select (select |#memory_int| dll_create_~head~0.base) dll_create_~head~0.offset))} is VALID [2018-11-14 19:16:43,764 INFO L273 TraceCheckUtils]: 16: Hoare triple {867#(= 0 (select (select |#memory_int| dll_create_~head~0.base) dll_create_~head~0.offset))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {868#(= 0 (select (select |#memory_int| |dll_create_#res.base|) |dll_create_#res.offset|))} is VALID [2018-11-14 19:16:43,765 INFO L273 TraceCheckUtils]: 17: Hoare triple {868#(= 0 (select (select |#memory_int| |dll_create_#res.base|) |dll_create_#res.offset|))} assume true; {868#(= 0 (select (select |#memory_int| |dll_create_#res.base|) |dll_create_#res.offset|))} is VALID [2018-11-14 19:16:43,767 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {868#(= 0 (select (select |#memory_int| |dll_create_#res.base|) |dll_create_#res.offset|))} {864#true} #114#return; {869#(= 0 (select (select |#memory_int| |main_#t~ret4.base|) |main_#t~ret4.offset|))} is VALID [2018-11-14 19:16:43,768 INFO L273 TraceCheckUtils]: 19: Hoare triple {869#(= 0 (select (select |#memory_int| |main_#t~ret4.base|) |main_#t~ret4.offset|))} ~head~1.base, ~head~1.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset; {870#(= 0 (select (select |#memory_int| main_~head~1.base) main_~head~1.offset))} is VALID [2018-11-14 19:16:43,769 INFO L273 TraceCheckUtils]: 20: Hoare triple {870#(= 0 (select (select |#memory_int| main_~head~1.base) main_~head~1.offset))} assume true; {870#(= 0 (select (select |#memory_int| main_~head~1.base) main_~head~1.offset))} is VALID [2018-11-14 19:16:43,772 INFO L273 TraceCheckUtils]: 21: Hoare triple {870#(= 0 (select (select |#memory_int| main_~head~1.base) main_~head~1.offset))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head~1.base, ~head~1.offset + 4, 4); {870#(= 0 (select (select |#memory_int| main_~head~1.base) main_~head~1.offset))} is VALID [2018-11-14 19:16:43,774 INFO L273 TraceCheckUtils]: 22: Hoare triple {870#(= 0 (select (select |#memory_int| main_~head~1.base) main_~head~1.offset))} assume !!(#t~mem11.base != 0 || #t~mem11.offset != 0);havoc #t~mem11.base, #t~mem11.offset;call #t~mem5 := read~int(~head~1.base, ~head~1.offset + 0, 4);#t~short7 := 0 != #t~mem5; {871#(not |main_#t~short7|)} is VALID [2018-11-14 19:16:43,774 INFO L273 TraceCheckUtils]: 23: Hoare triple {871#(not |main_#t~short7|)} assume #t~short7; {865#false} is VALID [2018-11-14 19:16:43,774 INFO L273 TraceCheckUtils]: 24: Hoare triple {865#false} #t~short9 := #t~short7; {865#false} is VALID [2018-11-14 19:16:43,775 INFO L273 TraceCheckUtils]: 25: Hoare triple {865#false} assume #t~short9; {865#false} is VALID [2018-11-14 19:16:43,775 INFO L273 TraceCheckUtils]: 26: Hoare triple {865#false} assume #t~short9;havoc #t~short7;havoc #t~mem8;havoc #t~mem5;havoc #t~mem6;havoc #t~short9; {865#false} is VALID [2018-11-14 19:16:43,775 INFO L273 TraceCheckUtils]: 27: Hoare triple {865#false} assume !false; {865#false} is VALID [2018-11-14 19:16:43,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:16:43,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:16:43,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-14 19:16:43,779 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-14 19:16:43,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:16:43,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 19:16:43,832 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:16:43,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 19:16:43,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 19:16:43,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:16:43,833 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 8 states. [2018-11-14 19:16:44,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:44,555 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2018-11-14 19:16:44,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 19:16:44,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-14 19:16:44,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:16:44,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:16:44,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2018-11-14 19:16:44,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:16:44,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2018-11-14 19:16:44,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 72 transitions. [2018-11-14 19:16:44,645 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:16:44,648 INFO L225 Difference]: With dead ends: 63 [2018-11-14 19:16:44,648 INFO L226 Difference]: Without dead ends: 58 [2018-11-14 19:16:44,649 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-14 19:16:44,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-14 19:16:44,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2018-11-14 19:16:44,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:16:44,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 45 states. [2018-11-14 19:16:44,674 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 45 states. [2018-11-14 19:16:44,675 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 45 states. [2018-11-14 19:16:44,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:44,678 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2018-11-14 19:16:44,679 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2018-11-14 19:16:44,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:16:44,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:16:44,680 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 58 states. [2018-11-14 19:16:44,680 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 58 states. [2018-11-14 19:16:44,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:44,683 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2018-11-14 19:16:44,683 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2018-11-14 19:16:44,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:16:44,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:16:44,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:16:44,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:16:44,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-14 19:16:44,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2018-11-14 19:16:44,687 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 28 [2018-11-14 19:16:44,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:16:44,688 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-11-14 19:16:44,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 19:16:44,688 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2018-11-14 19:16:44,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 19:16:44,689 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:16:44,689 INFO L375 BasicCegarLoop]: trace histogram [2, 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:16:44,689 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:16:44,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:16:44,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1729269352, now seen corresponding path program 1 times [2018-11-14 19:16:44,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:16:44,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:16:44,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:44,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:16:44,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:16:44,835 INFO L256 TraceCheckUtils]: 0: Hoare triple {1129#true} call ULTIMATE.init(); {1129#true} is VALID [2018-11-14 19:16:44,836 INFO L273 TraceCheckUtils]: 1: Hoare triple {1129#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1129#true} is VALID [2018-11-14 19:16:44,836 INFO L273 TraceCheckUtils]: 2: Hoare triple {1129#true} assume true; {1129#true} is VALID [2018-11-14 19:16:44,837 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1129#true} {1129#true} #118#return; {1129#true} is VALID [2018-11-14 19:16:44,838 INFO L256 TraceCheckUtils]: 4: Hoare triple {1129#true} call #t~ret18 := main(); {1129#true} is VALID [2018-11-14 19:16:44,839 INFO L273 TraceCheckUtils]: 5: Hoare triple {1129#true} ~len~0 := 5; {1131#(<= 5 main_~len~0)} is VALID [2018-11-14 19:16:44,839 INFO L256 TraceCheckUtils]: 6: Hoare triple {1131#(<= 5 main_~len~0)} call #t~ret4.base, #t~ret4.offset := dll_create(~len~0); {1129#true} is VALID [2018-11-14 19:16:44,842 INFO L273 TraceCheckUtils]: 7: Hoare triple {1129#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {1132#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:44,848 INFO L273 TraceCheckUtils]: 8: Hoare triple {1132#(<= |dll_create_#in~len| dll_create_~len)} assume true; {1132#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:44,848 INFO L273 TraceCheckUtils]: 9: Hoare triple {1132#(<= |dll_create_#in~len| dll_create_~len)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1132#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:44,849 INFO L273 TraceCheckUtils]: 10: Hoare triple {1132#(<= |dll_create_#in~len| dll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1132#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:44,849 INFO L273 TraceCheckUtils]: 11: Hoare triple {1132#(<= |dll_create_#in~len| dll_create_~len)} call write~int(0, ~new_head~0.base, ~new_head~0.offset + 0, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 8, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 16, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);call write~$Pointer$(0, 0, ~new_head~0.base, ~new_head~0.offset + 12, 4); {1132#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:44,850 INFO L273 TraceCheckUtils]: 12: Hoare triple {1132#(<= |dll_create_#in~len| dll_create_~len)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1132#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:44,850 INFO L273 TraceCheckUtils]: 13: Hoare triple {1132#(<= |dll_create_#in~len| dll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1133#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:44,851 INFO L273 TraceCheckUtils]: 14: Hoare triple {1133#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume true; {1133#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:44,851 INFO L273 TraceCheckUtils]: 15: Hoare triple {1133#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(~len > 0); {1134#(<= |dll_create_#in~len| 1)} is VALID [2018-11-14 19:16:44,852 INFO L273 TraceCheckUtils]: 16: Hoare triple {1134#(<= |dll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1134#(<= |dll_create_#in~len| 1)} is VALID [2018-11-14 19:16:44,852 INFO L273 TraceCheckUtils]: 17: Hoare triple {1134#(<= |dll_create_#in~len| 1)} assume true; {1134#(<= |dll_create_#in~len| 1)} is VALID [2018-11-14 19:16:44,854 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1134#(<= |dll_create_#in~len| 1)} {1131#(<= 5 main_~len~0)} #114#return; {1130#false} is VALID [2018-11-14 19:16:44,854 INFO L273 TraceCheckUtils]: 19: Hoare triple {1130#false} ~head~1.base, ~head~1.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset; {1130#false} is VALID [2018-11-14 19:16:44,855 INFO L273 TraceCheckUtils]: 20: Hoare triple {1130#false} assume true; {1130#false} is VALID [2018-11-14 19:16:44,855 INFO L273 TraceCheckUtils]: 21: Hoare triple {1130#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head~1.base, ~head~1.offset + 4, 4); {1130#false} is VALID [2018-11-14 19:16:44,855 INFO L273 TraceCheckUtils]: 22: Hoare triple {1130#false} assume !!(#t~mem11.base != 0 || #t~mem11.offset != 0);havoc #t~mem11.base, #t~mem11.offset;call #t~mem5 := read~int(~head~1.base, ~head~1.offset + 0, 4);#t~short7 := 0 != #t~mem5; {1130#false} is VALID [2018-11-14 19:16:44,856 INFO L273 TraceCheckUtils]: 23: Hoare triple {1130#false} assume !#t~short7;call #t~mem6 := read~int(~head~1.base, ~head~1.offset + 8, 4);#t~short7 := 0 != #t~mem6; {1130#false} is VALID [2018-11-14 19:16:44,856 INFO L273 TraceCheckUtils]: 24: Hoare triple {1130#false} #t~short9 := #t~short7; {1130#false} is VALID [2018-11-14 19:16:44,857 INFO L273 TraceCheckUtils]: 25: Hoare triple {1130#false} assume !#t~short9;call #t~mem8 := read~int(~head~1.base, ~head~1.offset + 16, 4);#t~short9 := 0 != #t~mem8; {1130#false} is VALID [2018-11-14 19:16:44,857 INFO L273 TraceCheckUtils]: 26: Hoare triple {1130#false} assume #t~short9;havoc #t~short7;havoc #t~mem8;havoc #t~mem5;havoc #t~mem6;havoc #t~short9; {1130#false} is VALID [2018-11-14 19:16:44,857 INFO L273 TraceCheckUtils]: 27: Hoare triple {1130#false} assume !false; {1130#false} is VALID [2018-11-14 19:16:44,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:16:44,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:16:44,860 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:16:44,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:16:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:16:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:16:44,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:16:45,293 INFO L256 TraceCheckUtils]: 0: Hoare triple {1129#true} call ULTIMATE.init(); {1129#true} is VALID [2018-11-14 19:16:45,294 INFO L273 TraceCheckUtils]: 1: Hoare triple {1129#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1129#true} is VALID [2018-11-14 19:16:45,294 INFO L273 TraceCheckUtils]: 2: Hoare triple {1129#true} assume true; {1129#true} is VALID [2018-11-14 19:16:45,294 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1129#true} {1129#true} #118#return; {1129#true} is VALID [2018-11-14 19:16:45,294 INFO L256 TraceCheckUtils]: 4: Hoare triple {1129#true} call #t~ret18 := main(); {1129#true} is VALID [2018-11-14 19:16:45,295 INFO L273 TraceCheckUtils]: 5: Hoare triple {1129#true} ~len~0 := 5; {1131#(<= 5 main_~len~0)} is VALID [2018-11-14 19:16:45,295 INFO L256 TraceCheckUtils]: 6: Hoare triple {1131#(<= 5 main_~len~0)} call #t~ret4.base, #t~ret4.offset := dll_create(~len~0); {1129#true} is VALID [2018-11-14 19:16:45,296 INFO L273 TraceCheckUtils]: 7: Hoare triple {1129#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {1132#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:45,296 INFO L273 TraceCheckUtils]: 8: Hoare triple {1132#(<= |dll_create_#in~len| dll_create_~len)} assume true; {1132#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:45,297 INFO L273 TraceCheckUtils]: 9: Hoare triple {1132#(<= |dll_create_#in~len| dll_create_~len)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1132#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:45,297 INFO L273 TraceCheckUtils]: 10: Hoare triple {1132#(<= |dll_create_#in~len| dll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1132#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:45,298 INFO L273 TraceCheckUtils]: 11: Hoare triple {1132#(<= |dll_create_#in~len| dll_create_~len)} call write~int(0, ~new_head~0.base, ~new_head~0.offset + 0, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 8, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 16, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);call write~$Pointer$(0, 0, ~new_head~0.base, ~new_head~0.offset + 12, 4); {1132#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:45,298 INFO L273 TraceCheckUtils]: 12: Hoare triple {1132#(<= |dll_create_#in~len| dll_create_~len)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1132#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:45,299 INFO L273 TraceCheckUtils]: 13: Hoare triple {1132#(<= |dll_create_#in~len| dll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1133#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:45,300 INFO L273 TraceCheckUtils]: 14: Hoare triple {1133#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume true; {1133#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:45,301 INFO L273 TraceCheckUtils]: 15: Hoare triple {1133#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(~len > 0); {1134#(<= |dll_create_#in~len| 1)} is VALID [2018-11-14 19:16:45,302 INFO L273 TraceCheckUtils]: 16: Hoare triple {1134#(<= |dll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1134#(<= |dll_create_#in~len| 1)} is VALID [2018-11-14 19:16:45,303 INFO L273 TraceCheckUtils]: 17: Hoare triple {1134#(<= |dll_create_#in~len| 1)} assume true; {1134#(<= |dll_create_#in~len| 1)} is VALID [2018-11-14 19:16:45,304 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1134#(<= |dll_create_#in~len| 1)} {1131#(<= 5 main_~len~0)} #114#return; {1130#false} is VALID [2018-11-14 19:16:45,305 INFO L273 TraceCheckUtils]: 19: Hoare triple {1130#false} ~head~1.base, ~head~1.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset; {1130#false} is VALID [2018-11-14 19:16:45,305 INFO L273 TraceCheckUtils]: 20: Hoare triple {1130#false} assume true; {1130#false} is VALID [2018-11-14 19:16:45,305 INFO L273 TraceCheckUtils]: 21: Hoare triple {1130#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head~1.base, ~head~1.offset + 4, 4); {1130#false} is VALID [2018-11-14 19:16:45,306 INFO L273 TraceCheckUtils]: 22: Hoare triple {1130#false} assume !!(#t~mem11.base != 0 || #t~mem11.offset != 0);havoc #t~mem11.base, #t~mem11.offset;call #t~mem5 := read~int(~head~1.base, ~head~1.offset + 0, 4);#t~short7 := 0 != #t~mem5; {1130#false} is VALID [2018-11-14 19:16:45,306 INFO L273 TraceCheckUtils]: 23: Hoare triple {1130#false} assume !#t~short7;call #t~mem6 := read~int(~head~1.base, ~head~1.offset + 8, 4);#t~short7 := 0 != #t~mem6; {1130#false} is VALID [2018-11-14 19:16:45,307 INFO L273 TraceCheckUtils]: 24: Hoare triple {1130#false} #t~short9 := #t~short7; {1130#false} is VALID [2018-11-14 19:16:45,307 INFO L273 TraceCheckUtils]: 25: Hoare triple {1130#false} assume !#t~short9;call #t~mem8 := read~int(~head~1.base, ~head~1.offset + 16, 4);#t~short9 := 0 != #t~mem8; {1130#false} is VALID [2018-11-14 19:16:45,307 INFO L273 TraceCheckUtils]: 26: Hoare triple {1130#false} assume #t~short9;havoc #t~short7;havoc #t~mem8;havoc #t~mem5;havoc #t~mem6;havoc #t~short9; {1130#false} is VALID [2018-11-14 19:16:45,308 INFO L273 TraceCheckUtils]: 27: Hoare triple {1130#false} assume !false; {1130#false} is VALID [2018-11-14 19:16:45,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:16:45,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:16:45,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-14 19:16:45,334 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-14 19:16:45,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:16:45,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:16:45,638 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:16:45,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:16:45,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:16:45,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:16:45,639 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand 6 states. [2018-11-14 19:16:46,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:46,068 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2018-11-14 19:16:46,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 19:16:46,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-14 19:16:46,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:16:46,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:16:46,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2018-11-14 19:16:46,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:16:46,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2018-11-14 19:16:46,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 80 transitions. [2018-11-14 19:16:46,241 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:16:46,244 INFO L225 Difference]: With dead ends: 78 [2018-11-14 19:16:46,245 INFO L226 Difference]: Without dead ends: 52 [2018-11-14 19:16:46,245 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:16:46,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-14 19:16:46,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-11-14 19:16:46,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:16:46,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 48 states. [2018-11-14 19:16:46,268 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 48 states. [2018-11-14 19:16:46,268 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 48 states. [2018-11-14 19:16:46,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:46,272 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-11-14 19:16:46,272 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-11-14 19:16:46,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:16:46,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:16:46,273 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 52 states. [2018-11-14 19:16:46,273 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 52 states. [2018-11-14 19:16:46,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:46,275 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-11-14 19:16:46,276 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-11-14 19:16:46,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:16:46,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:16:46,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:16:46,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:16:46,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 19:16:46,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2018-11-14 19:16:46,278 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 28 [2018-11-14 19:16:46,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:16:46,279 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2018-11-14 19:16:46,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:16:46,279 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2018-11-14 19:16:46,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 19:16:46,280 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:16:46,280 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 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:16:46,280 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:16:46,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:16:46,281 INFO L82 PathProgramCache]: Analyzing trace with hash -2120538828, now seen corresponding path program 1 times [2018-11-14 19:16:46,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:16:46,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:16:46,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:46,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:16:46,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:16:46,512 INFO L256 TraceCheckUtils]: 0: Hoare triple {1477#true} call ULTIMATE.init(); {1477#true} is VALID [2018-11-14 19:16:46,512 INFO L273 TraceCheckUtils]: 1: Hoare triple {1477#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1477#true} is VALID [2018-11-14 19:16:46,513 INFO L273 TraceCheckUtils]: 2: Hoare triple {1477#true} assume true; {1477#true} is VALID [2018-11-14 19:16:46,513 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1477#true} {1477#true} #118#return; {1477#true} is VALID [2018-11-14 19:16:46,513 INFO L256 TraceCheckUtils]: 4: Hoare triple {1477#true} call #t~ret18 := main(); {1477#true} is VALID [2018-11-14 19:16:46,513 INFO L273 TraceCheckUtils]: 5: Hoare triple {1477#true} ~len~0 := 5; {1479#(<= 5 main_~len~0)} is VALID [2018-11-14 19:16:46,514 INFO L256 TraceCheckUtils]: 6: Hoare triple {1479#(<= 5 main_~len~0)} call #t~ret4.base, #t~ret4.offset := dll_create(~len~0); {1477#true} is VALID [2018-11-14 19:16:46,515 INFO L273 TraceCheckUtils]: 7: Hoare triple {1477#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {1480#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:46,515 INFO L273 TraceCheckUtils]: 8: Hoare triple {1480#(<= |dll_create_#in~len| dll_create_~len)} assume true; {1480#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:46,517 INFO L273 TraceCheckUtils]: 9: Hoare triple {1480#(<= |dll_create_#in~len| dll_create_~len)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1480#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:46,517 INFO L273 TraceCheckUtils]: 10: Hoare triple {1480#(<= |dll_create_#in~len| dll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1480#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:46,520 INFO L273 TraceCheckUtils]: 11: Hoare triple {1480#(<= |dll_create_#in~len| dll_create_~len)} call write~int(0, ~new_head~0.base, ~new_head~0.offset + 0, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 8, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 16, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);call write~$Pointer$(0, 0, ~new_head~0.base, ~new_head~0.offset + 12, 4); {1480#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:46,520 INFO L273 TraceCheckUtils]: 12: Hoare triple {1480#(<= |dll_create_#in~len| dll_create_~len)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1480#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:46,522 INFO L273 TraceCheckUtils]: 13: Hoare triple {1480#(<= |dll_create_#in~len| dll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1481#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:46,522 INFO L273 TraceCheckUtils]: 14: Hoare triple {1481#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume true; {1481#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:46,523 INFO L273 TraceCheckUtils]: 15: Hoare triple {1481#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1481#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:46,529 INFO L273 TraceCheckUtils]: 16: Hoare triple {1481#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1481#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:46,529 INFO L273 TraceCheckUtils]: 17: Hoare triple {1481#(<= |dll_create_#in~len| (+ dll_create_~len 1))} call write~int(0, ~new_head~0.base, ~new_head~0.offset + 0, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 8, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 16, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);call write~$Pointer$(0, 0, ~new_head~0.base, ~new_head~0.offset + 12, 4); {1481#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:46,532 INFO L273 TraceCheckUtils]: 18: Hoare triple {1481#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~head~0.offset + 12, 4); {1481#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:46,532 INFO L273 TraceCheckUtils]: 19: Hoare triple {1481#(<= |dll_create_#in~len| (+ dll_create_~len 1))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1482#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2018-11-14 19:16:46,534 INFO L273 TraceCheckUtils]: 20: Hoare triple {1482#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume true; {1482#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2018-11-14 19:16:46,534 INFO L273 TraceCheckUtils]: 21: Hoare triple {1482#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume !(~len > 0); {1483#(<= |dll_create_#in~len| 2)} is VALID [2018-11-14 19:16:46,536 INFO L273 TraceCheckUtils]: 22: Hoare triple {1483#(<= |dll_create_#in~len| 2)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1483#(<= |dll_create_#in~len| 2)} is VALID [2018-11-14 19:16:46,536 INFO L273 TraceCheckUtils]: 23: Hoare triple {1483#(<= |dll_create_#in~len| 2)} assume true; {1483#(<= |dll_create_#in~len| 2)} is VALID [2018-11-14 19:16:46,539 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1483#(<= |dll_create_#in~len| 2)} {1479#(<= 5 main_~len~0)} #114#return; {1478#false} is VALID [2018-11-14 19:16:46,539 INFO L273 TraceCheckUtils]: 25: Hoare triple {1478#false} ~head~1.base, ~head~1.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset; {1478#false} is VALID [2018-11-14 19:16:46,539 INFO L273 TraceCheckUtils]: 26: Hoare triple {1478#false} assume true; {1478#false} is VALID [2018-11-14 19:16:46,539 INFO L273 TraceCheckUtils]: 27: Hoare triple {1478#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head~1.base, ~head~1.offset + 4, 4); {1478#false} is VALID [2018-11-14 19:16:46,540 INFO L273 TraceCheckUtils]: 28: Hoare triple {1478#false} assume !!(#t~mem11.base != 0 || #t~mem11.offset != 0);havoc #t~mem11.base, #t~mem11.offset;call #t~mem5 := read~int(~head~1.base, ~head~1.offset + 0, 4);#t~short7 := 0 != #t~mem5; {1478#false} is VALID [2018-11-14 19:16:46,540 INFO L273 TraceCheckUtils]: 29: Hoare triple {1478#false} assume !#t~short7;call #t~mem6 := read~int(~head~1.base, ~head~1.offset + 8, 4);#t~short7 := 0 != #t~mem6; {1478#false} is VALID [2018-11-14 19:16:46,540 INFO L273 TraceCheckUtils]: 30: Hoare triple {1478#false} #t~short9 := #t~short7; {1478#false} is VALID [2018-11-14 19:16:46,540 INFO L273 TraceCheckUtils]: 31: Hoare triple {1478#false} assume !#t~short9;call #t~mem8 := read~int(~head~1.base, ~head~1.offset + 16, 4);#t~short9 := 0 != #t~mem8; {1478#false} is VALID [2018-11-14 19:16:46,541 INFO L273 TraceCheckUtils]: 32: Hoare triple {1478#false} assume #t~short9;havoc #t~short7;havoc #t~mem8;havoc #t~mem5;havoc #t~mem6;havoc #t~short9; {1478#false} is VALID [2018-11-14 19:16:46,541 INFO L273 TraceCheckUtils]: 33: Hoare triple {1478#false} assume !false; {1478#false} is VALID [2018-11-14 19:16:46,543 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:16:46,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:16:46,544 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:16:46,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:16:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:16:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:16:46,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:16:46,733 INFO L256 TraceCheckUtils]: 0: Hoare triple {1477#true} call ULTIMATE.init(); {1477#true} is VALID [2018-11-14 19:16:46,734 INFO L273 TraceCheckUtils]: 1: Hoare triple {1477#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1477#true} is VALID [2018-11-14 19:16:46,734 INFO L273 TraceCheckUtils]: 2: Hoare triple {1477#true} assume true; {1477#true} is VALID [2018-11-14 19:16:46,734 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1477#true} {1477#true} #118#return; {1477#true} is VALID [2018-11-14 19:16:46,735 INFO L256 TraceCheckUtils]: 4: Hoare triple {1477#true} call #t~ret18 := main(); {1477#true} is VALID [2018-11-14 19:16:46,735 INFO L273 TraceCheckUtils]: 5: Hoare triple {1477#true} ~len~0 := 5; {1479#(<= 5 main_~len~0)} is VALID [2018-11-14 19:16:46,736 INFO L256 TraceCheckUtils]: 6: Hoare triple {1479#(<= 5 main_~len~0)} call #t~ret4.base, #t~ret4.offset := dll_create(~len~0); {1477#true} is VALID [2018-11-14 19:16:46,736 INFO L273 TraceCheckUtils]: 7: Hoare triple {1477#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {1480#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:46,737 INFO L273 TraceCheckUtils]: 8: Hoare triple {1480#(<= |dll_create_#in~len| dll_create_~len)} assume true; {1480#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:46,737 INFO L273 TraceCheckUtils]: 9: Hoare triple {1480#(<= |dll_create_#in~len| dll_create_~len)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1480#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:46,738 INFO L273 TraceCheckUtils]: 10: Hoare triple {1480#(<= |dll_create_#in~len| dll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1480#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:46,739 INFO L273 TraceCheckUtils]: 11: Hoare triple {1480#(<= |dll_create_#in~len| dll_create_~len)} call write~int(0, ~new_head~0.base, ~new_head~0.offset + 0, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 8, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 16, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);call write~$Pointer$(0, 0, ~new_head~0.base, ~new_head~0.offset + 12, 4); {1480#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:46,740 INFO L273 TraceCheckUtils]: 12: Hoare triple {1480#(<= |dll_create_#in~len| dll_create_~len)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1480#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:46,760 INFO L273 TraceCheckUtils]: 13: Hoare triple {1480#(<= |dll_create_#in~len| dll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1481#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:46,769 INFO L273 TraceCheckUtils]: 14: Hoare triple {1481#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume true; {1481#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:46,784 INFO L273 TraceCheckUtils]: 15: Hoare triple {1481#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1481#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:46,798 INFO L273 TraceCheckUtils]: 16: Hoare triple {1481#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1481#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:46,800 INFO L273 TraceCheckUtils]: 17: Hoare triple {1481#(<= |dll_create_#in~len| (+ dll_create_~len 1))} call write~int(0, ~new_head~0.base, ~new_head~0.offset + 0, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 8, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 16, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);call write~$Pointer$(0, 0, ~new_head~0.base, ~new_head~0.offset + 12, 4); {1481#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:46,800 INFO L273 TraceCheckUtils]: 18: Hoare triple {1481#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~head~0.offset + 12, 4); {1481#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:46,802 INFO L273 TraceCheckUtils]: 19: Hoare triple {1481#(<= |dll_create_#in~len| (+ dll_create_~len 1))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1482#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2018-11-14 19:16:46,803 INFO L273 TraceCheckUtils]: 20: Hoare triple {1482#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume true; {1482#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2018-11-14 19:16:46,803 INFO L273 TraceCheckUtils]: 21: Hoare triple {1482#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume !(~len > 0); {1483#(<= |dll_create_#in~len| 2)} is VALID [2018-11-14 19:16:46,804 INFO L273 TraceCheckUtils]: 22: Hoare triple {1483#(<= |dll_create_#in~len| 2)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1483#(<= |dll_create_#in~len| 2)} is VALID [2018-11-14 19:16:46,805 INFO L273 TraceCheckUtils]: 23: Hoare triple {1483#(<= |dll_create_#in~len| 2)} assume true; {1483#(<= |dll_create_#in~len| 2)} is VALID [2018-11-14 19:16:46,806 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1483#(<= |dll_create_#in~len| 2)} {1479#(<= 5 main_~len~0)} #114#return; {1478#false} is VALID [2018-11-14 19:16:46,807 INFO L273 TraceCheckUtils]: 25: Hoare triple {1478#false} ~head~1.base, ~head~1.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset; {1478#false} is VALID [2018-11-14 19:16:46,807 INFO L273 TraceCheckUtils]: 26: Hoare triple {1478#false} assume true; {1478#false} is VALID [2018-11-14 19:16:46,807 INFO L273 TraceCheckUtils]: 27: Hoare triple {1478#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head~1.base, ~head~1.offset + 4, 4); {1478#false} is VALID [2018-11-14 19:16:46,808 INFO L273 TraceCheckUtils]: 28: Hoare triple {1478#false} assume !!(#t~mem11.base != 0 || #t~mem11.offset != 0);havoc #t~mem11.base, #t~mem11.offset;call #t~mem5 := read~int(~head~1.base, ~head~1.offset + 0, 4);#t~short7 := 0 != #t~mem5; {1478#false} is VALID [2018-11-14 19:16:46,808 INFO L273 TraceCheckUtils]: 29: Hoare triple {1478#false} assume !#t~short7;call #t~mem6 := read~int(~head~1.base, ~head~1.offset + 8, 4);#t~short7 := 0 != #t~mem6; {1478#false} is VALID [2018-11-14 19:16:46,809 INFO L273 TraceCheckUtils]: 30: Hoare triple {1478#false} #t~short9 := #t~short7; {1478#false} is VALID [2018-11-14 19:16:46,809 INFO L273 TraceCheckUtils]: 31: Hoare triple {1478#false} assume !#t~short9;call #t~mem8 := read~int(~head~1.base, ~head~1.offset + 16, 4);#t~short9 := 0 != #t~mem8; {1478#false} is VALID [2018-11-14 19:16:46,809 INFO L273 TraceCheckUtils]: 32: Hoare triple {1478#false} assume #t~short9;havoc #t~short7;havoc #t~mem8;havoc #t~mem5;havoc #t~mem6;havoc #t~short9; {1478#false} is VALID [2018-11-14 19:16:46,810 INFO L273 TraceCheckUtils]: 33: Hoare triple {1478#false} assume !false; {1478#false} is VALID [2018-11-14 19:16:46,812 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:16:46,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:16:46,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-14 19:16:46,844 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-11-14 19:16:46,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:16:46,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 19:16:46,969 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:16:46,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 19:16:46,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 19:16:46,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:16:46,970 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand 7 states. [2018-11-14 19:16:47,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:47,535 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2018-11-14 19:16:47,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:16:47,535 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-11-14 19:16:47,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:16:47,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:16:47,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2018-11-14 19:16:47,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:16:47,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2018-11-14 19:16:47,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 87 transitions. [2018-11-14 19:16:47,701 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:16:47,703 INFO L225 Difference]: With dead ends: 84 [2018-11-14 19:16:47,703 INFO L226 Difference]: Without dead ends: 58 [2018-11-14 19:16:47,704 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:16:47,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-14 19:16:47,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-11-14 19:16:47,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:16:47,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 54 states. [2018-11-14 19:16:47,740 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 54 states. [2018-11-14 19:16:47,740 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 54 states. [2018-11-14 19:16:47,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:47,744 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2018-11-14 19:16:47,744 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2018-11-14 19:16:47,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:16:47,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:16:47,744 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 58 states. [2018-11-14 19:16:47,744 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 58 states. [2018-11-14 19:16:47,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:47,747 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2018-11-14 19:16:47,747 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2018-11-14 19:16:47,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:16:47,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:16:47,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:16:47,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:16:47,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-14 19:16:47,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-11-14 19:16:47,750 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 34 [2018-11-14 19:16:47,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:16:47,750 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-11-14 19:16:47,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 19:16:47,751 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-11-14 19:16:47,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-14 19:16:47,752 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:16:47,752 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 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:16:47,752 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:16:47,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:16:47,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1538100480, now seen corresponding path program 2 times [2018-11-14 19:16:47,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:16:47,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:16:47,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:47,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:16:47,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:16:48,292 INFO L256 TraceCheckUtils]: 0: Hoare triple {1870#true} call ULTIMATE.init(); {1870#true} is VALID [2018-11-14 19:16:48,293 INFO L273 TraceCheckUtils]: 1: Hoare triple {1870#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1870#true} is VALID [2018-11-14 19:16:48,293 INFO L273 TraceCheckUtils]: 2: Hoare triple {1870#true} assume true; {1870#true} is VALID [2018-11-14 19:16:48,293 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1870#true} {1870#true} #118#return; {1870#true} is VALID [2018-11-14 19:16:48,294 INFO L256 TraceCheckUtils]: 4: Hoare triple {1870#true} call #t~ret18 := main(); {1870#true} is VALID [2018-11-14 19:16:48,296 INFO L273 TraceCheckUtils]: 5: Hoare triple {1870#true} ~len~0 := 5; {1872#(<= 5 main_~len~0)} is VALID [2018-11-14 19:16:48,315 INFO L256 TraceCheckUtils]: 6: Hoare triple {1872#(<= 5 main_~len~0)} call #t~ret4.base, #t~ret4.offset := dll_create(~len~0); {1870#true} is VALID [2018-11-14 19:16:48,327 INFO L273 TraceCheckUtils]: 7: Hoare triple {1870#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {1873#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:48,343 INFO L273 TraceCheckUtils]: 8: Hoare triple {1873#(<= |dll_create_#in~len| dll_create_~len)} assume true; {1873#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:48,348 INFO L273 TraceCheckUtils]: 9: Hoare triple {1873#(<= |dll_create_#in~len| dll_create_~len)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1873#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:48,357 INFO L273 TraceCheckUtils]: 10: Hoare triple {1873#(<= |dll_create_#in~len| dll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1873#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:48,359 INFO L273 TraceCheckUtils]: 11: Hoare triple {1873#(<= |dll_create_#in~len| dll_create_~len)} call write~int(0, ~new_head~0.base, ~new_head~0.offset + 0, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 8, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 16, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);call write~$Pointer$(0, 0, ~new_head~0.base, ~new_head~0.offset + 12, 4); {1873#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:48,360 INFO L273 TraceCheckUtils]: 12: Hoare triple {1873#(<= |dll_create_#in~len| dll_create_~len)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1873#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:48,361 INFO L273 TraceCheckUtils]: 13: Hoare triple {1873#(<= |dll_create_#in~len| dll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1874#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:48,362 INFO L273 TraceCheckUtils]: 14: Hoare triple {1874#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume true; {1874#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:48,362 INFO L273 TraceCheckUtils]: 15: Hoare triple {1874#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1874#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:48,362 INFO L273 TraceCheckUtils]: 16: Hoare triple {1874#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1874#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:48,363 INFO L273 TraceCheckUtils]: 17: Hoare triple {1874#(<= |dll_create_#in~len| (+ dll_create_~len 1))} call write~int(0, ~new_head~0.base, ~new_head~0.offset + 0, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 8, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 16, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);call write~$Pointer$(0, 0, ~new_head~0.base, ~new_head~0.offset + 12, 4); {1874#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:48,364 INFO L273 TraceCheckUtils]: 18: Hoare triple {1874#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~head~0.offset + 12, 4); {1874#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:48,368 INFO L273 TraceCheckUtils]: 19: Hoare triple {1874#(<= |dll_create_#in~len| (+ dll_create_~len 1))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1875#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2018-11-14 19:16:48,368 INFO L273 TraceCheckUtils]: 20: Hoare triple {1875#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume true; {1875#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2018-11-14 19:16:48,369 INFO L273 TraceCheckUtils]: 21: Hoare triple {1875#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1875#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2018-11-14 19:16:48,369 INFO L273 TraceCheckUtils]: 22: Hoare triple {1875#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1875#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2018-11-14 19:16:48,370 INFO L273 TraceCheckUtils]: 23: Hoare triple {1875#(<= |dll_create_#in~len| (+ dll_create_~len 2))} call write~int(0, ~new_head~0.base, ~new_head~0.offset + 0, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 8, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 16, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);call write~$Pointer$(0, 0, ~new_head~0.base, ~new_head~0.offset + 12, 4); {1875#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2018-11-14 19:16:48,371 INFO L273 TraceCheckUtils]: 24: Hoare triple {1875#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~head~0.offset + 12, 4); {1875#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2018-11-14 19:16:48,372 INFO L273 TraceCheckUtils]: 25: Hoare triple {1875#(<= |dll_create_#in~len| (+ dll_create_~len 2))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1876#(<= |dll_create_#in~len| (+ dll_create_~len 3))} is VALID [2018-11-14 19:16:48,373 INFO L273 TraceCheckUtils]: 26: Hoare triple {1876#(<= |dll_create_#in~len| (+ dll_create_~len 3))} assume true; {1876#(<= |dll_create_#in~len| (+ dll_create_~len 3))} is VALID [2018-11-14 19:16:48,374 INFO L273 TraceCheckUtils]: 27: Hoare triple {1876#(<= |dll_create_#in~len| (+ dll_create_~len 3))} assume !(~len > 0); {1877#(<= |dll_create_#in~len| 3)} is VALID [2018-11-14 19:16:48,375 INFO L273 TraceCheckUtils]: 28: Hoare triple {1877#(<= |dll_create_#in~len| 3)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1877#(<= |dll_create_#in~len| 3)} is VALID [2018-11-14 19:16:48,375 INFO L273 TraceCheckUtils]: 29: Hoare triple {1877#(<= |dll_create_#in~len| 3)} assume true; {1877#(<= |dll_create_#in~len| 3)} is VALID [2018-11-14 19:16:48,377 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1877#(<= |dll_create_#in~len| 3)} {1872#(<= 5 main_~len~0)} #114#return; {1871#false} is VALID [2018-11-14 19:16:48,377 INFO L273 TraceCheckUtils]: 31: Hoare triple {1871#false} ~head~1.base, ~head~1.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset; {1871#false} is VALID [2018-11-14 19:16:48,377 INFO L273 TraceCheckUtils]: 32: Hoare triple {1871#false} assume true; {1871#false} is VALID [2018-11-14 19:16:48,378 INFO L273 TraceCheckUtils]: 33: Hoare triple {1871#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head~1.base, ~head~1.offset + 4, 4); {1871#false} is VALID [2018-11-14 19:16:48,378 INFO L273 TraceCheckUtils]: 34: Hoare triple {1871#false} assume !!(#t~mem11.base != 0 || #t~mem11.offset != 0);havoc #t~mem11.base, #t~mem11.offset;call #t~mem5 := read~int(~head~1.base, ~head~1.offset + 0, 4);#t~short7 := 0 != #t~mem5; {1871#false} is VALID [2018-11-14 19:16:48,378 INFO L273 TraceCheckUtils]: 35: Hoare triple {1871#false} assume !#t~short7;call #t~mem6 := read~int(~head~1.base, ~head~1.offset + 8, 4);#t~short7 := 0 != #t~mem6; {1871#false} is VALID [2018-11-14 19:16:48,378 INFO L273 TraceCheckUtils]: 36: Hoare triple {1871#false} #t~short9 := #t~short7; {1871#false} is VALID [2018-11-14 19:16:48,379 INFO L273 TraceCheckUtils]: 37: Hoare triple {1871#false} assume !#t~short9;call #t~mem8 := read~int(~head~1.base, ~head~1.offset + 16, 4);#t~short9 := 0 != #t~mem8; {1871#false} is VALID [2018-11-14 19:16:48,379 INFO L273 TraceCheckUtils]: 38: Hoare triple {1871#false} assume #t~short9;havoc #t~short7;havoc #t~mem8;havoc #t~mem5;havoc #t~mem6;havoc #t~short9; {1871#false} is VALID [2018-11-14 19:16:48,379 INFO L273 TraceCheckUtils]: 39: Hoare triple {1871#false} assume !false; {1871#false} is VALID [2018-11-14 19:16:48,381 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:16:48,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:16:48,382 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:16:48,391 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 19:16:48,439 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 19:16:48,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:16:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:16:48,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:16:48,615 INFO L256 TraceCheckUtils]: 0: Hoare triple {1870#true} call ULTIMATE.init(); {1870#true} is VALID [2018-11-14 19:16:48,615 INFO L273 TraceCheckUtils]: 1: Hoare triple {1870#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1870#true} is VALID [2018-11-14 19:16:48,615 INFO L273 TraceCheckUtils]: 2: Hoare triple {1870#true} assume true; {1870#true} is VALID [2018-11-14 19:16:48,616 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1870#true} {1870#true} #118#return; {1870#true} is VALID [2018-11-14 19:16:48,616 INFO L256 TraceCheckUtils]: 4: Hoare triple {1870#true} call #t~ret18 := main(); {1870#true} is VALID [2018-11-14 19:16:48,616 INFO L273 TraceCheckUtils]: 5: Hoare triple {1870#true} ~len~0 := 5; {1872#(<= 5 main_~len~0)} is VALID [2018-11-14 19:16:48,617 INFO L256 TraceCheckUtils]: 6: Hoare triple {1872#(<= 5 main_~len~0)} call #t~ret4.base, #t~ret4.offset := dll_create(~len~0); {1870#true} is VALID [2018-11-14 19:16:48,617 INFO L273 TraceCheckUtils]: 7: Hoare triple {1870#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {1873#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:48,618 INFO L273 TraceCheckUtils]: 8: Hoare triple {1873#(<= |dll_create_#in~len| dll_create_~len)} assume true; {1873#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:48,618 INFO L273 TraceCheckUtils]: 9: Hoare triple {1873#(<= |dll_create_#in~len| dll_create_~len)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1873#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:48,618 INFO L273 TraceCheckUtils]: 10: Hoare triple {1873#(<= |dll_create_#in~len| dll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1873#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:48,619 INFO L273 TraceCheckUtils]: 11: Hoare triple {1873#(<= |dll_create_#in~len| dll_create_~len)} call write~int(0, ~new_head~0.base, ~new_head~0.offset + 0, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 8, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 16, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);call write~$Pointer$(0, 0, ~new_head~0.base, ~new_head~0.offset + 12, 4); {1873#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:48,620 INFO L273 TraceCheckUtils]: 12: Hoare triple {1873#(<= |dll_create_#in~len| dll_create_~len)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1873#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:48,621 INFO L273 TraceCheckUtils]: 13: Hoare triple {1873#(<= |dll_create_#in~len| dll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1874#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:48,621 INFO L273 TraceCheckUtils]: 14: Hoare triple {1874#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume true; {1874#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:48,622 INFO L273 TraceCheckUtils]: 15: Hoare triple {1874#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1874#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:48,622 INFO L273 TraceCheckUtils]: 16: Hoare triple {1874#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1874#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:48,623 INFO L273 TraceCheckUtils]: 17: Hoare triple {1874#(<= |dll_create_#in~len| (+ dll_create_~len 1))} call write~int(0, ~new_head~0.base, ~new_head~0.offset + 0, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 8, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 16, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);call write~$Pointer$(0, 0, ~new_head~0.base, ~new_head~0.offset + 12, 4); {1874#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:48,624 INFO L273 TraceCheckUtils]: 18: Hoare triple {1874#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~head~0.offset + 12, 4); {1874#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:48,624 INFO L273 TraceCheckUtils]: 19: Hoare triple {1874#(<= |dll_create_#in~len| (+ dll_create_~len 1))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1875#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2018-11-14 19:16:48,626 INFO L273 TraceCheckUtils]: 20: Hoare triple {1875#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume true; {1875#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2018-11-14 19:16:48,627 INFO L273 TraceCheckUtils]: 21: Hoare triple {1875#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1875#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2018-11-14 19:16:48,629 INFO L273 TraceCheckUtils]: 22: Hoare triple {1875#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1875#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2018-11-14 19:16:48,630 INFO L273 TraceCheckUtils]: 23: Hoare triple {1875#(<= |dll_create_#in~len| (+ dll_create_~len 2))} call write~int(0, ~new_head~0.base, ~new_head~0.offset + 0, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 8, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 16, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);call write~$Pointer$(0, 0, ~new_head~0.base, ~new_head~0.offset + 12, 4); {1875#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2018-11-14 19:16:48,630 INFO L273 TraceCheckUtils]: 24: Hoare triple {1875#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~head~0.offset + 12, 4); {1875#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2018-11-14 19:16:48,632 INFO L273 TraceCheckUtils]: 25: Hoare triple {1875#(<= |dll_create_#in~len| (+ dll_create_~len 2))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1876#(<= |dll_create_#in~len| (+ dll_create_~len 3))} is VALID [2018-11-14 19:16:48,632 INFO L273 TraceCheckUtils]: 26: Hoare triple {1876#(<= |dll_create_#in~len| (+ dll_create_~len 3))} assume true; {1876#(<= |dll_create_#in~len| (+ dll_create_~len 3))} is VALID [2018-11-14 19:16:48,633 INFO L273 TraceCheckUtils]: 27: Hoare triple {1876#(<= |dll_create_#in~len| (+ dll_create_~len 3))} assume !(~len > 0); {1877#(<= |dll_create_#in~len| 3)} is VALID [2018-11-14 19:16:48,634 INFO L273 TraceCheckUtils]: 28: Hoare triple {1877#(<= |dll_create_#in~len| 3)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1877#(<= |dll_create_#in~len| 3)} is VALID [2018-11-14 19:16:48,634 INFO L273 TraceCheckUtils]: 29: Hoare triple {1877#(<= |dll_create_#in~len| 3)} assume true; {1877#(<= |dll_create_#in~len| 3)} is VALID [2018-11-14 19:16:48,635 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1877#(<= |dll_create_#in~len| 3)} {1872#(<= 5 main_~len~0)} #114#return; {1871#false} is VALID [2018-11-14 19:16:48,635 INFO L273 TraceCheckUtils]: 31: Hoare triple {1871#false} ~head~1.base, ~head~1.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset; {1871#false} is VALID [2018-11-14 19:16:48,635 INFO L273 TraceCheckUtils]: 32: Hoare triple {1871#false} assume true; {1871#false} is VALID [2018-11-14 19:16:48,635 INFO L273 TraceCheckUtils]: 33: Hoare triple {1871#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head~1.base, ~head~1.offset + 4, 4); {1871#false} is VALID [2018-11-14 19:16:48,635 INFO L273 TraceCheckUtils]: 34: Hoare triple {1871#false} assume !!(#t~mem11.base != 0 || #t~mem11.offset != 0);havoc #t~mem11.base, #t~mem11.offset;call #t~mem5 := read~int(~head~1.base, ~head~1.offset + 0, 4);#t~short7 := 0 != #t~mem5; {1871#false} is VALID [2018-11-14 19:16:48,636 INFO L273 TraceCheckUtils]: 35: Hoare triple {1871#false} assume !#t~short7;call #t~mem6 := read~int(~head~1.base, ~head~1.offset + 8, 4);#t~short7 := 0 != #t~mem6; {1871#false} is VALID [2018-11-14 19:16:48,636 INFO L273 TraceCheckUtils]: 36: Hoare triple {1871#false} #t~short9 := #t~short7; {1871#false} is VALID [2018-11-14 19:16:48,636 INFO L273 TraceCheckUtils]: 37: Hoare triple {1871#false} assume !#t~short9;call #t~mem8 := read~int(~head~1.base, ~head~1.offset + 16, 4);#t~short9 := 0 != #t~mem8; {1871#false} is VALID [2018-11-14 19:16:48,636 INFO L273 TraceCheckUtils]: 38: Hoare triple {1871#false} assume #t~short9;havoc #t~short7;havoc #t~mem8;havoc #t~mem5;havoc #t~mem6;havoc #t~short9; {1871#false} is VALID [2018-11-14 19:16:48,637 INFO L273 TraceCheckUtils]: 39: Hoare triple {1871#false} assume !false; {1871#false} is VALID [2018-11-14 19:16:48,639 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:16:48,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:16:48,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-14 19:16:48,660 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-11-14 19:16:48,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:16:48,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 19:16:48,716 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:16:48,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 19:16:48,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 19:16:48,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:16:48,717 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 8 states. [2018-11-14 19:16:49,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:49,639 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2018-11-14 19:16:49,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 19:16:49,640 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-11-14 19:16:49,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:16:49,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:16:49,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2018-11-14 19:16:49,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:16:49,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2018-11-14 19:16:49,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 94 transitions. [2018-11-14 19:16:49,748 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:16:49,750 INFO L225 Difference]: With dead ends: 90 [2018-11-14 19:16:49,750 INFO L226 Difference]: Without dead ends: 64 [2018-11-14 19:16:49,751 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-14 19:16:49,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-14 19:16:49,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-11-14 19:16:49,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:16:49,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 60 states. [2018-11-14 19:16:49,778 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 60 states. [2018-11-14 19:16:49,778 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 60 states. [2018-11-14 19:16:49,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:49,781 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2018-11-14 19:16:49,781 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2018-11-14 19:16:49,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:16:49,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:16:49,782 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 64 states. [2018-11-14 19:16:49,782 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 64 states. [2018-11-14 19:16:49,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:49,784 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2018-11-14 19:16:49,784 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2018-11-14 19:16:49,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:16:49,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:16:49,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:16:49,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:16:49,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-14 19:16:49,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2018-11-14 19:16:49,786 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 40 [2018-11-14 19:16:49,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:16:49,786 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2018-11-14 19:16:49,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 19:16:49,786 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2018-11-14 19:16:49,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-14 19:16:49,787 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:16:49,788 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 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:16:49,788 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:16:49,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:16:49,788 INFO L82 PathProgramCache]: Analyzing trace with hash 152254412, now seen corresponding path program 3 times [2018-11-14 19:16:49,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:16:49,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:16:49,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:49,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:16:49,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:16:50,600 INFO L256 TraceCheckUtils]: 0: Hoare triple {2308#true} call ULTIMATE.init(); {2308#true} is VALID [2018-11-14 19:16:50,601 INFO L273 TraceCheckUtils]: 1: Hoare triple {2308#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2308#true} is VALID [2018-11-14 19:16:50,601 INFO L273 TraceCheckUtils]: 2: Hoare triple {2308#true} assume true; {2308#true} is VALID [2018-11-14 19:16:50,601 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2308#true} {2308#true} #118#return; {2308#true} is VALID [2018-11-14 19:16:50,602 INFO L256 TraceCheckUtils]: 4: Hoare triple {2308#true} call #t~ret18 := main(); {2308#true} is VALID [2018-11-14 19:16:50,603 INFO L273 TraceCheckUtils]: 5: Hoare triple {2308#true} ~len~0 := 5; {2310#(<= 5 main_~len~0)} is VALID [2018-11-14 19:16:50,603 INFO L256 TraceCheckUtils]: 6: Hoare triple {2310#(<= 5 main_~len~0)} call #t~ret4.base, #t~ret4.offset := dll_create(~len~0); {2308#true} is VALID [2018-11-14 19:16:50,604 INFO L273 TraceCheckUtils]: 7: Hoare triple {2308#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {2311#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:50,604 INFO L273 TraceCheckUtils]: 8: Hoare triple {2311#(<= |dll_create_#in~len| dll_create_~len)} assume true; {2311#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:50,604 INFO L273 TraceCheckUtils]: 9: Hoare triple {2311#(<= |dll_create_#in~len| dll_create_~len)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2311#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:50,605 INFO L273 TraceCheckUtils]: 10: Hoare triple {2311#(<= |dll_create_#in~len| dll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2311#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:50,605 INFO L273 TraceCheckUtils]: 11: Hoare triple {2311#(<= |dll_create_#in~len| dll_create_~len)} call write~int(0, ~new_head~0.base, ~new_head~0.offset + 0, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 8, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 16, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);call write~$Pointer$(0, 0, ~new_head~0.base, ~new_head~0.offset + 12, 4); {2311#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:50,605 INFO L273 TraceCheckUtils]: 12: Hoare triple {2311#(<= |dll_create_#in~len| dll_create_~len)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {2311#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-14 19:16:50,606 INFO L273 TraceCheckUtils]: 13: Hoare triple {2311#(<= |dll_create_#in~len| dll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {2312#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:50,606 INFO L273 TraceCheckUtils]: 14: Hoare triple {2312#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume true; {2312#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:50,607 INFO L273 TraceCheckUtils]: 15: Hoare triple {2312#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2312#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:50,608 INFO L273 TraceCheckUtils]: 16: Hoare triple {2312#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2312#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:50,608 INFO L273 TraceCheckUtils]: 17: Hoare triple {2312#(<= |dll_create_#in~len| (+ dll_create_~len 1))} call write~int(0, ~new_head~0.base, ~new_head~0.offset + 0, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 8, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 16, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);call write~$Pointer$(0, 0, ~new_head~0.base, ~new_head~0.offset + 12, 4); {2312#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:50,609 INFO L273 TraceCheckUtils]: 18: Hoare triple {2312#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~head~0.offset + 12, 4); {2312#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-14 19:16:50,610 INFO L273 TraceCheckUtils]: 19: Hoare triple {2312#(<= |dll_create_#in~len| (+ dll_create_~len 1))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {2313#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2018-11-14 19:16:50,610 INFO L273 TraceCheckUtils]: 20: Hoare triple {2313#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume true; {2313#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2018-11-14 19:16:50,611 INFO L273 TraceCheckUtils]: 21: Hoare triple {2313#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2313#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2018-11-14 19:16:50,611 INFO L273 TraceCheckUtils]: 22: Hoare triple {2313#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2313#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2018-11-14 19:16:50,612 INFO L273 TraceCheckUtils]: 23: Hoare triple {2313#(<= |dll_create_#in~len| (+ dll_create_~len 2))} call write~int(0, ~new_head~0.base, ~new_head~0.offset + 0, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 8, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 16, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);call write~$Pointer$(0, 0, ~new_head~0.base, ~new_head~0.offset + 12, 4); {2313#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2018-11-14 19:16:50,613 INFO L273 TraceCheckUtils]: 24: Hoare triple {2313#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~head~0.offset + 12, 4); {2313#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2018-11-14 19:16:50,614 INFO L273 TraceCheckUtils]: 25: Hoare triple {2313#(<= |dll_create_#in~len| (+ dll_create_~len 2))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {2314#(<= |dll_create_#in~len| (+ dll_create_~len 3))} is VALID [2018-11-14 19:16:50,614 INFO L273 TraceCheckUtils]: 26: Hoare triple {2314#(<= |dll_create_#in~len| (+ dll_create_~len 3))} assume true; {2314#(<= |dll_create_#in~len| (+ dll_create_~len 3))} is VALID [2018-11-14 19:16:50,615 INFO L273 TraceCheckUtils]: 27: Hoare triple {2314#(<= |dll_create_#in~len| (+ dll_create_~len 3))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2314#(<= |dll_create_#in~len| (+ dll_create_~len 3))} is VALID [2018-11-14 19:16:50,623 INFO L273 TraceCheckUtils]: 28: Hoare triple {2314#(<= |dll_create_#in~len| (+ dll_create_~len 3))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2314#(<= |dll_create_#in~len| (+ dll_create_~len 3))} is VALID [2018-11-14 19:16:50,623 INFO L273 TraceCheckUtils]: 29: Hoare triple {2314#(<= |dll_create_#in~len| (+ dll_create_~len 3))} call write~int(0, ~new_head~0.base, ~new_head~0.offset + 0, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 8, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 16, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);call write~$Pointer$(0, 0, ~new_head~0.base, ~new_head~0.offset + 12, 4); {2314#(<= |dll_create_#in~len| (+ dll_create_~len 3))} is VALID [2018-11-14 19:16:50,624 INFO L273 TraceCheckUtils]: 30: Hoare triple {2314#(<= |dll_create_#in~len| (+ dll_create_~len 3))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~head~0.offset + 12, 4); {2314#(<= |dll_create_#in~len| (+ dll_create_~len 3))} is VALID [2018-11-14 19:16:50,624 INFO L273 TraceCheckUtils]: 31: Hoare triple {2314#(<= |dll_create_#in~len| (+ dll_create_~len 3))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {2315#(<= |dll_create_#in~len| (+ dll_create_~len 4))} is VALID [2018-11-14 19:16:50,625 INFO L273 TraceCheckUtils]: 32: Hoare triple {2315#(<= |dll_create_#in~len| (+ dll_create_~len 4))} assume true; {2315#(<= |dll_create_#in~len| (+ dll_create_~len 4))} is VALID [2018-11-14 19:16:50,625 INFO L273 TraceCheckUtils]: 33: Hoare triple {2315#(<= |dll_create_#in~len| (+ dll_create_~len 4))} assume !(~len > 0); {2316#(<= |dll_create_#in~len| 4)} is VALID [2018-11-14 19:16:50,626 INFO L273 TraceCheckUtils]: 34: Hoare triple {2316#(<= |dll_create_#in~len| 4)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2316#(<= |dll_create_#in~len| 4)} is VALID [2018-11-14 19:16:50,626 INFO L273 TraceCheckUtils]: 35: Hoare triple {2316#(<= |dll_create_#in~len| 4)} assume true; {2316#(<= |dll_create_#in~len| 4)} is VALID [2018-11-14 19:16:50,628 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {2316#(<= |dll_create_#in~len| 4)} {2310#(<= 5 main_~len~0)} #114#return; {2309#false} is VALID [2018-11-14 19:16:50,628 INFO L273 TraceCheckUtils]: 37: Hoare triple {2309#false} ~head~1.base, ~head~1.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset; {2309#false} is VALID [2018-11-14 19:16:50,628 INFO L273 TraceCheckUtils]: 38: Hoare triple {2309#false} assume true; {2309#false} is VALID [2018-11-14 19:16:50,629 INFO L273 TraceCheckUtils]: 39: Hoare triple {2309#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head~1.base, ~head~1.offset + 4, 4); {2309#false} is VALID [2018-11-14 19:16:50,629 INFO L273 TraceCheckUtils]: 40: Hoare triple {2309#false} assume !!(#t~mem11.base != 0 || #t~mem11.offset != 0);havoc #t~mem11.base, #t~mem11.offset;call #t~mem5 := read~int(~head~1.base, ~head~1.offset + 0, 4);#t~short7 := 0 != #t~mem5; {2309#false} is VALID [2018-11-14 19:16:50,629 INFO L273 TraceCheckUtils]: 41: Hoare triple {2309#false} assume !#t~short7;call #t~mem6 := read~int(~head~1.base, ~head~1.offset + 8, 4);#t~short7 := 0 != #t~mem6; {2309#false} is VALID [2018-11-14 19:16:50,629 INFO L273 TraceCheckUtils]: 42: Hoare triple {2309#false} #t~short9 := #t~short7; {2309#false} is VALID [2018-11-14 19:16:50,629 INFO L273 TraceCheckUtils]: 43: Hoare triple {2309#false} assume !#t~short9;call #t~mem8 := read~int(~head~1.base, ~head~1.offset + 16, 4);#t~short9 := 0 != #t~mem8; {2309#false} is VALID [2018-11-14 19:16:50,630 INFO L273 TraceCheckUtils]: 44: Hoare triple {2309#false} assume #t~short9;havoc #t~short7;havoc #t~mem8;havoc #t~mem5;havoc #t~mem6;havoc #t~short9; {2309#false} is VALID [2018-11-14 19:16:50,630 INFO L273 TraceCheckUtils]: 45: Hoare triple {2309#false} assume !false; {2309#false} is VALID [2018-11-14 19:16:50,632 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:16:50,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:16:50,632 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:16:50,643 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 19:16:50,692 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 19:16:50,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:16:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:16:50,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:16:50,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-11-14 19:16:50,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-11-14 19:16:50,891 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:16:50,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-11-14 19:16:50,909 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:16:50,911 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:16:50,913 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:16:50,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-11-14 19:16:50,917 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 19:16:50,932 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:16:50,941 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:16:50,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:16:50,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:16:50,958 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:21, output treesize:26 [2018-11-14 19:16:51,185 INFO L256 TraceCheckUtils]: 0: Hoare triple {2308#true} call ULTIMATE.init(); {2308#true} is VALID [2018-11-14 19:16:51,186 INFO L273 TraceCheckUtils]: 1: Hoare triple {2308#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2308#true} is VALID [2018-11-14 19:16:51,186 INFO L273 TraceCheckUtils]: 2: Hoare triple {2308#true} assume true; {2308#true} is VALID [2018-11-14 19:16:51,187 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2308#true} {2308#true} #118#return; {2308#true} is VALID [2018-11-14 19:16:51,187 INFO L256 TraceCheckUtils]: 4: Hoare triple {2308#true} call #t~ret18 := main(); {2308#true} is VALID [2018-11-14 19:16:51,187 INFO L273 TraceCheckUtils]: 5: Hoare triple {2308#true} ~len~0 := 5; {2308#true} is VALID [2018-11-14 19:16:51,188 INFO L256 TraceCheckUtils]: 6: Hoare triple {2308#true} call #t~ret4.base, #t~ret4.offset := dll_create(~len~0); {2308#true} is VALID [2018-11-14 19:16:51,188 INFO L273 TraceCheckUtils]: 7: Hoare triple {2308#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {2308#true} is VALID [2018-11-14 19:16:51,188 INFO L273 TraceCheckUtils]: 8: Hoare triple {2308#true} assume true; {2308#true} is VALID [2018-11-14 19:16:51,189 INFO L273 TraceCheckUtils]: 9: Hoare triple {2308#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2308#true} is VALID [2018-11-14 19:16:51,189 INFO L273 TraceCheckUtils]: 10: Hoare triple {2308#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2308#true} is VALID [2018-11-14 19:16:51,189 INFO L273 TraceCheckUtils]: 11: Hoare triple {2308#true} call write~int(0, ~new_head~0.base, ~new_head~0.offset + 0, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 8, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 16, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);call write~$Pointer$(0, 0, ~new_head~0.base, ~new_head~0.offset + 12, 4); {2308#true} is VALID [2018-11-14 19:16:51,189 INFO L273 TraceCheckUtils]: 12: Hoare triple {2308#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {2308#true} is VALID [2018-11-14 19:16:51,189 INFO L273 TraceCheckUtils]: 13: Hoare triple {2308#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {2308#true} is VALID [2018-11-14 19:16:51,190 INFO L273 TraceCheckUtils]: 14: Hoare triple {2308#true} assume true; {2308#true} is VALID [2018-11-14 19:16:51,190 INFO L273 TraceCheckUtils]: 15: Hoare triple {2308#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2308#true} is VALID [2018-11-14 19:16:51,190 INFO L273 TraceCheckUtils]: 16: Hoare triple {2308#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2308#true} is VALID [2018-11-14 19:16:51,190 INFO L273 TraceCheckUtils]: 17: Hoare triple {2308#true} call write~int(0, ~new_head~0.base, ~new_head~0.offset + 0, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 8, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 16, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);call write~$Pointer$(0, 0, ~new_head~0.base, ~new_head~0.offset + 12, 4); {2308#true} is VALID [2018-11-14 19:16:51,190 INFO L273 TraceCheckUtils]: 18: Hoare triple {2308#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~head~0.offset + 12, 4); {2308#true} is VALID [2018-11-14 19:16:51,191 INFO L273 TraceCheckUtils]: 19: Hoare triple {2308#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {2308#true} is VALID [2018-11-14 19:16:51,191 INFO L273 TraceCheckUtils]: 20: Hoare triple {2308#true} assume true; {2308#true} is VALID [2018-11-14 19:16:51,191 INFO L273 TraceCheckUtils]: 21: Hoare triple {2308#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2308#true} is VALID [2018-11-14 19:16:51,191 INFO L273 TraceCheckUtils]: 22: Hoare triple {2308#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2308#true} is VALID [2018-11-14 19:16:51,191 INFO L273 TraceCheckUtils]: 23: Hoare triple {2308#true} call write~int(0, ~new_head~0.base, ~new_head~0.offset + 0, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 8, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 16, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);call write~$Pointer$(0, 0, ~new_head~0.base, ~new_head~0.offset + 12, 4); {2308#true} is VALID [2018-11-14 19:16:51,192 INFO L273 TraceCheckUtils]: 24: Hoare triple {2308#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~head~0.offset + 12, 4); {2308#true} is VALID [2018-11-14 19:16:51,192 INFO L273 TraceCheckUtils]: 25: Hoare triple {2308#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {2308#true} is VALID [2018-11-14 19:16:51,192 INFO L273 TraceCheckUtils]: 26: Hoare triple {2308#true} assume true; {2308#true} is VALID [2018-11-14 19:16:51,192 INFO L273 TraceCheckUtils]: 27: Hoare triple {2308#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2308#true} is VALID [2018-11-14 19:16:51,192 INFO L273 TraceCheckUtils]: 28: Hoare triple {2308#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2308#true} is VALID [2018-11-14 19:16:51,199 INFO L273 TraceCheckUtils]: 29: Hoare triple {2308#true} call write~int(0, ~new_head~0.base, ~new_head~0.offset + 0, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 8, 4);call write~int(0, ~new_head~0.base, ~new_head~0.offset + 16, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);call write~$Pointer$(0, 0, ~new_head~0.base, ~new_head~0.offset + 12, 4); {2407#(and (= 0 (select (select |#memory_int| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 16))) (= 0 (select (select |#memory_int| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))) (= 0 (select (select |#memory_int| dll_create_~new_head~0.base) dll_create_~new_head~0.offset)))} is VALID [2018-11-14 19:16:51,204 INFO L273 TraceCheckUtils]: 30: Hoare triple {2407#(and (= 0 (select (select |#memory_int| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 16))) (= 0 (select (select |#memory_int| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))) (= 0 (select (select |#memory_int| dll_create_~new_head~0.base) dll_create_~new_head~0.offset)))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~head~0.offset + 12, 4); {2407#(and (= 0 (select (select |#memory_int| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 16))) (= 0 (select (select |#memory_int| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))) (= 0 (select (select |#memory_int| dll_create_~new_head~0.base) dll_create_~new_head~0.offset)))} is VALID [2018-11-14 19:16:51,205 INFO L273 TraceCheckUtils]: 31: Hoare triple {2407#(and (= 0 (select (select |#memory_int| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 16))) (= 0 (select (select |#memory_int| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))) (= 0 (select (select |#memory_int| dll_create_~new_head~0.base) dll_create_~new_head~0.offset)))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {2414#(and (= 0 (select (select |#memory_int| dll_create_~head~0.base) dll_create_~head~0.offset)) (= (select (select |#memory_int| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8)) 0) (= (select (select |#memory_int| dll_create_~head~0.base) (+ dll_create_~head~0.offset 16)) 0))} is VALID [2018-11-14 19:16:51,206 INFO L273 TraceCheckUtils]: 32: Hoare triple {2414#(and (= 0 (select (select |#memory_int| dll_create_~head~0.base) dll_create_~head~0.offset)) (= (select (select |#memory_int| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8)) 0) (= (select (select |#memory_int| dll_create_~head~0.base) (+ dll_create_~head~0.offset 16)) 0))} assume true; {2414#(and (= 0 (select (select |#memory_int| dll_create_~head~0.base) dll_create_~head~0.offset)) (= (select (select |#memory_int| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8)) 0) (= (select (select |#memory_int| dll_create_~head~0.base) (+ dll_create_~head~0.offset 16)) 0))} is VALID [2018-11-14 19:16:51,206 INFO L273 TraceCheckUtils]: 33: Hoare triple {2414#(and (= 0 (select (select |#memory_int| dll_create_~head~0.base) dll_create_~head~0.offset)) (= (select (select |#memory_int| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8)) 0) (= (select (select |#memory_int| dll_create_~head~0.base) (+ dll_create_~head~0.offset 16)) 0))} assume !(~len > 0); {2414#(and (= 0 (select (select |#memory_int| dll_create_~head~0.base) dll_create_~head~0.offset)) (= (select (select |#memory_int| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8)) 0) (= (select (select |#memory_int| dll_create_~head~0.base) (+ dll_create_~head~0.offset 16)) 0))} is VALID [2018-11-14 19:16:51,208 INFO L273 TraceCheckUtils]: 34: Hoare triple {2414#(and (= 0 (select (select |#memory_int| dll_create_~head~0.base) dll_create_~head~0.offset)) (= (select (select |#memory_int| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8)) 0) (= (select (select |#memory_int| dll_create_~head~0.base) (+ dll_create_~head~0.offset 16)) 0))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2424#(and (= (select (select |#memory_int| |dll_create_#res.base|) (+ |dll_create_#res.offset| 8)) 0) (= (select (select |#memory_int| |dll_create_#res.base|) |dll_create_#res.offset|) 0) (= (select (select |#memory_int| |dll_create_#res.base|) (+ |dll_create_#res.offset| 16)) 0))} is VALID [2018-11-14 19:16:51,209 INFO L273 TraceCheckUtils]: 35: Hoare triple {2424#(and (= (select (select |#memory_int| |dll_create_#res.base|) (+ |dll_create_#res.offset| 8)) 0) (= (select (select |#memory_int| |dll_create_#res.base|) |dll_create_#res.offset|) 0) (= (select (select |#memory_int| |dll_create_#res.base|) (+ |dll_create_#res.offset| 16)) 0))} assume true; {2424#(and (= (select (select |#memory_int| |dll_create_#res.base|) (+ |dll_create_#res.offset| 8)) 0) (= (select (select |#memory_int| |dll_create_#res.base|) |dll_create_#res.offset|) 0) (= (select (select |#memory_int| |dll_create_#res.base|) (+ |dll_create_#res.offset| 16)) 0))} is VALID [2018-11-14 19:16:51,210 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {2424#(and (= (select (select |#memory_int| |dll_create_#res.base|) (+ |dll_create_#res.offset| 8)) 0) (= (select (select |#memory_int| |dll_create_#res.base|) |dll_create_#res.offset|) 0) (= (select (select |#memory_int| |dll_create_#res.base|) (+ |dll_create_#res.offset| 16)) 0))} {2308#true} #114#return; {2431#(and (= (select (select |#memory_int| |main_#t~ret4.base|) |main_#t~ret4.offset|) 0) (= (select (select |#memory_int| |main_#t~ret4.base|) (+ |main_#t~ret4.offset| 8)) 0) (= (select (select |#memory_int| |main_#t~ret4.base|) (+ |main_#t~ret4.offset| 16)) 0))} is VALID [2018-11-14 19:16:51,213 INFO L273 TraceCheckUtils]: 37: Hoare triple {2431#(and (= (select (select |#memory_int| |main_#t~ret4.base|) |main_#t~ret4.offset|) 0) (= (select (select |#memory_int| |main_#t~ret4.base|) (+ |main_#t~ret4.offset| 8)) 0) (= (select (select |#memory_int| |main_#t~ret4.base|) (+ |main_#t~ret4.offset| 16)) 0))} ~head~1.base, ~head~1.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset; {2435#(and (= 0 (select (select |#memory_int| main_~head~1.base) (+ main_~head~1.offset 8))) (= 0 (select (select |#memory_int| main_~head~1.base) (+ main_~head~1.offset 16))) (= (select (select |#memory_int| main_~head~1.base) main_~head~1.offset) 0))} is VALID [2018-11-14 19:16:51,214 INFO L273 TraceCheckUtils]: 38: Hoare triple {2435#(and (= 0 (select (select |#memory_int| main_~head~1.base) (+ main_~head~1.offset 8))) (= 0 (select (select |#memory_int| main_~head~1.base) (+ main_~head~1.offset 16))) (= (select (select |#memory_int| main_~head~1.base) main_~head~1.offset) 0))} assume true; {2435#(and (= 0 (select (select |#memory_int| main_~head~1.base) (+ main_~head~1.offset 8))) (= 0 (select (select |#memory_int| main_~head~1.base) (+ main_~head~1.offset 16))) (= (select (select |#memory_int| main_~head~1.base) main_~head~1.offset) 0))} is VALID [2018-11-14 19:16:51,215 INFO L273 TraceCheckUtils]: 39: Hoare triple {2435#(and (= 0 (select (select |#memory_int| main_~head~1.base) (+ main_~head~1.offset 8))) (= 0 (select (select |#memory_int| main_~head~1.base) (+ main_~head~1.offset 16))) (= (select (select |#memory_int| main_~head~1.base) main_~head~1.offset) 0))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head~1.base, ~head~1.offset + 4, 4); {2435#(and (= 0 (select (select |#memory_int| main_~head~1.base) (+ main_~head~1.offset 8))) (= 0 (select (select |#memory_int| main_~head~1.base) (+ main_~head~1.offset 16))) (= (select (select |#memory_int| main_~head~1.base) main_~head~1.offset) 0))} is VALID [2018-11-14 19:16:51,216 INFO L273 TraceCheckUtils]: 40: Hoare triple {2435#(and (= 0 (select (select |#memory_int| main_~head~1.base) (+ main_~head~1.offset 8))) (= 0 (select (select |#memory_int| main_~head~1.base) (+ main_~head~1.offset 16))) (= (select (select |#memory_int| main_~head~1.base) main_~head~1.offset) 0))} assume !!(#t~mem11.base != 0 || #t~mem11.offset != 0);havoc #t~mem11.base, #t~mem11.offset;call #t~mem5 := read~int(~head~1.base, ~head~1.offset + 0, 4);#t~short7 := 0 != #t~mem5; {2435#(and (= 0 (select (select |#memory_int| main_~head~1.base) (+ main_~head~1.offset 8))) (= 0 (select (select |#memory_int| main_~head~1.base) (+ main_~head~1.offset 16))) (= (select (select |#memory_int| main_~head~1.base) main_~head~1.offset) 0))} is VALID [2018-11-14 19:16:51,217 INFO L273 TraceCheckUtils]: 41: Hoare triple {2435#(and (= 0 (select (select |#memory_int| main_~head~1.base) (+ main_~head~1.offset 8))) (= 0 (select (select |#memory_int| main_~head~1.base) (+ main_~head~1.offset 16))) (= (select (select |#memory_int| main_~head~1.base) main_~head~1.offset) 0))} assume !#t~short7;call #t~mem6 := read~int(~head~1.base, ~head~1.offset + 8, 4);#t~short7 := 0 != #t~mem6; {2435#(and (= 0 (select (select |#memory_int| main_~head~1.base) (+ main_~head~1.offset 8))) (= 0 (select (select |#memory_int| main_~head~1.base) (+ main_~head~1.offset 16))) (= (select (select |#memory_int| main_~head~1.base) main_~head~1.offset) 0))} is VALID [2018-11-14 19:16:51,218 INFO L273 TraceCheckUtils]: 42: Hoare triple {2435#(and (= 0 (select (select |#memory_int| main_~head~1.base) (+ main_~head~1.offset 8))) (= 0 (select (select |#memory_int| main_~head~1.base) (+ main_~head~1.offset 16))) (= (select (select |#memory_int| main_~head~1.base) main_~head~1.offset) 0))} #t~short9 := #t~short7; {2435#(and (= 0 (select (select |#memory_int| main_~head~1.base) (+ main_~head~1.offset 8))) (= 0 (select (select |#memory_int| main_~head~1.base) (+ main_~head~1.offset 16))) (= (select (select |#memory_int| main_~head~1.base) main_~head~1.offset) 0))} is VALID [2018-11-14 19:16:51,218 INFO L273 TraceCheckUtils]: 43: Hoare triple {2435#(and (= 0 (select (select |#memory_int| main_~head~1.base) (+ main_~head~1.offset 8))) (= 0 (select (select |#memory_int| main_~head~1.base) (+ main_~head~1.offset 16))) (= (select (select |#memory_int| main_~head~1.base) main_~head~1.offset) 0))} assume !#t~short9;call #t~mem8 := read~int(~head~1.base, ~head~1.offset + 16, 4);#t~short9 := 0 != #t~mem8; {2454#(not |main_#t~short9|)} is VALID [2018-11-14 19:16:51,219 INFO L273 TraceCheckUtils]: 44: Hoare triple {2454#(not |main_#t~short9|)} assume #t~short9;havoc #t~short7;havoc #t~mem8;havoc #t~mem5;havoc #t~mem6;havoc #t~short9; {2309#false} is VALID [2018-11-14 19:16:51,219 INFO L273 TraceCheckUtils]: 45: Hoare triple {2309#false} assume !false; {2309#false} is VALID [2018-11-14 19:16:51,224 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-14 19:16:51,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:16:51,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2018-11-14 19:16:51,245 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-11-14 19:16:51,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:16:51,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 19:16:51,323 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:16:51,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 19:16:51,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 19:16:51,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-11-14 19:16:51,324 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 15 states. [2018-11-14 19:16:53,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:53,531 INFO L93 Difference]: Finished difference Result 108 states and 133 transitions. [2018-11-14 19:16:53,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-14 19:16:53,532 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-11-14 19:16:53,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:16:53,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 19:16:53,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 122 transitions. [2018-11-14 19:16:53,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 19:16:53,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 122 transitions. [2018-11-14 19:16:53,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 122 transitions. [2018-11-14 19:16:53,735 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:16:53,738 INFO L225 Difference]: With dead ends: 108 [2018-11-14 19:16:53,738 INFO L226 Difference]: Without dead ends: 82 [2018-11-14 19:16:53,739 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=164, Invalid=766, Unknown=0, NotChecked=0, Total=930 [2018-11-14 19:16:53,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-14 19:16:53,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 69. [2018-11-14 19:16:53,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:16:53,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 69 states. [2018-11-14 19:16:53,808 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 69 states. [2018-11-14 19:16:53,808 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 69 states. [2018-11-14 19:16:53,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:53,811 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2018-11-14 19:16:53,812 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2018-11-14 19:16:53,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:16:53,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:16:53,812 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 82 states. [2018-11-14 19:16:53,812 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 82 states. [2018-11-14 19:16:53,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:53,815 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2018-11-14 19:16:53,816 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2018-11-14 19:16:53,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:16:53,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:16:53,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:16:53,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:16:53,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-14 19:16:53,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2018-11-14 19:16:53,819 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 46 [2018-11-14 19:16:53,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:16:53,819 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2018-11-14 19:16:53,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 19:16:53,819 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2018-11-14 19:16:53,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-14 19:16:53,820 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:16:53,820 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 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:16:53,821 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:16:53,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:16:53,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1252535318, now seen corresponding path program 1 times [2018-11-14 19:16:53,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:16:53,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:16:53,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:53,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:16:53,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:16:54,114 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:16:54,120 INFO L168 Benchmark]: Toolchain (without parser) took 16200.90 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 867.7 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -334.6 MB). Peak memory consumption was 533.1 MB. Max. memory is 7.1 GB. [2018-11-14 19:16:54,122 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:16:54,122 INFO L168 Benchmark]: CACSL2BoogieTranslator took 728.76 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -797.7 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2018-11-14 19:16:54,123 INFO L168 Benchmark]: Boogie Preprocessor took 80.65 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-11-14 19:16:54,123 INFO L168 Benchmark]: RCFGBuilder took 1248.80 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 75.7 MB). Peak memory consumption was 75.7 MB. Max. memory is 7.1 GB. [2018-11-14 19:16:54,124 INFO L168 Benchmark]: TraceAbstraction took 14137.35 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 131.6 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 374.1 MB). Peak memory consumption was 505.7 MB. Max. memory is 7.1 GB. [2018-11-14 19:16:54,128 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 728.76 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -797.7 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 80.65 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1248.80 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 75.7 MB). Peak memory consumption was 75.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14137.35 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 131.6 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 374.1 MB). Peak memory consumption was 505.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...