java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/heap-manipulation/merge_sort_false-unreach-call_false-valid-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 23:44:07,096 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 23:44:07,098 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 23:44:07,110 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 23:44:07,110 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 23:44:07,111 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 23:44:07,113 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 23:44:07,115 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 23:44:07,116 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 23:44:07,117 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 23:44:07,118 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 23:44:07,118 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 23:44:07,120 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 23:44:07,120 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 23:44:07,125 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 23:44:07,126 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 23:44:07,126 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 23:44:07,136 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 23:44:07,138 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 23:44:07,142 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 23:44:07,143 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 23:44:07,144 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 23:44:07,146 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 23:44:07,146 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 23:44:07,146 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 23:44:07,148 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 23:44:07,149 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 23:44:07,151 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 23:44:07,152 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 23:44:07,153 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 23:44:07,153 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 23:44:07,154 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 23:44:07,154 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 23:44:07,154 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 23:44:07,157 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 23:44:07,158 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 23:44:07,158 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 23:44:07,187 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 23:44:07,188 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 23:44:07,188 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 23:44:07,189 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 23:44:07,189 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 23:44:07,190 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 23:44:07,190 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 23:44:07,190 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 23:44:07,190 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 23:44:07,190 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 23:44:07,191 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 23:44:07,191 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 23:44:07,191 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 23:44:07,191 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 23:44:07,191 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 23:44:07,191 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 23:44:07,193 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 23:44:07,193 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 23:44:07,193 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 23:44:07,193 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 23:44:07,194 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 23:44:07,194 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 23:44:07,194 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 23:44:07,194 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:44:07,194 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 23:44:07,194 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 23:44:07,195 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 23:44:07,195 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 23:44:07,195 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 23:44:07,195 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 23:44:07,196 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 23:44:07,243 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 23:44:07,255 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 23:44:07,260 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 23:44:07,261 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 23:44:07,261 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 23:44:07,262 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/merge_sort_false-unreach-call_false-valid-memcleanup.i [2018-11-18 23:44:07,319 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce3cb009d/8d0a479797e74f7db1edd8de53237c26/FLAGe8d0a5e9e [2018-11-18 23:44:07,862 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 23:44:07,863 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/merge_sort_false-unreach-call_false-valid-memcleanup.i [2018-11-18 23:44:07,879 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce3cb009d/8d0a479797e74f7db1edd8de53237c26/FLAGe8d0a5e9e [2018-11-18 23:44:08,142 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce3cb009d/8d0a479797e74f7db1edd8de53237c26 [2018-11-18 23:44:08,153 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 23:44:08,154 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 23:44:08,155 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 23:44:08,155 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 23:44:08,159 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 23:44:08,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:44:08" (1/1) ... [2018-11-18 23:44:08,163 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a33e89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:08, skipping insertion in model container [2018-11-18 23:44:08,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:44:08" (1/1) ... [2018-11-18 23:44:08,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 23:44:08,238 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 23:44:08,647 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:44:08,657 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 23:44:08,755 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:44:08,816 INFO L195 MainTranslator]: Completed translation [2018-11-18 23:44:08,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:08 WrapperNode [2018-11-18 23:44:08,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 23:44:08,818 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 23:44:08,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 23:44:08,818 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 23:44:08,903 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:08" (1/1) ... [2018-11-18 23:44:08,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:08" (1/1) ... [2018-11-18 23:44:08,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:08" (1/1) ... [2018-11-18 23:44:08,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:08" (1/1) ... [2018-11-18 23:44:08,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:08" (1/1) ... [2018-11-18 23:44:08,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:08" (1/1) ... [2018-11-18 23:44:08,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:08" (1/1) ... [2018-11-18 23:44:09,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 23:44:09,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 23:44:09,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 23:44:09,008 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 23:44:09,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:08" (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-18 23:44:09,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 23:44:09,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 23:44:09,062 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-18 23:44:09,062 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-18 23:44:09,062 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-11-18 23:44:09,062 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2018-11-18 23:44:09,062 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2018-11-18 23:44:09,062 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2018-11-18 23:44:09,063 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2018-11-18 23:44:09,063 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2018-11-18 23:44:09,063 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 23:44:09,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 23:44:09,063 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-18 23:44:09,063 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-18 23:44:09,064 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-18 23:44:09,064 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-18 23:44:09,064 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-18 23:44:09,064 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-18 23:44:09,064 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-18 23:44:09,065 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-18 23:44:09,065 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-18 23:44:09,065 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-18 23:44:09,065 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-18 23:44:09,065 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-18 23:44:09,065 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-18 23:44:09,066 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-18 23:44:09,066 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-18 23:44:09,066 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-18 23:44:09,066 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-18 23:44:09,066 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-18 23:44:09,066 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-18 23:44:09,066 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-18 23:44:09,067 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-18 23:44:09,067 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-18 23:44:09,067 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-18 23:44:09,067 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-18 23:44:09,067 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-18 23:44:09,067 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-18 23:44:09,068 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-18 23:44:09,068 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-18 23:44:09,068 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-18 23:44:09,068 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-18 23:44:09,068 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-18 23:44:09,068 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-18 23:44:09,068 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-18 23:44:09,069 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-18 23:44:09,069 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-18 23:44:09,069 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-18 23:44:09,069 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-18 23:44:09,069 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-18 23:44:09,069 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-18 23:44:09,069 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-18 23:44:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-18 23:44:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-18 23:44:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-18 23:44:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-18 23:44:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-18 23:44:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-18 23:44:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-18 23:44:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-18 23:44:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-18 23:44:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-18 23:44:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-18 23:44:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-18 23:44:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 23:44:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-18 23:44:09,072 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-18 23:44:09,072 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-18 23:44:09,072 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-18 23:44:09,072 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-18 23:44:09,072 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-18 23:44:09,073 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-18 23:44:09,073 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-18 23:44:09,073 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-18 23:44:09,073 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-18 23:44:09,073 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 23:44:09,074 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-18 23:44:09,074 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-18 23:44:09,074 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-18 23:44:09,074 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-18 23:44:09,074 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-18 23:44:09,075 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-18 23:44:09,075 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-18 23:44:09,075 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-18 23:44:09,075 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-18 23:44:09,075 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-18 23:44:09,075 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-18 23:44:09,076 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-18 23:44:09,076 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-18 23:44:09,076 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-18 23:44:09,076 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-18 23:44:09,077 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-18 23:44:09,077 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-18 23:44:09,077 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-18 23:44:09,077 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-18 23:44:09,077 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-18 23:44:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-18 23:44:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-18 23:44:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-18 23:44:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-18 23:44:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-18 23:44:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-18 23:44:09,079 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-18 23:44:09,079 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-18 23:44:09,079 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-18 23:44:09,079 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-18 23:44:09,079 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-18 23:44:09,079 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-18 23:44:09,080 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-18 23:44:09,080 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-18 23:44:09,080 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-18 23:44:09,080 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-18 23:44:09,080 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-18 23:44:09,080 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-18 23:44:09,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 23:44:09,081 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-11-18 23:44:09,081 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2018-11-18 23:44:09,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 23:44:09,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 23:44:09,081 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2018-11-18 23:44:09,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 23:44:09,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 23:44:09,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 23:44:09,082 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2018-11-18 23:44:09,082 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2018-11-18 23:44:09,082 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2018-11-18 23:44:09,082 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 23:44:09,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 23:44:09,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 23:44:09,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 23:44:09,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 23:44:10,968 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 23:44:10,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:44:10 BoogieIcfgContainer [2018-11-18 23:44:10,969 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 23:44:10,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 23:44:10,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 23:44:10,973 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 23:44:10,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:44:08" (1/3) ... [2018-11-18 23:44:10,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43252fae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:44:10, skipping insertion in model container [2018-11-18 23:44:10,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:08" (2/3) ... [2018-11-18 23:44:10,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43252fae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:44:10, skipping insertion in model container [2018-11-18 23:44:10,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:44:10" (3/3) ... [2018-11-18 23:44:10,977 INFO L112 eAbstractionObserver]: Analyzing ICFG merge_sort_false-unreach-call_false-valid-memcleanup.i [2018-11-18 23:44:10,987 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 23:44:10,995 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 23:44:11,012 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 23:44:11,046 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 23:44:11,047 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 23:44:11,047 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 23:44:11,048 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 23:44:11,048 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 23:44:11,048 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 23:44:11,048 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 23:44:11,048 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 23:44:11,049 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 23:44:11,072 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2018-11-18 23:44:11,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 23:44:11,079 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:44:11,080 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:44:11,083 INFO L423 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:44:11,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:44:11,089 INFO L82 PathProgramCache]: Analyzing trace with hash 993254836, now seen corresponding path program 1 times [2018-11-18 23:44:11,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:44:11,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:44:11,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:44:11,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:44:11,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:44:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:44:11,264 INFO L256 TraceCheckUtils]: 0: Hoare triple {127#true} call ULTIMATE.init(); {127#true} is VALID [2018-11-18 23:44:11,268 INFO L273 TraceCheckUtils]: 1: Hoare triple {127#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {127#true} is VALID [2018-11-18 23:44:11,268 INFO L273 TraceCheckUtils]: 2: Hoare triple {127#true} assume true; {127#true} is VALID [2018-11-18 23:44:11,269 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {127#true} {127#true} #455#return; {127#true} is VALID [2018-11-18 23:44:11,269 INFO L256 TraceCheckUtils]: 4: Hoare triple {127#true} call #t~ret44 := main(); {127#true} is VALID [2018-11-18 23:44:11,270 INFO L273 TraceCheckUtils]: 5: Hoare triple {127#true} ~data~0.base, ~data~0.offset := 0, 0; {127#true} is VALID [2018-11-18 23:44:11,274 INFO L273 TraceCheckUtils]: 6: Hoare triple {127#true} assume !true; {128#false} is VALID [2018-11-18 23:44:11,274 INFO L273 TraceCheckUtils]: 7: Hoare triple {128#false} assume !(~data~0.base == 0 && ~data~0.offset == 0); {128#false} is VALID [2018-11-18 23:44:11,274 INFO L256 TraceCheckUtils]: 8: Hoare triple {128#false} call inspect_before(~data~0.base, ~data~0.offset); {128#false} is VALID [2018-11-18 23:44:11,276 INFO L273 TraceCheckUtils]: 9: Hoare triple {128#false} ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; {128#false} is VALID [2018-11-18 23:44:11,276 INFO L273 TraceCheckUtils]: 10: Hoare triple {128#false} assume true; {128#false} is VALID [2018-11-18 23:44:11,276 INFO L273 TraceCheckUtils]: 11: Hoare triple {128#false} assume ~shape.base == 0 && ~shape.offset == 0; {128#false} is VALID [2018-11-18 23:44:11,277 INFO L256 TraceCheckUtils]: 12: Hoare triple {128#false} call fail(); {128#false} is VALID [2018-11-18 23:44:11,277 INFO L273 TraceCheckUtils]: 13: Hoare triple {128#false} assume !false; {128#false} is VALID [2018-11-18 23:44:11,280 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-18 23:44:11,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:44:11,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 23:44:11,292 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-18 23:44:11,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:44:11,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 23:44:11,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:44:11,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 23:44:11,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 23:44:11,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:44:11,500 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 2 states. [2018-11-18 23:44:12,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:12,608 INFO L93 Difference]: Finished difference Result 240 states and 391 transitions. [2018-11-18 23:44:12,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 23:44:12,608 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-18 23:44:12,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:44:12,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:44:12,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 391 transitions. [2018-11-18 23:44:12,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:44:12,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 391 transitions. [2018-11-18 23:44:12,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 391 transitions. [2018-11-18 23:44:13,288 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 391 edges. 391 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:44:13,309 INFO L225 Difference]: With dead ends: 240 [2018-11-18 23:44:13,309 INFO L226 Difference]: Without dead ends: 111 [2018-11-18 23:44:13,314 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-18 23:44:13,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-18 23:44:13,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-11-18 23:44:13,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:44:13,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 111 states. [2018-11-18 23:44:13,414 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 111 states. [2018-11-18 23:44:13,415 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 111 states. [2018-11-18 23:44:13,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:13,425 INFO L93 Difference]: Finished difference Result 111 states and 134 transitions. [2018-11-18 23:44:13,425 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 134 transitions. [2018-11-18 23:44:13,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:44:13,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:44:13,428 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 111 states. [2018-11-18 23:44:13,428 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 111 states. [2018-11-18 23:44:13,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:13,438 INFO L93 Difference]: Finished difference Result 111 states and 134 transitions. [2018-11-18 23:44:13,438 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 134 transitions. [2018-11-18 23:44:13,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:44:13,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:44:13,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:44:13,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:44:13,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-18 23:44:13,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 134 transitions. [2018-11-18 23:44:13,449 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 134 transitions. Word has length 14 [2018-11-18 23:44:13,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:44:13,450 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 134 transitions. [2018-11-18 23:44:13,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 23:44:13,450 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 134 transitions. [2018-11-18 23:44:13,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 23:44:13,451 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:44:13,451 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:44:13,451 INFO L423 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:44:13,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:44:13,452 INFO L82 PathProgramCache]: Analyzing trace with hash 213030440, now seen corresponding path program 1 times [2018-11-18 23:44:13,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:44:13,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:44:13,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:44:13,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:44:13,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:44:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:44:13,546 INFO L256 TraceCheckUtils]: 0: Hoare triple {813#true} call ULTIMATE.init(); {813#true} is VALID [2018-11-18 23:44:13,547 INFO L273 TraceCheckUtils]: 1: Hoare triple {813#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {813#true} is VALID [2018-11-18 23:44:13,547 INFO L273 TraceCheckUtils]: 2: Hoare triple {813#true} assume true; {813#true} is VALID [2018-11-18 23:44:13,548 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {813#true} {813#true} #455#return; {813#true} is VALID [2018-11-18 23:44:13,548 INFO L256 TraceCheckUtils]: 4: Hoare triple {813#true} call #t~ret44 := main(); {813#true} is VALID [2018-11-18 23:44:13,549 INFO L273 TraceCheckUtils]: 5: Hoare triple {813#true} ~data~0.base, ~data~0.offset := 0, 0; {815#(and (= main_~data~0.offset 0) (= main_~data~0.base 0))} is VALID [2018-11-18 23:44:13,550 INFO L273 TraceCheckUtils]: 6: Hoare triple {815#(and (= main_~data~0.offset 0) (= main_~data~0.base 0))} assume true; {815#(and (= main_~data~0.offset 0) (= main_~data~0.base 0))} is VALID [2018-11-18 23:44:13,558 INFO L273 TraceCheckUtils]: 7: Hoare triple {815#(and (= main_~data~0.offset 0) (= main_~data~0.base 0))} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {815#(and (= main_~data~0.offset 0) (= main_~data~0.base 0))} is VALID [2018-11-18 23:44:13,558 INFO L273 TraceCheckUtils]: 8: Hoare triple {815#(and (= main_~data~0.offset 0) (= main_~data~0.base 0))} assume !(0 != #t~nondet36);havoc #t~nondet36; {815#(and (= main_~data~0.offset 0) (= main_~data~0.base 0))} is VALID [2018-11-18 23:44:13,560 INFO L273 TraceCheckUtils]: 9: Hoare triple {815#(and (= main_~data~0.offset 0) (= main_~data~0.base 0))} assume !(~data~0.base == 0 && ~data~0.offset == 0); {814#false} is VALID [2018-11-18 23:44:13,560 INFO L256 TraceCheckUtils]: 10: Hoare triple {814#false} call inspect_before(~data~0.base, ~data~0.offset); {814#false} is VALID [2018-11-18 23:44:13,560 INFO L273 TraceCheckUtils]: 11: Hoare triple {814#false} ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; {814#false} is VALID [2018-11-18 23:44:13,560 INFO L273 TraceCheckUtils]: 12: Hoare triple {814#false} assume true; {814#false} is VALID [2018-11-18 23:44:13,561 INFO L273 TraceCheckUtils]: 13: Hoare triple {814#false} assume ~shape.base == 0 && ~shape.offset == 0; {814#false} is VALID [2018-11-18 23:44:13,561 INFO L256 TraceCheckUtils]: 14: Hoare triple {814#false} call fail(); {814#false} is VALID [2018-11-18 23:44:13,561 INFO L273 TraceCheckUtils]: 15: Hoare triple {814#false} assume !false; {814#false} is VALID [2018-11-18 23:44:13,563 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-18 23:44:13,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:44:13,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:44:13,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-18 23:44:13,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:44:13,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:44:13,602 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:44:13,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:44:13,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:44:13,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:44:13,603 INFO L87 Difference]: Start difference. First operand 111 states and 134 transitions. Second operand 3 states. [2018-11-18 23:44:13,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:13,959 INFO L93 Difference]: Finished difference Result 216 states and 262 transitions. [2018-11-18 23:44:13,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:44:13,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-18 23:44:13,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:44:13,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:44:13,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2018-11-18 23:44:13,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:44:13,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2018-11-18 23:44:13,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 262 transitions. [2018-11-18 23:44:14,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:44:14,405 INFO L225 Difference]: With dead ends: 216 [2018-11-18 23:44:14,405 INFO L226 Difference]: Without dead ends: 118 [2018-11-18 23:44:14,407 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-18 23:44:14,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-18 23:44:14,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2018-11-18 23:44:14,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:44:14,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 114 states. [2018-11-18 23:44:14,488 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 114 states. [2018-11-18 23:44:14,488 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 114 states. [2018-11-18 23:44:14,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:14,495 INFO L93 Difference]: Finished difference Result 118 states and 141 transitions. [2018-11-18 23:44:14,495 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 141 transitions. [2018-11-18 23:44:14,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:44:14,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:44:14,497 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 118 states. [2018-11-18 23:44:14,497 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 118 states. [2018-11-18 23:44:14,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:14,503 INFO L93 Difference]: Finished difference Result 118 states and 141 transitions. [2018-11-18 23:44:14,503 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 141 transitions. [2018-11-18 23:44:14,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:44:14,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:44:14,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:44:14,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:44:14,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-18 23:44:14,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 137 transitions. [2018-11-18 23:44:14,510 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 137 transitions. Word has length 16 [2018-11-18 23:44:14,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:44:14,511 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 137 transitions. [2018-11-18 23:44:14,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:44:14,511 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 137 transitions. [2018-11-18 23:44:14,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 23:44:14,512 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:44:14,512 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:44:14,512 INFO L423 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:44:14,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:44:14,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1390052738, now seen corresponding path program 1 times [2018-11-18 23:44:14,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:44:14,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:44:14,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:44:14,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:44:14,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:44:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:44:14,691 INFO L256 TraceCheckUtils]: 0: Hoare triple {1492#true} call ULTIMATE.init(); {1492#true} is VALID [2018-11-18 23:44:14,691 INFO L273 TraceCheckUtils]: 1: Hoare triple {1492#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1492#true} is VALID [2018-11-18 23:44:14,692 INFO L273 TraceCheckUtils]: 2: Hoare triple {1492#true} assume true; {1492#true} is VALID [2018-11-18 23:44:14,692 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1492#true} {1492#true} #455#return; {1492#true} is VALID [2018-11-18 23:44:14,693 INFO L256 TraceCheckUtils]: 4: Hoare triple {1492#true} call #t~ret44 := main(); {1492#true} is VALID [2018-11-18 23:44:14,693 INFO L273 TraceCheckUtils]: 5: Hoare triple {1492#true} ~data~0.base, ~data~0.offset := 0, 0; {1492#true} is VALID [2018-11-18 23:44:14,693 INFO L273 TraceCheckUtils]: 6: Hoare triple {1492#true} assume true; {1492#true} is VALID [2018-11-18 23:44:14,694 INFO L273 TraceCheckUtils]: 7: Hoare triple {1492#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {1492#true} is VALID [2018-11-18 23:44:14,694 INFO L273 TraceCheckUtils]: 8: Hoare triple {1492#true} assume !!(0 != #t~nondet36);havoc #t~nondet36;call #t~malloc37.base, #t~malloc37.offset := #Ultimate.alloc(8);~node~1.base, ~node~1.offset := #t~malloc37.base, #t~malloc37.offset; {1492#true} is VALID [2018-11-18 23:44:14,694 INFO L273 TraceCheckUtils]: 9: Hoare triple {1492#true} assume !(~node~1.base == 0 && ~node~1.offset == 0); {1492#true} is VALID [2018-11-18 23:44:14,695 INFO L273 TraceCheckUtils]: 10: Hoare triple {1492#true} call write~$Pointer$(~node~1.base, ~node~1.offset, ~node~1.base, ~node~1.offset, 4);assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;call write~int(#t~nondet38, ~node~1.base, 4 + ~node~1.offset, 4);havoc #t~nondet38;call #t~malloc39.base, #t~malloc39.offset := #Ultimate.alloc(8);~item~0.base, ~item~0.offset := #t~malloc39.base, #t~malloc39.offset; {1494#(not (= 0 main_~item~0.base))} is VALID [2018-11-18 23:44:14,698 INFO L273 TraceCheckUtils]: 11: Hoare triple {1494#(not (= 0 main_~item~0.base))} assume !(~item~0.base == 0 && ~item~0.offset == 0); {1494#(not (= 0 main_~item~0.base))} is VALID [2018-11-18 23:44:14,698 INFO L273 TraceCheckUtils]: 12: Hoare triple {1494#(not (= 0 main_~item~0.base))} call write~$Pointer$(~node~1.base, ~node~1.offset, ~item~0.base, ~item~0.offset, 4);call write~$Pointer$(~data~0.base, ~data~0.offset, ~item~0.base, 4 + ~item~0.offset, 4);~data~0.base, ~data~0.offset := ~item~0.base, ~item~0.offset; {1495#(not (= 0 main_~data~0.base))} is VALID [2018-11-18 23:44:14,699 INFO L273 TraceCheckUtils]: 13: Hoare triple {1495#(not (= 0 main_~data~0.base))} assume true; {1495#(not (= 0 main_~data~0.base))} is VALID [2018-11-18 23:44:14,699 INFO L273 TraceCheckUtils]: 14: Hoare triple {1495#(not (= 0 main_~data~0.base))} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {1495#(not (= 0 main_~data~0.base))} is VALID [2018-11-18 23:44:14,700 INFO L273 TraceCheckUtils]: 15: Hoare triple {1495#(not (= 0 main_~data~0.base))} assume !(0 != #t~nondet36);havoc #t~nondet36; {1495#(not (= 0 main_~data~0.base))} is VALID [2018-11-18 23:44:14,700 INFO L273 TraceCheckUtils]: 16: Hoare triple {1495#(not (= 0 main_~data~0.base))} assume !(~data~0.base == 0 && ~data~0.offset == 0); {1495#(not (= 0 main_~data~0.base))} is VALID [2018-11-18 23:44:14,702 INFO L256 TraceCheckUtils]: 17: Hoare triple {1495#(not (= 0 main_~data~0.base))} call inspect_before(~data~0.base, ~data~0.offset); {1496#(not (= 0 |inspect_before_#in~shape.base|))} is VALID [2018-11-18 23:44:14,703 INFO L273 TraceCheckUtils]: 18: Hoare triple {1496#(not (= 0 |inspect_before_#in~shape.base|))} ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; {1497#(not (= 0 inspect_before_~shape.base))} is VALID [2018-11-18 23:44:14,704 INFO L273 TraceCheckUtils]: 19: Hoare triple {1497#(not (= 0 inspect_before_~shape.base))} assume true; {1497#(not (= 0 inspect_before_~shape.base))} is VALID [2018-11-18 23:44:14,706 INFO L273 TraceCheckUtils]: 20: Hoare triple {1497#(not (= 0 inspect_before_~shape.base))} assume ~shape.base == 0 && ~shape.offset == 0; {1493#false} is VALID [2018-11-18 23:44:14,706 INFO L256 TraceCheckUtils]: 21: Hoare triple {1493#false} call fail(); {1493#false} is VALID [2018-11-18 23:44:14,707 INFO L273 TraceCheckUtils]: 22: Hoare triple {1493#false} assume !false; {1493#false} is VALID [2018-11-18 23:44:14,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:44:14,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:44:14,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 23:44:14,710 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-18 23:44:14,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:44:14,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 23:44:14,771 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:44:14,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 23:44:14,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 23:44:14,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 23:44:14,772 INFO L87 Difference]: Start difference. First operand 114 states and 137 transitions. Second operand 6 states. [2018-11-18 23:44:15,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:15,780 INFO L93 Difference]: Finished difference Result 163 states and 196 transitions. [2018-11-18 23:44:15,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 23:44:15,780 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-18 23:44:15,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:44:15,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:44:15,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2018-11-18 23:44:15,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:44:15,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2018-11-18 23:44:15,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 196 transitions. [2018-11-18 23:44:16,052 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:44:16,057 INFO L225 Difference]: With dead ends: 163 [2018-11-18 23:44:16,057 INFO L226 Difference]: Without dead ends: 158 [2018-11-18 23:44:16,058 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 23:44:16,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-18 23:44:16,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 119. [2018-11-18 23:44:16,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:44:16,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand 119 states. [2018-11-18 23:44:16,133 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 119 states. [2018-11-18 23:44:16,134 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 119 states. [2018-11-18 23:44:16,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:16,140 INFO L93 Difference]: Finished difference Result 158 states and 189 transitions. [2018-11-18 23:44:16,141 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 189 transitions. [2018-11-18 23:44:16,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:44:16,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:44:16,142 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 158 states. [2018-11-18 23:44:16,142 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 158 states. [2018-11-18 23:44:16,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:16,149 INFO L93 Difference]: Finished difference Result 158 states and 189 transitions. [2018-11-18 23:44:16,150 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 189 transitions. [2018-11-18 23:44:16,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:44:16,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:44:16,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:44:16,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:44:16,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-18 23:44:16,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 142 transitions. [2018-11-18 23:44:16,156 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 142 transitions. Word has length 23 [2018-11-18 23:44:16,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:44:16,157 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 142 transitions. [2018-11-18 23:44:16,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 23:44:16,157 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 142 transitions. [2018-11-18 23:44:16,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 23:44:16,158 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:44:16,158 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:44:16,158 INFO L423 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:44:16,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:44:16,159 INFO L82 PathProgramCache]: Analyzing trace with hash 310598650, now seen corresponding path program 1 times [2018-11-18 23:44:16,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:44:16,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:44:16,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:44:16,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:44:16,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:44:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:44:16,329 INFO L256 TraceCheckUtils]: 0: Hoare triple {2192#true} call ULTIMATE.init(); {2192#true} is VALID [2018-11-18 23:44:16,330 INFO L273 TraceCheckUtils]: 1: Hoare triple {2192#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2192#true} is VALID [2018-11-18 23:44:16,330 INFO L273 TraceCheckUtils]: 2: Hoare triple {2192#true} assume true; {2192#true} is VALID [2018-11-18 23:44:16,331 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2192#true} {2192#true} #455#return; {2192#true} is VALID [2018-11-18 23:44:16,331 INFO L256 TraceCheckUtils]: 4: Hoare triple {2192#true} call #t~ret44 := main(); {2192#true} is VALID [2018-11-18 23:44:16,331 INFO L273 TraceCheckUtils]: 5: Hoare triple {2192#true} ~data~0.base, ~data~0.offset := 0, 0; {2192#true} is VALID [2018-11-18 23:44:16,332 INFO L273 TraceCheckUtils]: 6: Hoare triple {2192#true} assume true; {2192#true} is VALID [2018-11-18 23:44:16,332 INFO L273 TraceCheckUtils]: 7: Hoare triple {2192#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {2192#true} is VALID [2018-11-18 23:44:16,332 INFO L273 TraceCheckUtils]: 8: Hoare triple {2192#true} assume !!(0 != #t~nondet36);havoc #t~nondet36;call #t~malloc37.base, #t~malloc37.offset := #Ultimate.alloc(8);~node~1.base, ~node~1.offset := #t~malloc37.base, #t~malloc37.offset; {2192#true} is VALID [2018-11-18 23:44:16,333 INFO L273 TraceCheckUtils]: 9: Hoare triple {2192#true} assume !(~node~1.base == 0 && ~node~1.offset == 0); {2192#true} is VALID [2018-11-18 23:44:16,333 INFO L273 TraceCheckUtils]: 10: Hoare triple {2192#true} call write~$Pointer$(~node~1.base, ~node~1.offset, ~node~1.base, ~node~1.offset, 4);assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;call write~int(#t~nondet38, ~node~1.base, 4 + ~node~1.offset, 4);havoc #t~nondet38;call #t~malloc39.base, #t~malloc39.offset := #Ultimate.alloc(8);~item~0.base, ~item~0.offset := #t~malloc39.base, #t~malloc39.offset; {2192#true} is VALID [2018-11-18 23:44:16,334 INFO L273 TraceCheckUtils]: 11: Hoare triple {2192#true} assume !(~item~0.base == 0 && ~item~0.offset == 0); {2192#true} is VALID [2018-11-18 23:44:16,334 INFO L273 TraceCheckUtils]: 12: Hoare triple {2192#true} call write~$Pointer$(~node~1.base, ~node~1.offset, ~item~0.base, ~item~0.offset, 4);call write~$Pointer$(~data~0.base, ~data~0.offset, ~item~0.base, 4 + ~item~0.offset, 4);~data~0.base, ~data~0.offset := ~item~0.base, ~item~0.offset; {2192#true} is VALID [2018-11-18 23:44:16,335 INFO L273 TraceCheckUtils]: 13: Hoare triple {2192#true} assume true; {2192#true} is VALID [2018-11-18 23:44:16,335 INFO L273 TraceCheckUtils]: 14: Hoare triple {2192#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {2192#true} is VALID [2018-11-18 23:44:16,335 INFO L273 TraceCheckUtils]: 15: Hoare triple {2192#true} assume !(0 != #t~nondet36);havoc #t~nondet36; {2192#true} is VALID [2018-11-18 23:44:16,335 INFO L273 TraceCheckUtils]: 16: Hoare triple {2192#true} assume !(~data~0.base == 0 && ~data~0.offset == 0); {2192#true} is VALID [2018-11-18 23:44:16,336 INFO L256 TraceCheckUtils]: 17: Hoare triple {2192#true} call inspect_before(~data~0.base, ~data~0.offset); {2192#true} is VALID [2018-11-18 23:44:16,336 INFO L273 TraceCheckUtils]: 18: Hoare triple {2192#true} ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; {2192#true} is VALID [2018-11-18 23:44:16,336 INFO L273 TraceCheckUtils]: 19: Hoare triple {2192#true} assume true; {2192#true} is VALID [2018-11-18 23:44:16,336 INFO L273 TraceCheckUtils]: 20: Hoare triple {2192#true} assume !(~shape.base == 0 && ~shape.offset == 0); {2192#true} is VALID [2018-11-18 23:44:16,337 INFO L273 TraceCheckUtils]: 21: Hoare triple {2192#true} assume true; {2192#true} is VALID [2018-11-18 23:44:16,345 INFO L273 TraceCheckUtils]: 22: Hoare triple {2192#true} assume true;call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); {2194#(and (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem25.base|) (= (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem25.offset|))} is VALID [2018-11-18 23:44:16,345 INFO L273 TraceCheckUtils]: 23: Hoare triple {2194#(and (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem25.base|) (= (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem25.offset|))} assume !(#t~mem25.base != 0 || #t~mem25.offset != 0);havoc #t~mem25.base, #t~mem25.offset; {2195#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} is VALID [2018-11-18 23:44:16,347 INFO L273 TraceCheckUtils]: 24: Hoare triple {2195#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} assume true; {2195#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} is VALID [2018-11-18 23:44:16,347 INFO L273 TraceCheckUtils]: 25: Hoare triple {2195#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} assume !(~shape.base == 0 && ~shape.offset == 0); {2195#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} is VALID [2018-11-18 23:44:16,349 INFO L273 TraceCheckUtils]: 26: Hoare triple {2195#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} assume true; {2195#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} is VALID [2018-11-18 23:44:16,349 INFO L273 TraceCheckUtils]: 27: Hoare triple {2195#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} assume true;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); {2196#(and (= 0 |inspect_before_#t~mem26.offset|) (= 0 |inspect_before_#t~mem26.base|))} is VALID [2018-11-18 23:44:16,351 INFO L273 TraceCheckUtils]: 28: Hoare triple {2196#(and (= 0 |inspect_before_#t~mem26.offset|) (= 0 |inspect_before_#t~mem26.base|))} assume !(#t~mem26.base == 0 && #t~mem26.offset == 0);havoc #t~mem26.base, #t~mem26.offset; {2193#false} is VALID [2018-11-18 23:44:16,351 INFO L256 TraceCheckUtils]: 29: Hoare triple {2193#false} call fail(); {2193#false} is VALID [2018-11-18 23:44:16,351 INFO L273 TraceCheckUtils]: 30: Hoare triple {2193#false} assume !false; {2193#false} is VALID [2018-11-18 23:44:16,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 23:44:16,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:44:16,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 23:44:16,356 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-18 23:44:16,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:44:16,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 23:44:16,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:44:16,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 23:44:16,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 23:44:16,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:44:16,463 INFO L87 Difference]: Start difference. First operand 119 states and 142 transitions. Second operand 5 states. [2018-11-18 23:44:17,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:17,906 INFO L93 Difference]: Finished difference Result 121 states and 143 transitions. [2018-11-18 23:44:17,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 23:44:17,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-18 23:44:17,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:44:17,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:44:17,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2018-11-18 23:44:17,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:44:17,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2018-11-18 23:44:17,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 133 transitions. [2018-11-18 23:44:18,110 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:44:18,113 INFO L225 Difference]: With dead ends: 121 [2018-11-18 23:44:18,113 INFO L226 Difference]: Without dead ends: 118 [2018-11-18 23:44:18,114 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-18 23:44:18,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-18 23:44:18,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-11-18 23:44:18,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:44:18,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 118 states. [2018-11-18 23:44:18,164 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 118 states. [2018-11-18 23:44:18,164 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 118 states. [2018-11-18 23:44:18,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:18,168 INFO L93 Difference]: Finished difference Result 118 states and 140 transitions. [2018-11-18 23:44:18,169 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 140 transitions. [2018-11-18 23:44:18,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:44:18,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:44:18,169 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 118 states. [2018-11-18 23:44:18,169 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 118 states. [2018-11-18 23:44:18,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:18,173 INFO L93 Difference]: Finished difference Result 118 states and 140 transitions. [2018-11-18 23:44:18,173 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 140 transitions. [2018-11-18 23:44:18,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:44:18,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:44:18,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:44:18,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:44:18,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-18 23:44:18,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 140 transitions. [2018-11-18 23:44:18,178 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 140 transitions. Word has length 31 [2018-11-18 23:44:18,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:44:18,178 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 140 transitions. [2018-11-18 23:44:18,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 23:44:18,178 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 140 transitions. [2018-11-18 23:44:18,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 23:44:18,179 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:44:18,179 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:44:18,179 INFO L423 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:44:18,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:44:18,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1477891468, now seen corresponding path program 1 times [2018-11-18 23:44:18,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:44:18,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:44:18,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:44:18,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:44:18,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:44:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:44:18,314 INFO L256 TraceCheckUtils]: 0: Hoare triple {2752#true} call ULTIMATE.init(); {2752#true} is VALID [2018-11-18 23:44:18,314 INFO L273 TraceCheckUtils]: 1: Hoare triple {2752#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2752#true} is VALID [2018-11-18 23:44:18,315 INFO L273 TraceCheckUtils]: 2: Hoare triple {2752#true} assume true; {2752#true} is VALID [2018-11-18 23:44:18,315 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2752#true} {2752#true} #455#return; {2752#true} is VALID [2018-11-18 23:44:18,315 INFO L256 TraceCheckUtils]: 4: Hoare triple {2752#true} call #t~ret44 := main(); {2752#true} is VALID [2018-11-18 23:44:18,315 INFO L273 TraceCheckUtils]: 5: Hoare triple {2752#true} ~data~0.base, ~data~0.offset := 0, 0; {2752#true} is VALID [2018-11-18 23:44:18,316 INFO L273 TraceCheckUtils]: 6: Hoare triple {2752#true} assume true; {2752#true} is VALID [2018-11-18 23:44:18,316 INFO L273 TraceCheckUtils]: 7: Hoare triple {2752#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {2752#true} is VALID [2018-11-18 23:44:18,316 INFO L273 TraceCheckUtils]: 8: Hoare triple {2752#true} assume !!(0 != #t~nondet36);havoc #t~nondet36;call #t~malloc37.base, #t~malloc37.offset := #Ultimate.alloc(8);~node~1.base, ~node~1.offset := #t~malloc37.base, #t~malloc37.offset; {2752#true} is VALID [2018-11-18 23:44:18,316 INFO L273 TraceCheckUtils]: 9: Hoare triple {2752#true} assume !(~node~1.base == 0 && ~node~1.offset == 0); {2752#true} is VALID [2018-11-18 23:44:18,317 INFO L273 TraceCheckUtils]: 10: Hoare triple {2752#true} call write~$Pointer$(~node~1.base, ~node~1.offset, ~node~1.base, ~node~1.offset, 4);assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;call write~int(#t~nondet38, ~node~1.base, 4 + ~node~1.offset, 4);havoc #t~nondet38;call #t~malloc39.base, #t~malloc39.offset := #Ultimate.alloc(8);~item~0.base, ~item~0.offset := #t~malloc39.base, #t~malloc39.offset; {2752#true} is VALID [2018-11-18 23:44:18,317 INFO L273 TraceCheckUtils]: 11: Hoare triple {2752#true} assume !(~item~0.base == 0 && ~item~0.offset == 0); {2752#true} is VALID [2018-11-18 23:44:18,317 INFO L273 TraceCheckUtils]: 12: Hoare triple {2752#true} call write~$Pointer$(~node~1.base, ~node~1.offset, ~item~0.base, ~item~0.offset, 4);call write~$Pointer$(~data~0.base, ~data~0.offset, ~item~0.base, 4 + ~item~0.offset, 4);~data~0.base, ~data~0.offset := ~item~0.base, ~item~0.offset; {2752#true} is VALID [2018-11-18 23:44:18,317 INFO L273 TraceCheckUtils]: 13: Hoare triple {2752#true} assume true; {2752#true} is VALID [2018-11-18 23:44:18,317 INFO L273 TraceCheckUtils]: 14: Hoare triple {2752#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {2752#true} is VALID [2018-11-18 23:44:18,318 INFO L273 TraceCheckUtils]: 15: Hoare triple {2752#true} assume !(0 != #t~nondet36);havoc #t~nondet36; {2752#true} is VALID [2018-11-18 23:44:18,318 INFO L273 TraceCheckUtils]: 16: Hoare triple {2752#true} assume !(~data~0.base == 0 && ~data~0.offset == 0); {2752#true} is VALID [2018-11-18 23:44:18,318 INFO L256 TraceCheckUtils]: 17: Hoare triple {2752#true} call inspect_before(~data~0.base, ~data~0.offset); {2752#true} is VALID [2018-11-18 23:44:18,318 INFO L273 TraceCheckUtils]: 18: Hoare triple {2752#true} ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; {2752#true} is VALID [2018-11-18 23:44:18,319 INFO L273 TraceCheckUtils]: 19: Hoare triple {2752#true} assume true; {2752#true} is VALID [2018-11-18 23:44:18,319 INFO L273 TraceCheckUtils]: 20: Hoare triple {2752#true} assume !(~shape.base == 0 && ~shape.offset == 0); {2752#true} is VALID [2018-11-18 23:44:18,319 INFO L273 TraceCheckUtils]: 21: Hoare triple {2752#true} assume true; {2752#true} is VALID [2018-11-18 23:44:18,325 INFO L273 TraceCheckUtils]: 22: Hoare triple {2752#true} assume true;call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); {2754#(and (= |inspect_before_#t~mem25.offset| (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= |inspect_before_#t~mem25.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} is VALID [2018-11-18 23:44:18,326 INFO L273 TraceCheckUtils]: 23: Hoare triple {2754#(and (= |inspect_before_#t~mem25.offset| (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= |inspect_before_#t~mem25.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} assume !!(#t~mem25.base != 0 || #t~mem25.offset != 0);havoc #t~mem25.base, #t~mem25.offset; {2755#(or (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))} is VALID [2018-11-18 23:44:18,326 INFO L273 TraceCheckUtils]: 24: Hoare triple {2755#(or (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))} assume true; {2755#(or (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))} is VALID [2018-11-18 23:44:18,327 INFO L273 TraceCheckUtils]: 25: Hoare triple {2755#(or (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))} assume !(~shape.base == 0 && ~shape.offset == 0); {2755#(or (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))} is VALID [2018-11-18 23:44:18,327 INFO L273 TraceCheckUtils]: 26: Hoare triple {2755#(or (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))} assume true; {2755#(or (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))} is VALID [2018-11-18 23:44:18,329 INFO L273 TraceCheckUtils]: 27: Hoare triple {2755#(or (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))} assume true;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); {2756#(or (not (= 0 |inspect_before_#t~mem21.offset|)) (not (= 0 |inspect_before_#t~mem21.base|)))} is VALID [2018-11-18 23:44:18,329 INFO L273 TraceCheckUtils]: 28: Hoare triple {2756#(or (not (= 0 |inspect_before_#t~mem21.offset|)) (not (= 0 |inspect_before_#t~mem21.base|)))} assume #t~mem21.base == 0 && #t~mem21.offset == 0;havoc #t~mem21.base, #t~mem21.offset; {2753#false} is VALID [2018-11-18 23:44:18,329 INFO L256 TraceCheckUtils]: 29: Hoare triple {2753#false} call fail(); {2753#false} is VALID [2018-11-18 23:44:18,330 INFO L273 TraceCheckUtils]: 30: Hoare triple {2753#false} assume !false; {2753#false} is VALID [2018-11-18 23:44:18,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 23:44:18,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:44:18,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 23:44:18,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-18 23:44:18,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:44:18,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 23:44:18,390 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:44:18,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 23:44:18,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 23:44:18,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:44:18,391 INFO L87 Difference]: Start difference. First operand 118 states and 140 transitions. Second operand 5 states. [2018-11-18 23:44:19,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:19,219 INFO L93 Difference]: Finished difference Result 120 states and 141 transitions. [2018-11-18 23:44:19,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 23:44:19,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-18 23:44:19,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:44:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:44:19,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2018-11-18 23:44:19,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:44:19,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2018-11-18 23:44:19,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 131 transitions. [2018-11-18 23:44:19,490 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:44:19,493 INFO L225 Difference]: With dead ends: 120 [2018-11-18 23:44:19,493 INFO L226 Difference]: Without dead ends: 117 [2018-11-18 23:44:19,494 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-18 23:44:19,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-18 23:44:19,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-11-18 23:44:19,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:44:19,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 117 states. [2018-11-18 23:44:19,560 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 117 states. [2018-11-18 23:44:19,561 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 117 states. [2018-11-18 23:44:19,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:19,564 INFO L93 Difference]: Finished difference Result 117 states and 138 transitions. [2018-11-18 23:44:19,564 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 138 transitions. [2018-11-18 23:44:19,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:44:19,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:44:19,565 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 117 states. [2018-11-18 23:44:19,565 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 117 states. [2018-11-18 23:44:19,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:19,570 INFO L93 Difference]: Finished difference Result 117 states and 138 transitions. [2018-11-18 23:44:19,570 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 138 transitions. [2018-11-18 23:44:19,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:44:19,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:44:19,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:44:19,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:44:19,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-18 23:44:19,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 138 transitions. [2018-11-18 23:44:19,575 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 138 transitions. Word has length 31 [2018-11-18 23:44:19,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:44:19,575 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 138 transitions. [2018-11-18 23:44:19,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 23:44:19,575 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 138 transitions. [2018-11-18 23:44:19,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 23:44:19,576 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:44:19,576 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:44:19,576 INFO L423 AbstractCegarLoop]: === Iteration 6 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:44:19,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:44:19,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1496433235, now seen corresponding path program 1 times [2018-11-18 23:44:19,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:44:19,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:44:19,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:44:19,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:44:19,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:44:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:44:19,739 INFO L256 TraceCheckUtils]: 0: Hoare triple {3306#true} call ULTIMATE.init(); {3306#true} is VALID [2018-11-18 23:44:19,740 INFO L273 TraceCheckUtils]: 1: Hoare triple {3306#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3306#true} is VALID [2018-11-18 23:44:19,740 INFO L273 TraceCheckUtils]: 2: Hoare triple {3306#true} assume true; {3306#true} is VALID [2018-11-18 23:44:19,740 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3306#true} {3306#true} #455#return; {3306#true} is VALID [2018-11-18 23:44:19,740 INFO L256 TraceCheckUtils]: 4: Hoare triple {3306#true} call #t~ret44 := main(); {3306#true} is VALID [2018-11-18 23:44:19,741 INFO L273 TraceCheckUtils]: 5: Hoare triple {3306#true} ~data~0.base, ~data~0.offset := 0, 0; {3306#true} is VALID [2018-11-18 23:44:19,741 INFO L273 TraceCheckUtils]: 6: Hoare triple {3306#true} assume true; {3306#true} is VALID [2018-11-18 23:44:19,741 INFO L273 TraceCheckUtils]: 7: Hoare triple {3306#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {3306#true} is VALID [2018-11-18 23:44:19,750 INFO L273 TraceCheckUtils]: 8: Hoare triple {3306#true} assume !!(0 != #t~nondet36);havoc #t~nondet36;call #t~malloc37.base, #t~malloc37.offset := #Ultimate.alloc(8);~node~1.base, ~node~1.offset := #t~malloc37.base, #t~malloc37.offset; {3308#(not (= 0 main_~node~1.base))} is VALID [2018-11-18 23:44:19,757 INFO L273 TraceCheckUtils]: 9: Hoare triple {3308#(not (= 0 main_~node~1.base))} assume !(~node~1.base == 0 && ~node~1.offset == 0); {3308#(not (= 0 main_~node~1.base))} is VALID [2018-11-18 23:44:19,758 INFO L273 TraceCheckUtils]: 10: Hoare triple {3308#(not (= 0 main_~node~1.base))} call write~$Pointer$(~node~1.base, ~node~1.offset, ~node~1.base, ~node~1.offset, 4);assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;call write~int(#t~nondet38, ~node~1.base, 4 + ~node~1.offset, 4);havoc #t~nondet38;call #t~malloc39.base, #t~malloc39.offset := #Ultimate.alloc(8);~item~0.base, ~item~0.offset := #t~malloc39.base, #t~malloc39.offset; {3308#(not (= 0 main_~node~1.base))} is VALID [2018-11-18 23:44:19,758 INFO L273 TraceCheckUtils]: 11: Hoare triple {3308#(not (= 0 main_~node~1.base))} assume !(~item~0.base == 0 && ~item~0.offset == 0); {3308#(not (= 0 main_~node~1.base))} is VALID [2018-11-18 23:44:19,763 INFO L273 TraceCheckUtils]: 12: Hoare triple {3308#(not (= 0 main_~node~1.base))} call write~$Pointer$(~node~1.base, ~node~1.offset, ~item~0.base, ~item~0.offset, 4);call write~$Pointer$(~data~0.base, ~data~0.offset, ~item~0.base, 4 + ~item~0.offset, 4);~data~0.base, ~data~0.offset := ~item~0.base, ~item~0.offset; {3309#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2018-11-18 23:44:19,766 INFO L273 TraceCheckUtils]: 13: Hoare triple {3309#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} assume true; {3309#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2018-11-18 23:44:19,766 INFO L273 TraceCheckUtils]: 14: Hoare triple {3309#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {3309#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2018-11-18 23:44:19,767 INFO L273 TraceCheckUtils]: 15: Hoare triple {3309#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} assume !(0 != #t~nondet36);havoc #t~nondet36; {3309#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2018-11-18 23:44:19,767 INFO L273 TraceCheckUtils]: 16: Hoare triple {3309#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} assume !(~data~0.base == 0 && ~data~0.offset == 0); {3309#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2018-11-18 23:44:19,768 INFO L256 TraceCheckUtils]: 17: Hoare triple {3309#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} call inspect_before(~data~0.base, ~data~0.offset); {3310#(not (= 0 (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)))} is VALID [2018-11-18 23:44:19,768 INFO L273 TraceCheckUtils]: 18: Hoare triple {3310#(not (= 0 (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)))} ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-18 23:44:19,769 INFO L273 TraceCheckUtils]: 19: Hoare triple {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume true; {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-18 23:44:19,769 INFO L273 TraceCheckUtils]: 20: Hoare triple {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume !(~shape.base == 0 && ~shape.offset == 0); {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-18 23:44:19,770 INFO L273 TraceCheckUtils]: 21: Hoare triple {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume true; {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-18 23:44:19,770 INFO L273 TraceCheckUtils]: 22: Hoare triple {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume true;call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-18 23:44:19,771 INFO L273 TraceCheckUtils]: 23: Hoare triple {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume !(#t~mem25.base != 0 || #t~mem25.offset != 0);havoc #t~mem25.base, #t~mem25.offset; {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-18 23:44:19,771 INFO L273 TraceCheckUtils]: 24: Hoare triple {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume true; {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-18 23:44:19,772 INFO L273 TraceCheckUtils]: 25: Hoare triple {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume !(~shape.base == 0 && ~shape.offset == 0); {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-18 23:44:19,773 INFO L273 TraceCheckUtils]: 26: Hoare triple {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume true; {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-18 23:44:19,773 INFO L273 TraceCheckUtils]: 27: Hoare triple {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume true;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-18 23:44:19,774 INFO L273 TraceCheckUtils]: 28: Hoare triple {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume !!(#t~mem26.base == 0 && #t~mem26.offset == 0);havoc #t~mem26.base, #t~mem26.offset; {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-18 23:44:19,774 INFO L273 TraceCheckUtils]: 29: Hoare triple {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume true; {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-18 23:44:19,775 INFO L273 TraceCheckUtils]: 30: Hoare triple {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume true;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~shape.base, ~shape.offset, 4); {3312#(not (= 0 |inspect_before_#t~mem27.base|))} is VALID [2018-11-18 23:44:19,776 INFO L273 TraceCheckUtils]: 31: Hoare triple {3312#(not (= 0 |inspect_before_#t~mem27.base|))} assume #t~mem27.base == 0 && #t~mem27.offset == 0;havoc #t~mem27.base, #t~mem27.offset; {3307#false} is VALID [2018-11-18 23:44:19,776 INFO L256 TraceCheckUtils]: 32: Hoare triple {3307#false} call fail(); {3307#false} is VALID [2018-11-18 23:44:19,777 INFO L273 TraceCheckUtils]: 33: Hoare triple {3307#false} assume !false; {3307#false} is VALID [2018-11-18 23:44:19,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:44:19,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:44:19,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 23:44:19,781 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-11-18 23:44:19,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:44:19,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 23:44:19,828 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-18 23:44:19,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 23:44:19,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 23:44:19,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 23:44:19,829 INFO L87 Difference]: Start difference. First operand 117 states and 138 transitions. Second operand 7 states. [2018-11-18 23:44:21,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:21,158 INFO L93 Difference]: Finished difference Result 155 states and 181 transitions. [2018-11-18 23:44:21,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 23:44:21,158 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-11-18 23:44:21,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:44:21,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 23:44:21,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2018-11-18 23:44:21,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 23:44:21,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2018-11-18 23:44:21,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 181 transitions. [2018-11-18 23:44:21,866 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:44:21,873 INFO L225 Difference]: With dead ends: 155 [2018-11-18 23:44:21,873 INFO L226 Difference]: Without dead ends: 152 [2018-11-18 23:44:21,874 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-18 23:44:21,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-18 23:44:22,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 123. [2018-11-18 23:44:22,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:44:22,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 123 states. [2018-11-18 23:44:22,474 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 123 states. [2018-11-18 23:44:22,475 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 123 states. [2018-11-18 23:44:22,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:22,481 INFO L93 Difference]: Finished difference Result 152 states and 178 transitions. [2018-11-18 23:44:22,481 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 178 transitions. [2018-11-18 23:44:22,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:44:22,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:44:22,482 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 152 states. [2018-11-18 23:44:22,482 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 152 states. [2018-11-18 23:44:22,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:22,488 INFO L93 Difference]: Finished difference Result 152 states and 178 transitions. [2018-11-18 23:44:22,488 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 178 transitions. [2018-11-18 23:44:22,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:44:22,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:44:22,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:44:22,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:44:22,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-18 23:44:22,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 144 transitions. [2018-11-18 23:44:22,493 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 144 transitions. Word has length 34 [2018-11-18 23:44:22,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:44:22,493 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 144 transitions. [2018-11-18 23:44:22,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 23:44:22,493 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2018-11-18 23:44:22,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 23:44:22,494 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:44:22,494 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:44:22,494 INFO L423 AbstractCegarLoop]: === Iteration 7 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:44:22,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:44:22,495 INFO L82 PathProgramCache]: Analyzing trace with hash -408502051, now seen corresponding path program 1 times [2018-11-18 23:44:22,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:44:22,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:44:22,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:44:22,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:44:22,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:44:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:44:22,618 INFO L256 TraceCheckUtils]: 0: Hoare triple {3984#true} call ULTIMATE.init(); {3984#true} is VALID [2018-11-18 23:44:22,618 INFO L273 TraceCheckUtils]: 1: Hoare triple {3984#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3984#true} is VALID [2018-11-18 23:44:22,618 INFO L273 TraceCheckUtils]: 2: Hoare triple {3984#true} assume true; {3984#true} is VALID [2018-11-18 23:44:22,619 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3984#true} {3984#true} #455#return; {3984#true} is VALID [2018-11-18 23:44:22,619 INFO L256 TraceCheckUtils]: 4: Hoare triple {3984#true} call #t~ret44 := main(); {3984#true} is VALID [2018-11-18 23:44:22,619 INFO L273 TraceCheckUtils]: 5: Hoare triple {3984#true} ~data~0.base, ~data~0.offset := 0, 0; {3984#true} is VALID [2018-11-18 23:44:22,619 INFO L273 TraceCheckUtils]: 6: Hoare triple {3984#true} assume true; {3984#true} is VALID [2018-11-18 23:44:22,620 INFO L273 TraceCheckUtils]: 7: Hoare triple {3984#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {3984#true} is VALID [2018-11-18 23:44:22,620 INFO L273 TraceCheckUtils]: 8: Hoare triple {3984#true} assume !!(0 != #t~nondet36);havoc #t~nondet36;call #t~malloc37.base, #t~malloc37.offset := #Ultimate.alloc(8);~node~1.base, ~node~1.offset := #t~malloc37.base, #t~malloc37.offset; {3986#(not (= 0 main_~node~1.base))} is VALID [2018-11-18 23:44:22,621 INFO L273 TraceCheckUtils]: 9: Hoare triple {3986#(not (= 0 main_~node~1.base))} assume !(~node~1.base == 0 && ~node~1.offset == 0); {3986#(not (= 0 main_~node~1.base))} is VALID [2018-11-18 23:44:22,621 INFO L273 TraceCheckUtils]: 10: Hoare triple {3986#(not (= 0 main_~node~1.base))} call write~$Pointer$(~node~1.base, ~node~1.offset, ~node~1.base, ~node~1.offset, 4);assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;call write~int(#t~nondet38, ~node~1.base, 4 + ~node~1.offset, 4);havoc #t~nondet38;call #t~malloc39.base, #t~malloc39.offset := #Ultimate.alloc(8);~item~0.base, ~item~0.offset := #t~malloc39.base, #t~malloc39.offset; {3986#(not (= 0 main_~node~1.base))} is VALID [2018-11-18 23:44:22,622 INFO L273 TraceCheckUtils]: 11: Hoare triple {3986#(not (= 0 main_~node~1.base))} assume !(~item~0.base == 0 && ~item~0.offset == 0); {3986#(not (= 0 main_~node~1.base))} is VALID [2018-11-18 23:44:22,643 INFO L273 TraceCheckUtils]: 12: Hoare triple {3986#(not (= 0 main_~node~1.base))} call write~$Pointer$(~node~1.base, ~node~1.offset, ~item~0.base, ~item~0.offset, 4);call write~$Pointer$(~data~0.base, ~data~0.offset, ~item~0.base, 4 + ~item~0.offset, 4);~data~0.base, ~data~0.offset := ~item~0.base, ~item~0.offset; {3987#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2018-11-18 23:44:22,651 INFO L273 TraceCheckUtils]: 13: Hoare triple {3987#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} assume true; {3987#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2018-11-18 23:44:22,666 INFO L273 TraceCheckUtils]: 14: Hoare triple {3987#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {3987#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2018-11-18 23:44:22,673 INFO L273 TraceCheckUtils]: 15: Hoare triple {3987#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} assume !(0 != #t~nondet36);havoc #t~nondet36; {3987#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2018-11-18 23:44:22,673 INFO L273 TraceCheckUtils]: 16: Hoare triple {3987#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} assume !(~data~0.base == 0 && ~data~0.offset == 0); {3987#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2018-11-18 23:44:22,674 INFO L256 TraceCheckUtils]: 17: Hoare triple {3987#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} call inspect_before(~data~0.base, ~data~0.offset); {3988#(not (= 0 (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)))} is VALID [2018-11-18 23:44:22,675 INFO L273 TraceCheckUtils]: 18: Hoare triple {3988#(not (= 0 (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)))} ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-18 23:44:22,676 INFO L273 TraceCheckUtils]: 19: Hoare triple {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume true; {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-18 23:44:22,676 INFO L273 TraceCheckUtils]: 20: Hoare triple {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume !(~shape.base == 0 && ~shape.offset == 0); {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-18 23:44:22,679 INFO L273 TraceCheckUtils]: 21: Hoare triple {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume true; {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-18 23:44:22,679 INFO L273 TraceCheckUtils]: 22: Hoare triple {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume true;call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-18 23:44:22,680 INFO L273 TraceCheckUtils]: 23: Hoare triple {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume !!(#t~mem25.base != 0 || #t~mem25.offset != 0);havoc #t~mem25.base, #t~mem25.offset; {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-18 23:44:22,680 INFO L273 TraceCheckUtils]: 24: Hoare triple {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume true; {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-18 23:44:22,680 INFO L273 TraceCheckUtils]: 25: Hoare triple {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume !(~shape.base == 0 && ~shape.offset == 0); {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-18 23:44:22,681 INFO L273 TraceCheckUtils]: 26: Hoare triple {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume true; {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-18 23:44:22,681 INFO L273 TraceCheckUtils]: 27: Hoare triple {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume true;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-18 23:44:22,682 INFO L273 TraceCheckUtils]: 28: Hoare triple {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume !(#t~mem21.base == 0 && #t~mem21.offset == 0);havoc #t~mem21.base, #t~mem21.offset; {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-18 23:44:22,682 INFO L273 TraceCheckUtils]: 29: Hoare triple {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume true; {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-18 23:44:22,683 INFO L273 TraceCheckUtils]: 30: Hoare triple {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume true;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~shape.base, ~shape.offset, 4); {3990#(not (= 0 |inspect_before_#t~mem22.base|))} is VALID [2018-11-18 23:44:22,684 INFO L273 TraceCheckUtils]: 31: Hoare triple {3990#(not (= 0 |inspect_before_#t~mem22.base|))} assume #t~mem22.base == 0 && #t~mem22.offset == 0;havoc #t~mem22.base, #t~mem22.offset; {3985#false} is VALID [2018-11-18 23:44:22,684 INFO L256 TraceCheckUtils]: 32: Hoare triple {3985#false} call fail(); {3985#false} is VALID [2018-11-18 23:44:22,684 INFO L273 TraceCheckUtils]: 33: Hoare triple {3985#false} assume !false; {3985#false} is VALID [2018-11-18 23:44:22,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:44:22,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:44:22,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 23:44:22,687 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-11-18 23:44:22,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:44:22,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 23:44:22,717 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-18 23:44:22,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 23:44:22,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 23:44:22,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 23:44:22,718 INFO L87 Difference]: Start difference. First operand 123 states and 144 transitions. Second operand 7 states. [2018-11-18 23:44:23,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:23,871 INFO L93 Difference]: Finished difference Result 154 states and 179 transitions. [2018-11-18 23:44:23,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 23:44:23,871 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-11-18 23:44:23,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:44:23,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 23:44:23,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2018-11-18 23:44:23,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 23:44:23,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2018-11-18 23:44:23,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 179 transitions. [2018-11-18 23:44:24,096 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:44:24,101 INFO L225 Difference]: With dead ends: 154 [2018-11-18 23:44:24,101 INFO L226 Difference]: Without dead ends: 151 [2018-11-18 23:44:24,101 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-18 23:44:24,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-18 23:44:24,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 129. [2018-11-18 23:44:24,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:44:24,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand 129 states. [2018-11-18 23:44:24,195 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 129 states. [2018-11-18 23:44:24,195 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 129 states. [2018-11-18 23:44:24,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:24,202 INFO L93 Difference]: Finished difference Result 151 states and 176 transitions. [2018-11-18 23:44:24,202 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 176 transitions. [2018-11-18 23:44:24,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:44:24,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:44:24,203 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 151 states. [2018-11-18 23:44:24,203 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 151 states. [2018-11-18 23:44:24,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:24,209 INFO L93 Difference]: Finished difference Result 151 states and 176 transitions. [2018-11-18 23:44:24,209 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 176 transitions. [2018-11-18 23:44:24,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:44:24,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:44:24,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:44:24,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:44:24,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-18 23:44:24,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2018-11-18 23:44:24,215 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 34 [2018-11-18 23:44:24,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:44:24,215 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2018-11-18 23:44:24,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 23:44:24,216 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2018-11-18 23:44:24,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 23:44:24,217 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:44:24,217 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:44:24,217 INFO L423 AbstractCegarLoop]: === Iteration 8 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:44:24,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:44:24,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1691091992, now seen corresponding path program 1 times [2018-11-18 23:44:24,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:44:24,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:44:24,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:44:24,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:44:24,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:44:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 23:44:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 23:44:24,284 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 23:44:24,319 WARN L170 areAnnotationChecker]: failENTRY has no Hoare annotation [2018-11-18 23:44:24,319 WARN L170 areAnnotationChecker]: failENTRY has no Hoare annotation [2018-11-18 23:44:24,319 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-18 23:44:24,320 WARN L170 areAnnotationChecker]: merge_pairENTRY has no Hoare annotation [2018-11-18 23:44:24,320 WARN L170 areAnnotationChecker]: merge_single_nodeENTRY has no Hoare annotation [2018-11-18 23:44:24,320 WARN L170 areAnnotationChecker]: __bswap_32ENTRY has no Hoare annotation [2018-11-18 23:44:24,320 WARN L170 areAnnotationChecker]: seq_sort_coreENTRY has no Hoare annotation [2018-11-18 23:44:24,320 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-18 23:44:24,320 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-18 23:44:24,320 WARN L170 areAnnotationChecker]: __bswap_64ENTRY has no Hoare annotation [2018-11-18 23:44:24,321 WARN L170 areAnnotationChecker]: inspect_beforeENTRY has no Hoare annotation [2018-11-18 23:44:24,321 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-18 23:44:24,321 WARN L170 areAnnotationChecker]: inspect_afterENTRY has no Hoare annotation [2018-11-18 23:44:24,321 WARN L170 areAnnotationChecker]: failFINAL has no Hoare annotation [2018-11-18 23:44:24,321 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-18 23:44:24,321 WARN L170 areAnnotationChecker]: L581-1 has no Hoare annotation [2018-11-18 23:44:24,321 WARN L170 areAnnotationChecker]: L581-1 has no Hoare annotation [2018-11-18 23:44:24,322 WARN L170 areAnnotationChecker]: merge_single_nodeFINAL has no Hoare annotation [2018-11-18 23:44:24,322 WARN L170 areAnnotationChecker]: __bswap_32FINAL has no Hoare annotation [2018-11-18 23:44:24,322 WARN L170 areAnnotationChecker]: L587-3 has no Hoare annotation [2018-11-18 23:44:24,322 WARN L170 areAnnotationChecker]: L587-3 has no Hoare annotation [2018-11-18 23:44:24,322 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-18 23:44:24,322 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-18 23:44:24,322 WARN L170 areAnnotationChecker]: __bswap_64FINAL has no Hoare annotation [2018-11-18 23:44:24,322 WARN L170 areAnnotationChecker]: L604-6 has no Hoare annotation [2018-11-18 23:44:24,323 WARN L170 areAnnotationChecker]: L604-6 has no Hoare annotation [2018-11-18 23:44:24,323 WARN L170 areAnnotationChecker]: L628-4 has no Hoare annotation [2018-11-18 23:44:24,323 WARN L170 areAnnotationChecker]: L628-4 has no Hoare annotation [2018-11-18 23:44:24,323 WARN L170 areAnnotationChecker]: L618-6 has no Hoare annotation [2018-11-18 23:44:24,323 WARN L170 areAnnotationChecker]: L618-6 has no Hoare annotation [2018-11-18 23:44:24,323 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2018-11-18 23:44:24,323 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2018-11-18 23:44:24,323 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2018-11-18 23:44:24,324 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2018-11-18 23:44:24,324 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2018-11-18 23:44:24,324 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2018-11-18 23:44:24,324 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2018-11-18 23:44:24,324 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2018-11-18 23:44:24,324 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2018-11-18 23:44:24,324 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2018-11-18 23:44:24,324 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2018-11-18 23:44:24,325 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2018-11-18 23:44:24,325 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2018-11-18 23:44:24,325 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 23:44:24,325 WARN L170 areAnnotationChecker]: L577-1 has no Hoare annotation [2018-11-18 23:44:24,325 WARN L170 areAnnotationChecker]: L577-6 has no Hoare annotation [2018-11-18 23:44:24,325 WARN L170 areAnnotationChecker]: merge_single_nodeEXIT has no Hoare annotation [2018-11-18 23:44:24,325 WARN L170 areAnnotationChecker]: merge_single_nodeEXIT has no Hoare annotation [2018-11-18 23:44:24,325 WARN L170 areAnnotationChecker]: L587-1 has no Hoare annotation [2018-11-18 23:44:24,326 WARN L170 areAnnotationChecker]: L587-1 has no Hoare annotation [2018-11-18 23:44:24,326 WARN L170 areAnnotationChecker]: L587-4 has no Hoare annotation [2018-11-18 23:44:24,326 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 23:44:24,326 WARN L170 areAnnotationChecker]: L604-1 has no Hoare annotation [2018-11-18 23:44:24,326 WARN L170 areAnnotationChecker]: L604-1 has no Hoare annotation [2018-11-18 23:44:24,326 WARN L170 areAnnotationChecker]: L605-3 has no Hoare annotation [2018-11-18 23:44:24,326 WARN L170 areAnnotationChecker]: L605-3 has no Hoare annotation [2018-11-18 23:44:24,327 WARN L170 areAnnotationChecker]: L628-1 has no Hoare annotation [2018-11-18 23:44:24,327 WARN L170 areAnnotationChecker]: L628-5 has no Hoare annotation [2018-11-18 23:44:24,327 WARN L170 areAnnotationChecker]: L628-5 has no Hoare annotation [2018-11-18 23:44:24,327 WARN L170 areAnnotationChecker]: L618-1 has no Hoare annotation [2018-11-18 23:44:24,327 WARN L170 areAnnotationChecker]: L618-1 has no Hoare annotation [2018-11-18 23:44:24,327 WARN L170 areAnnotationChecker]: L619-5 has no Hoare annotation [2018-11-18 23:44:24,327 WARN L170 areAnnotationChecker]: L619-5 has no Hoare annotation [2018-11-18 23:44:24,327 WARN L170 areAnnotationChecker]: L604-4 has no Hoare annotation [2018-11-18 23:44:24,327 WARN L170 areAnnotationChecker]: L604-4 has no Hoare annotation [2018-11-18 23:44:24,328 WARN L170 areAnnotationChecker]: L606-4 has no Hoare annotation [2018-11-18 23:44:24,328 WARN L170 areAnnotationChecker]: L606-4 has no Hoare annotation [2018-11-18 23:44:24,328 WARN L170 areAnnotationChecker]: L607-3 has no Hoare annotation [2018-11-18 23:44:24,328 WARN L170 areAnnotationChecker]: L607-3 has no Hoare annotation [2018-11-18 23:44:24,328 WARN L170 areAnnotationChecker]: L608-3 has no Hoare annotation [2018-11-18 23:44:24,328 WARN L170 areAnnotationChecker]: L608-3 has no Hoare annotation [2018-11-18 23:44:24,328 WARN L170 areAnnotationChecker]: L609-3 has no Hoare annotation [2018-11-18 23:44:24,328 WARN L170 areAnnotationChecker]: L609-3 has no Hoare annotation [2018-11-18 23:44:24,329 WARN L170 areAnnotationChecker]: L611-3 has no Hoare annotation [2018-11-18 23:44:24,329 WARN L170 areAnnotationChecker]: L611-3 has no Hoare annotation [2018-11-18 23:44:24,329 WARN L170 areAnnotationChecker]: L612-3 has no Hoare annotation [2018-11-18 23:44:24,329 WARN L170 areAnnotationChecker]: L612-3 has no Hoare annotation [2018-11-18 23:44:24,329 WARN L170 areAnnotationChecker]: L613-3 has no Hoare annotation [2018-11-18 23:44:24,329 WARN L170 areAnnotationChecker]: L613-3 has no Hoare annotation [2018-11-18 23:44:24,329 WARN L170 areAnnotationChecker]: L614-3 has no Hoare annotation [2018-11-18 23:44:24,329 WARN L170 areAnnotationChecker]: L614-3 has no Hoare annotation [2018-11-18 23:44:24,330 WARN L170 areAnnotationChecker]: L618-4 has no Hoare annotation [2018-11-18 23:44:24,330 WARN L170 areAnnotationChecker]: L618-4 has no Hoare annotation [2018-11-18 23:44:24,330 WARN L170 areAnnotationChecker]: L619-3 has no Hoare annotation [2018-11-18 23:44:24,330 WARN L170 areAnnotationChecker]: L619-3 has no Hoare annotation [2018-11-18 23:44:24,330 WARN L170 areAnnotationChecker]: L620-3 has no Hoare annotation [2018-11-18 23:44:24,330 WARN L170 areAnnotationChecker]: L620-3 has no Hoare annotation [2018-11-18 23:44:24,330 WARN L170 areAnnotationChecker]: L623-3 has no Hoare annotation [2018-11-18 23:44:24,330 WARN L170 areAnnotationChecker]: L623-3 has no Hoare annotation [2018-11-18 23:44:24,331 WARN L170 areAnnotationChecker]: L577-2 has no Hoare annotation [2018-11-18 23:44:24,331 WARN L170 areAnnotationChecker]: L577-2 has no Hoare annotation [2018-11-18 23:44:24,331 WARN L170 areAnnotationChecker]: merge_pairFINAL has no Hoare annotation [2018-11-18 23:44:24,331 WARN L170 areAnnotationChecker]: L589 has no Hoare annotation [2018-11-18 23:44:24,331 WARN L170 areAnnotationChecker]: L589 has no Hoare annotation [2018-11-18 23:44:24,331 WARN L170 areAnnotationChecker]: seq_sort_coreFINAL has no Hoare annotation [2018-11-18 23:44:24,331 WARN L170 areAnnotationChecker]: L604-2 has no Hoare annotation [2018-11-18 23:44:24,331 WARN L170 areAnnotationChecker]: L604-2 has no Hoare annotation [2018-11-18 23:44:24,332 WARN L170 areAnnotationChecker]: L605 has no Hoare annotation [2018-11-18 23:44:24,332 WARN L170 areAnnotationChecker]: L605 has no Hoare annotation [2018-11-18 23:44:24,332 WARN L170 areAnnotationChecker]: L611-5 has no Hoare annotation [2018-11-18 23:44:24,332 WARN L170 areAnnotationChecker]: L611-5 has no Hoare annotation [2018-11-18 23:44:24,332 WARN L170 areAnnotationChecker]: L628-2 has no Hoare annotation [2018-11-18 23:44:24,332 WARN L170 areAnnotationChecker]: L628-2 has no Hoare annotation [2018-11-18 23:44:24,332 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 23:44:24,332 WARN L170 areAnnotationChecker]: L643 has no Hoare annotation [2018-11-18 23:44:24,333 WARN L170 areAnnotationChecker]: L643 has no Hoare annotation [2018-11-18 23:44:24,333 WARN L170 areAnnotationChecker]: L618-2 has no Hoare annotation [2018-11-18 23:44:24,333 WARN L170 areAnnotationChecker]: L618-2 has no Hoare annotation [2018-11-18 23:44:24,333 WARN L170 areAnnotationChecker]: L619 has no Hoare annotation [2018-11-18 23:44:24,333 WARN L170 areAnnotationChecker]: L619 has no Hoare annotation [2018-11-18 23:44:24,333 WARN L170 areAnnotationChecker]: L620-5 has no Hoare annotation [2018-11-18 23:44:24,333 WARN L170 areAnnotationChecker]: L620-5 has no Hoare annotation [2018-11-18 23:44:24,333 WARN L170 areAnnotationChecker]: L607-5 has no Hoare annotation [2018-11-18 23:44:24,334 WARN L170 areAnnotationChecker]: L607-5 has no Hoare annotation [2018-11-18 23:44:24,334 WARN L170 areAnnotationChecker]: L606-6 has no Hoare annotation [2018-11-18 23:44:24,334 WARN L170 areAnnotationChecker]: L606-6 has no Hoare annotation [2018-11-18 23:44:24,334 WARN L170 areAnnotationChecker]: L608-5 has no Hoare annotation [2018-11-18 23:44:24,334 WARN L170 areAnnotationChecker]: L608-5 has no Hoare annotation [2018-11-18 23:44:24,334 WARN L170 areAnnotationChecker]: L609-5 has no Hoare annotation [2018-11-18 23:44:24,334 WARN L170 areAnnotationChecker]: L609-5 has no Hoare annotation [2018-11-18 23:44:24,334 WARN L170 areAnnotationChecker]: L605-2 has no Hoare annotation [2018-11-18 23:44:24,335 WARN L170 areAnnotationChecker]: L612-5 has no Hoare annotation [2018-11-18 23:44:24,335 WARN L170 areAnnotationChecker]: L612-5 has no Hoare annotation [2018-11-18 23:44:24,335 WARN L170 areAnnotationChecker]: L613-5 has no Hoare annotation [2018-11-18 23:44:24,335 WARN L170 areAnnotationChecker]: L613-5 has no Hoare annotation [2018-11-18 23:44:24,335 WARN L170 areAnnotationChecker]: L614-5 has no Hoare annotation [2018-11-18 23:44:24,335 WARN L170 areAnnotationChecker]: L614-5 has no Hoare annotation [2018-11-18 23:44:24,335 WARN L170 areAnnotationChecker]: L614-6 has no Hoare annotation [2018-11-18 23:44:24,335 WARN L170 areAnnotationChecker]: L620-6 has no Hoare annotation [2018-11-18 23:44:24,336 WARN L170 areAnnotationChecker]: L623-6 has no Hoare annotation [2018-11-18 23:44:24,336 WARN L170 areAnnotationChecker]: L623-5 has no Hoare annotation [2018-11-18 23:44:24,336 WARN L170 areAnnotationChecker]: L623-5 has no Hoare annotation [2018-11-18 23:44:24,336 WARN L170 areAnnotationChecker]: L577-4 has no Hoare annotation [2018-11-18 23:44:24,336 WARN L170 areAnnotationChecker]: L577-4 has no Hoare annotation [2018-11-18 23:44:24,336 WARN L170 areAnnotationChecker]: merge_pairEXIT has no Hoare annotation [2018-11-18 23:44:24,336 WARN L170 areAnnotationChecker]: L594 has no Hoare annotation [2018-11-18 23:44:24,337 WARN L170 areAnnotationChecker]: L594 has no Hoare annotation [2018-11-18 23:44:24,337 WARN L170 areAnnotationChecker]: seq_sort_coreEXIT has no Hoare annotation [2018-11-18 23:44:24,337 WARN L170 areAnnotationChecker]: L611 has no Hoare annotation [2018-11-18 23:44:24,337 WARN L170 areAnnotationChecker]: L611 has no Hoare annotation [2018-11-18 23:44:24,337 WARN L170 areAnnotationChecker]: L630 has no Hoare annotation [2018-11-18 23:44:24,337 WARN L170 areAnnotationChecker]: L630 has no Hoare annotation [2018-11-18 23:44:24,337 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-18 23:44:24,337 WARN L170 areAnnotationChecker]: L644-3 has no Hoare annotation [2018-11-18 23:44:24,338 WARN L170 areAnnotationChecker]: L644-3 has no Hoare annotation [2018-11-18 23:44:24,338 WARN L170 areAnnotationChecker]: L619-1 has no Hoare annotation [2018-11-18 23:44:24,338 WARN L170 areAnnotationChecker]: L619-1 has no Hoare annotation [2018-11-18 23:44:24,338 WARN L170 areAnnotationChecker]: L620 has no Hoare annotation [2018-11-18 23:44:24,338 WARN L170 areAnnotationChecker]: L620 has no Hoare annotation [2018-11-18 23:44:24,338 WARN L170 areAnnotationChecker]: L607 has no Hoare annotation [2018-11-18 23:44:24,338 WARN L170 areAnnotationChecker]: L607 has no Hoare annotation [2018-11-18 23:44:24,338 WARN L170 areAnnotationChecker]: L606-1 has no Hoare annotation [2018-11-18 23:44:24,339 WARN L170 areAnnotationChecker]: L606-1 has no Hoare annotation [2018-11-18 23:44:24,339 WARN L170 areAnnotationChecker]: L608 has no Hoare annotation [2018-11-18 23:44:24,339 WARN L170 areAnnotationChecker]: L608 has no Hoare annotation [2018-11-18 23:44:24,339 WARN L170 areAnnotationChecker]: L609 has no Hoare annotation [2018-11-18 23:44:24,339 WARN L170 areAnnotationChecker]: L609 has no Hoare annotation [2018-11-18 23:44:24,339 WARN L170 areAnnotationChecker]: L612 has no Hoare annotation [2018-11-18 23:44:24,339 WARN L170 areAnnotationChecker]: L612 has no Hoare annotation [2018-11-18 23:44:24,339 WARN L170 areAnnotationChecker]: L613 has no Hoare annotation [2018-11-18 23:44:24,340 WARN L170 areAnnotationChecker]: L613 has no Hoare annotation [2018-11-18 23:44:24,340 WARN L170 areAnnotationChecker]: L614 has no Hoare annotation [2018-11-18 23:44:24,340 WARN L170 areAnnotationChecker]: L614 has no Hoare annotation [2018-11-18 23:44:24,340 WARN L170 areAnnotationChecker]: inspect_beforeEXIT has no Hoare annotation [2018-11-18 23:44:24,340 WARN L170 areAnnotationChecker]: L622-4 has no Hoare annotation [2018-11-18 23:44:24,340 WARN L170 areAnnotationChecker]: L622-4 has no Hoare annotation [2018-11-18 23:44:24,340 WARN L170 areAnnotationChecker]: inspect_afterEXIT has no Hoare annotation [2018-11-18 23:44:24,340 WARN L170 areAnnotationChecker]: L623 has no Hoare annotation [2018-11-18 23:44:24,341 WARN L170 areAnnotationChecker]: L623 has no Hoare annotation [2018-11-18 23:44:24,341 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2018-11-18 23:44:24,341 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2018-11-18 23:44:24,341 WARN L170 areAnnotationChecker]: L594-1 has no Hoare annotation [2018-11-18 23:44:24,341 WARN L170 areAnnotationChecker]: L645-1 has no Hoare annotation [2018-11-18 23:44:24,341 WARN L170 areAnnotationChecker]: L611-1 has no Hoare annotation [2018-11-18 23:44:24,341 WARN L170 areAnnotationChecker]: L611-1 has no Hoare annotation [2018-11-18 23:44:24,341 WARN L170 areAnnotationChecker]: L630-2 has no Hoare annotation [2018-11-18 23:44:24,342 WARN L170 areAnnotationChecker]: L644 has no Hoare annotation [2018-11-18 23:44:24,342 WARN L170 areAnnotationChecker]: L644-4 has no Hoare annotation [2018-11-18 23:44:24,342 WARN L170 areAnnotationChecker]: L644-4 has no Hoare annotation [2018-11-18 23:44:24,342 WARN L170 areAnnotationChecker]: L620-1 has no Hoare annotation [2018-11-18 23:44:24,342 WARN L170 areAnnotationChecker]: L620-1 has no Hoare annotation [2018-11-18 23:44:24,342 WARN L170 areAnnotationChecker]: L607-1 has no Hoare annotation [2018-11-18 23:44:24,342 WARN L170 areAnnotationChecker]: L607-1 has no Hoare annotation [2018-11-18 23:44:24,342 WARN L170 areAnnotationChecker]: L606-2 has no Hoare annotation [2018-11-18 23:44:24,343 WARN L170 areAnnotationChecker]: L606-2 has no Hoare annotation [2018-11-18 23:44:24,343 WARN L170 areAnnotationChecker]: L608-1 has no Hoare annotation [2018-11-18 23:44:24,343 WARN L170 areAnnotationChecker]: L608-1 has no Hoare annotation [2018-11-18 23:44:24,343 WARN L170 areAnnotationChecker]: L609-1 has no Hoare annotation [2018-11-18 23:44:24,343 WARN L170 areAnnotationChecker]: L609-1 has no Hoare annotation [2018-11-18 23:44:24,343 WARN L170 areAnnotationChecker]: L612-1 has no Hoare annotation [2018-11-18 23:44:24,343 WARN L170 areAnnotationChecker]: L612-1 has no Hoare annotation [2018-11-18 23:44:24,343 WARN L170 areAnnotationChecker]: L613-1 has no Hoare annotation [2018-11-18 23:44:24,344 WARN L170 areAnnotationChecker]: L613-1 has no Hoare annotation [2018-11-18 23:44:24,344 WARN L170 areAnnotationChecker]: L614-1 has no Hoare annotation [2018-11-18 23:44:24,344 WARN L170 areAnnotationChecker]: L614-1 has no Hoare annotation [2018-11-18 23:44:24,344 WARN L170 areAnnotationChecker]: L622-1 has no Hoare annotation [2018-11-18 23:44:24,344 WARN L170 areAnnotationChecker]: L622-1 has no Hoare annotation [2018-11-18 23:44:24,344 WARN L170 areAnnotationChecker]: L646 has no Hoare annotation [2018-11-18 23:44:24,344 WARN L170 areAnnotationChecker]: L623-1 has no Hoare annotation [2018-11-18 23:44:24,344 WARN L170 areAnnotationChecker]: L623-1 has no Hoare annotation [2018-11-18 23:44:24,345 WARN L170 areAnnotationChecker]: L578-5 has no Hoare annotation [2018-11-18 23:44:24,345 WARN L170 areAnnotationChecker]: L578-5 has no Hoare annotation [2018-11-18 23:44:24,345 WARN L170 areAnnotationChecker]: L578-2 has no Hoare annotation [2018-11-18 23:44:24,345 WARN L170 areAnnotationChecker]: L578-2 has no Hoare annotation [2018-11-18 23:44:24,345 WARN L170 areAnnotationChecker]: L635 has no Hoare annotation [2018-11-18 23:44:24,345 WARN L170 areAnnotationChecker]: L635 has no Hoare annotation [2018-11-18 23:44:24,345 WARN L170 areAnnotationChecker]: L644-1 has no Hoare annotation [2018-11-18 23:44:24,345 WARN L170 areAnnotationChecker]: L644-1 has no Hoare annotation [2018-11-18 23:44:24,346 WARN L170 areAnnotationChecker]: L622-3 has no Hoare annotation [2018-11-18 23:44:24,346 WARN L170 areAnnotationChecker]: L649-3 has no Hoare annotation [2018-11-18 23:44:24,346 WARN L170 areAnnotationChecker]: L649-3 has no Hoare annotation [2018-11-18 23:44:24,346 WARN L170 areAnnotationChecker]: L579 has no Hoare annotation [2018-11-18 23:44:24,346 WARN L170 areAnnotationChecker]: L579 has no Hoare annotation [2018-11-18 23:44:24,346 WARN L170 areAnnotationChecker]: L581 has no Hoare annotation [2018-11-18 23:44:24,346 WARN L170 areAnnotationChecker]: L581 has no Hoare annotation [2018-11-18 23:44:24,346 WARN L170 areAnnotationChecker]: L578-4 has no Hoare annotation [2018-11-18 23:44:24,347 WARN L170 areAnnotationChecker]: L635-2 has no Hoare annotation [2018-11-18 23:44:24,347 WARN L170 areAnnotationChecker]: L645 has no Hoare annotation [2018-11-18 23:44:24,347 WARN L170 areAnnotationChecker]: L645 has no Hoare annotation [2018-11-18 23:44:24,347 WARN L170 areAnnotationChecker]: L649-1 has no Hoare annotation [2018-11-18 23:44:24,347 WARN L170 areAnnotationChecker]: L649-1 has no Hoare annotation [2018-11-18 23:44:24,347 WARN L170 areAnnotationChecker]: L649-4 has no Hoare annotation [2018-11-18 23:44:24,347 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-18 23:44:24,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:44:24 BoogieIcfgContainer [2018-11-18 23:44:24,350 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 23:44:24,352 INFO L168 Benchmark]: Toolchain (without parser) took 16198.60 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 863.5 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -165.8 MB). Peak memory consumption was 697.7 MB. Max. memory is 7.1 GB. [2018-11-18 23:44:24,354 INFO L168 Benchmark]: CDTParser took 0.20 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-18 23:44:24,354 INFO L168 Benchmark]: CACSL2BoogieTranslator took 662.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-11-18 23:44:24,355 INFO L168 Benchmark]: Boogie Preprocessor took 189.37 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -834.6 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. [2018-11-18 23:44:24,356 INFO L168 Benchmark]: RCFGBuilder took 1961.89 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: 100.1 MB). Peak memory consumption was 100.1 MB. Max. memory is 7.1 GB. [2018-11-18 23:44:24,357 INFO L168 Benchmark]: TraceAbstraction took 13380.41 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 129.0 MB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 526.4 MB). Peak memory consumption was 655.4 MB. Max. memory is 7.1 GB. [2018-11-18 23:44:24,362 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 662.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 189.37 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -834.6 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1961.89 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: 100.1 MB). Peak memory consumption was 100.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13380.41 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 129.0 MB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 526.4 MB). Peak memory consumption was 655.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 554]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L627] struct list *data = ((void *)0); VAL [data={0:0}] [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); VAL [data={0:0}, malloc(sizeof *node)={11:0}, node={11:0}] [L630] COND FALSE !(!node) VAL [data={0:0}, malloc(sizeof *node)={11:0}, node={11:0}] [L632] FCALL node->next = node [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); VAL [data={0:0}, item={10:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *node)={11:0}, node={11:0}] [L635] COND FALSE !(!item) VAL [data={0:0}, item={10:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *node)={11:0}, node={11:0}] [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item VAL [data={10:0}, item={10:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *node)={11:0}, node={11:0}] [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) VAL [data={10:0}, item={10:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *node)={11:0}, node={11:0}] [L643] CALL inspect_before(data) VAL [shape={10:0}] [L604] COND FALSE !(!(shape)) VAL [shape={10:0}, shape={10:0}] [L604] COND FALSE !(0) VAL [shape={10:0}, shape={10:0}] [L605] FCALL shape->next VAL [shape={10:0}, shape={10:0}, shape->next={0:0}] [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) VAL [shape={10:0}, shape={10:0}] [L611] COND FALSE !(0) VAL [shape={10:0}, shape={10:0}] [L612] EXPR, FCALL shape->next VAL [shape={10:0}, shape={10:0}, shape->next={0:0}] [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) VAL [shape={10:0}, shape={10:0}] [L613] EXPR, FCALL shape->slist VAL [shape={10:0}, shape={10:0}, shape->slist={11:0}] [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) VAL [shape={10:0}, shape={10:0}] [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next VAL [shape={10:0}, shape={10:0}, shape->slist={11:0}, shape->slist->next={11:0}] [L614] COND TRUE !(shape->slist->next == ((void *)0)) [L614] CALL fail() [L554] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 130 locations, 1 error locations. UNSAFE Result, 13.2s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 10.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 870 SDtfs, 385 SDslu, 2015 SDs, 0 SdLazy, 624 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 94 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 220 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 176 ConstructedInterpolants, 0 QuantifiedInterpolants, 21242 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 15/15 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...