/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-properties/list_flag-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:04:56,141 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:04:56,144 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:04:56,156 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:04:56,157 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:04:56,158 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:04:56,159 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:04:56,161 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:04:56,162 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:04:56,166 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:04:56,166 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:04:56,167 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:04:56,167 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:04:56,168 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:04:56,169 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:04:56,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:04:56,171 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:04:56,172 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:04:56,174 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:04:56,176 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:04:56,177 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:04:56,178 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:04:56,179 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:04:56,180 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:04:56,183 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:04:56,183 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:04:56,183 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:04:56,184 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:04:56,185 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:04:56,186 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:04:56,186 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:04:56,187 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:04:56,187 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:04:56,188 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:04:56,189 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:04:56,189 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:04:56,190 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:04:56,190 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:04:56,191 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:04:56,192 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:04:56,192 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:04:56,193 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:04:56,212 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:04:56,212 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:04:56,213 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:04:56,215 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:04:56,215 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:04:56,215 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:04:56,215 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:04:56,215 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:04:56,216 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:04:56,216 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:04:56,216 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:04:56,217 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:04:56,217 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:04:56,217 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:04:56,217 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:04:56,218 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:04:56,218 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:04:56,218 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:04:56,218 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:04:56,218 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:04:56,219 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:04:56,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:04:56,219 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:04:56,220 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:04:56,220 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:04:56,220 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:04:56,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:04:56,221 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:04:56,221 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:04:56,221 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:04:56,496 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:04:56,514 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:04:56,516 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:04:56,517 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:04:56,518 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:04:56,518 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list_flag-1.i [2020-07-10 15:04:56,583 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd687d5cb/72a472140af849c8b9d5fd338139e129/FLAGa37d72ece [2020-07-10 15:04:57,099 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:04:57,100 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list_flag-1.i [2020-07-10 15:04:57,114 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd687d5cb/72a472140af849c8b9d5fd338139e129/FLAGa37d72ece [2020-07-10 15:04:57,369 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd687d5cb/72a472140af849c8b9d5fd338139e129 [2020-07-10 15:04:57,377 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:04:57,379 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:04:57,380 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:04:57,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:04:57,384 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:04:57,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:04:57" (1/1) ... [2020-07-10 15:04:57,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49c6cd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:57, skipping insertion in model container [2020-07-10 15:04:57,389 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:04:57" (1/1) ... [2020-07-10 15:04:57,396 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:04:57,444 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:04:57,828 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:04:57,839 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:04:57,930 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:04:58,006 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:04:58,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:58 WrapperNode [2020-07-10 15:04:58,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:04:58,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:04:58,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:04:58,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:04:58,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:58" (1/1) ... [2020-07-10 15:04:58,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:58" (1/1) ... [2020-07-10 15:04:58,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:58" (1/1) ... [2020-07-10 15:04:58,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:58" (1/1) ... [2020-07-10 15:04:58,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:58" (1/1) ... [2020-07-10 15:04:58,064 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:58" (1/1) ... [2020-07-10 15:04:58,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:58" (1/1) ... [2020-07-10 15:04:58,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:04:58,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:04:58,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:04:58,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:04:58,076 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:58" (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 [2020-07-10 15:04:58,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:04:58,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:04:58,135 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-10 15:04:58,135 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-10 15:04:58,135 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-07-10 15:04:58,135 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-07-10 15:04:58,135 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-07-10 15:04:58,136 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-10 15:04:58,136 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:04:58,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:04:58,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:04:58,136 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-10 15:04:58,136 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-10 15:04:58,137 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-10 15:04:58,137 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-10 15:04:58,137 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-10 15:04:58,137 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-10 15:04:58,137 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-10 15:04:58,137 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-10 15:04:58,138 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-10 15:04:58,138 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-10 15:04:58,138 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-10 15:04:58,138 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-10 15:04:58,138 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-10 15:04:58,138 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-10 15:04:58,138 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-10 15:04:58,139 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-10 15:04:58,139 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-10 15:04:58,139 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-10 15:04:58,139 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-07-10 15:04:58,139 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-07-10 15:04:58,139 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-07-10 15:04:58,139 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-10 15:04:58,140 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-10 15:04:58,140 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-10 15:04:58,140 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-10 15:04:58,140 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-10 15:04:58,140 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-10 15:04:58,140 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-10 15:04:58,141 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-10 15:04:58,141 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-10 15:04:58,141 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-10 15:04:58,141 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-10 15:04:58,141 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-10 15:04:58,141 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-10 15:04:58,141 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-10 15:04:58,142 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-10 15:04:58,142 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-10 15:04:58,142 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-10 15:04:58,142 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-10 15:04:58,142 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-10 15:04:58,142 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-10 15:04:58,143 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-10 15:04:58,143 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-10 15:04:58,143 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-10 15:04:58,143 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-10 15:04:58,143 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-10 15:04:58,143 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-10 15:04:58,143 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-10 15:04:58,144 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-10 15:04:58,144 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-10 15:04:58,144 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-10 15:04:58,144 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-10 15:04:58,144 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-10 15:04:58,144 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-10 15:04:58,145 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-10 15:04:58,145 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:04:58,145 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-10 15:04:58,145 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-10 15:04:58,145 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-10 15:04:58,145 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-10 15:04:58,145 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-10 15:04:58,146 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-10 15:04:58,146 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-10 15:04:58,146 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:04:58,146 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-10 15:04:58,146 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-10 15:04:58,146 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-10 15:04:58,146 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-10 15:04:58,147 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-10 15:04:58,147 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-10 15:04:58,147 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-10 15:04:58,147 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-10 15:04:58,147 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-10 15:04:58,148 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-10 15:04:58,148 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-10 15:04:58,148 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-10 15:04:58,148 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-10 15:04:58,148 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-10 15:04:58,148 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-10 15:04:58,149 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-10 15:04:58,149 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-10 15:04:58,149 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-10 15:04:58,149 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-10 15:04:58,149 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-10 15:04:58,149 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-10 15:04:58,149 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-10 15:04:58,150 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-10 15:04:58,150 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-10 15:04:58,150 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-10 15:04:58,150 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-10 15:04:58,150 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-10 15:04:58,150 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-10 15:04:58,151 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-10 15:04:58,151 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-10 15:04:58,151 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-10 15:04:58,151 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-10 15:04:58,151 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-10 15:04:58,151 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-10 15:04:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-10 15:04:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-10 15:04:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-10 15:04:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-10 15:04:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-10 15:04:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-10 15:04:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-10 15:04:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-10 15:04:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-10 15:04:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-10 15:04:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:04:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:04:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:04:58,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 15:04:58,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 15:04:58,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:04:58,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:04:58,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:04:58,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:04:58,506 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-10 15:04:58,739 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:04:58,740 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 15:04:58,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:04:58 BoogieIcfgContainer [2020-07-10 15:04:58,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:04:58,748 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:04:58,748 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:04:58,751 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:04:58,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:04:57" (1/3) ... [2020-07-10 15:04:58,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726256da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:04:58, skipping insertion in model container [2020-07-10 15:04:58,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:58" (2/3) ... [2020-07-10 15:04:58,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726256da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:04:58, skipping insertion in model container [2020-07-10 15:04:58,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:04:58" (3/3) ... [2020-07-10 15:04:58,762 INFO L109 eAbstractionObserver]: Analyzing ICFG list_flag-1.i [2020-07-10 15:04:58,774 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:04:58,792 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:04:58,807 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:04:58,839 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:04:58,839 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:04:58,839 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:04:58,839 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:04:58,840 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:04:58,840 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:04:58,840 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:04:58,840 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:04:58,868 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2020-07-10 15:04:58,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-10 15:04:58,876 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:58,877 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:58,878 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:58,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:58,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1184417696, now seen corresponding path program 1 times [2020-07-10 15:04:58,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:58,899 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119935755] [2020-07-10 15:04:58,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:59,116 INFO L280 TraceCheckUtils]: 0: Hoare triple {40#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {35#true} is VALID [2020-07-10 15:04:59,116 INFO L280 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2020-07-10 15:04:59,117 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #105#return; {35#true} is VALID [2020-07-10 15:04:59,122 INFO L263 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {40#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:04:59,122 INFO L280 TraceCheckUtils]: 1: Hoare triple {40#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {35#true} is VALID [2020-07-10 15:04:59,123 INFO L280 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2020-07-10 15:04:59,123 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #105#return; {35#true} is VALID [2020-07-10 15:04:59,124 INFO L263 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret12 := main(); {35#true} is VALID [2020-07-10 15:04:59,124 INFO L280 TraceCheckUtils]: 5: Hoare triple {35#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~flag~0 := #t~nondet2;havoc #t~nondet2;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc3.base, #t~malloc3.offset; {35#true} is VALID [2020-07-10 15:04:59,125 INFO L280 TraceCheckUtils]: 6: Hoare triple {35#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {35#true} is VALID [2020-07-10 15:04:59,125 INFO L280 TraceCheckUtils]: 7: Hoare triple {35#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {35#true} is VALID [2020-07-10 15:04:59,127 INFO L280 TraceCheckUtils]: 8: Hoare triple {35#true} assume !true; {36#false} is VALID [2020-07-10 15:04:59,127 INFO L280 TraceCheckUtils]: 9: Hoare triple {36#false} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {36#false} is VALID [2020-07-10 15:04:59,127 INFO L280 TraceCheckUtils]: 10: Hoare triple {36#false} assume !(0 != ~flag~0); {36#false} is VALID [2020-07-10 15:04:59,128 INFO L280 TraceCheckUtils]: 11: Hoare triple {36#false} assume !true; {36#false} is VALID [2020-07-10 15:04:59,128 INFO L280 TraceCheckUtils]: 12: Hoare triple {36#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {36#false} is VALID [2020-07-10 15:04:59,128 INFO L280 TraceCheckUtils]: 13: Hoare triple {36#false} assume 3 != #t~mem11;havoc #t~mem11; {36#false} is VALID [2020-07-10 15:04:59,129 INFO L280 TraceCheckUtils]: 14: Hoare triple {36#false} assume !false; {36#false} is VALID [2020-07-10 15:04:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:04:59,132 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119935755] [2020-07-10 15:04:59,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:59,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:59,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019053644] [2020-07-10 15:04:59,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-10 15:04:59,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:59,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:59,185 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:59,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:59,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:59,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:59,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:59,226 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2020-07-10 15:04:59,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:59,409 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2020-07-10 15:04:59,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:59,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-10 15:04:59,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:59,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:59,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2020-07-10 15:04:59,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:59,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2020-07-10 15:04:59,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2020-07-10 15:04:59,545 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:59,559 INFO L225 Difference]: With dead ends: 46 [2020-07-10 15:04:59,559 INFO L226 Difference]: Without dead ends: 24 [2020-07-10 15:04:59,562 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:59,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-10 15:04:59,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-10 15:04:59,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:59,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-10 15:04:59,603 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-10 15:04:59,604 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-10 15:04:59,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:59,608 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-07-10 15:04:59,608 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-10 15:04:59,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:59,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:59,609 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-10 15:04:59,609 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-10 15:04:59,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:59,613 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-07-10 15:04:59,613 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-10 15:04:59,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:59,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:59,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:59,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:59,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-10 15:04:59,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2020-07-10 15:04:59,618 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 15 [2020-07-10 15:04:59,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:59,619 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-07-10 15:04:59,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:59,619 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-10 15:04:59,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 15:04:59,620 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:59,620 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:59,620 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:04:59,621 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:59,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:59,621 INFO L82 PathProgramCache]: Analyzing trace with hash -218242506, now seen corresponding path program 1 times [2020-07-10 15:04:59,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:59,622 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761449743] [2020-07-10 15:04:59,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:59,751 INFO L280 TraceCheckUtils]: 0: Hoare triple {189#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {181#true} is VALID [2020-07-10 15:04:59,751 INFO L280 TraceCheckUtils]: 1: Hoare triple {181#true} assume true; {181#true} is VALID [2020-07-10 15:04:59,751 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {181#true} {181#true} #105#return; {181#true} is VALID [2020-07-10 15:04:59,753 INFO L263 TraceCheckUtils]: 0: Hoare triple {181#true} call ULTIMATE.init(); {189#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:04:59,753 INFO L280 TraceCheckUtils]: 1: Hoare triple {189#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {181#true} is VALID [2020-07-10 15:04:59,753 INFO L280 TraceCheckUtils]: 2: Hoare triple {181#true} assume true; {181#true} is VALID [2020-07-10 15:04:59,754 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {181#true} {181#true} #105#return; {181#true} is VALID [2020-07-10 15:04:59,754 INFO L263 TraceCheckUtils]: 4: Hoare triple {181#true} call #t~ret12 := main(); {181#true} is VALID [2020-07-10 15:04:59,754 INFO L280 TraceCheckUtils]: 5: Hoare triple {181#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~flag~0 := #t~nondet2;havoc #t~nondet2;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc3.base, #t~malloc3.offset; {181#true} is VALID [2020-07-10 15:04:59,755 INFO L280 TraceCheckUtils]: 6: Hoare triple {181#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {181#true} is VALID [2020-07-10 15:04:59,756 INFO L280 TraceCheckUtils]: 7: Hoare triple {181#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {186#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-10 15:04:59,757 INFO L280 TraceCheckUtils]: 8: Hoare triple {186#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {186#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-10 15:04:59,758 INFO L280 TraceCheckUtils]: 9: Hoare triple {186#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet4);havoc #t~nondet4; {186#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-10 15:04:59,759 INFO L280 TraceCheckUtils]: 10: Hoare triple {186#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {187#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-10 15:04:59,760 INFO L280 TraceCheckUtils]: 11: Hoare triple {187#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(0 != ~flag~0); {187#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-10 15:04:59,761 INFO L280 TraceCheckUtils]: 12: Hoare triple {187#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {187#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-10 15:04:59,761 INFO L280 TraceCheckUtils]: 13: Hoare triple {187#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(1 == #t~mem9);havoc #t~mem9; {187#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-10 15:04:59,762 INFO L280 TraceCheckUtils]: 14: Hoare triple {187#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {188#(= |main_#t~mem11| 3)} is VALID [2020-07-10 15:04:59,763 INFO L280 TraceCheckUtils]: 15: Hoare triple {188#(= |main_#t~mem11| 3)} assume 3 != #t~mem11;havoc #t~mem11; {182#false} is VALID [2020-07-10 15:04:59,763 INFO L280 TraceCheckUtils]: 16: Hoare triple {182#false} assume !false; {182#false} is VALID [2020-07-10 15:04:59,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:04:59,766 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761449743] [2020-07-10 15:04:59,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:59,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:04:59,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944556961] [2020-07-10 15:04:59,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-10 15:04:59,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:59,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:04:59,792 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:59,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:04:59,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:59,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:04:59,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:04:59,793 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 6 states. [2020-07-10 15:05:00,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:00,144 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2020-07-10 15:05:00,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:05:00,144 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-10 15:05:00,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:05:00,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:05:00,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2020-07-10 15:05:00,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:05:00,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2020-07-10 15:05:00,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2020-07-10 15:05:00,236 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:05:00,238 INFO L225 Difference]: With dead ends: 48 [2020-07-10 15:05:00,238 INFO L226 Difference]: Without dead ends: 44 [2020-07-10 15:05:00,240 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:05:00,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-10 15:05:00,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2020-07-10 15:05:00,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:05:00,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 32 states. [2020-07-10 15:05:00,262 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 32 states. [2020-07-10 15:05:00,262 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 32 states. [2020-07-10 15:05:00,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:00,266 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2020-07-10 15:05:00,266 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2020-07-10 15:05:00,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:00,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:00,269 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 44 states. [2020-07-10 15:05:00,269 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 44 states. [2020-07-10 15:05:00,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:00,273 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2020-07-10 15:05:00,273 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2020-07-10 15:05:00,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:00,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:00,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:05:00,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:05:00,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-10 15:05:00,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2020-07-10 15:05:00,277 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 17 [2020-07-10 15:05:00,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:05:00,278 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2020-07-10 15:05:00,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:05:00,278 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2020-07-10 15:05:00,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 15:05:00,279 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:05:00,279 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:05:00,280 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:05:00,280 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:05:00,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:05:00,280 INFO L82 PathProgramCache]: Analyzing trace with hash 771025649, now seen corresponding path program 1 times [2020-07-10 15:05:00,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:05:00,281 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828893320] [2020-07-10 15:05:00,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:05:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:00,442 INFO L280 TraceCheckUtils]: 0: Hoare triple {394#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {386#true} is VALID [2020-07-10 15:05:00,442 INFO L280 TraceCheckUtils]: 1: Hoare triple {386#true} assume true; {386#true} is VALID [2020-07-10 15:05:00,443 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {386#true} {386#true} #105#return; {386#true} is VALID [2020-07-10 15:05:00,444 INFO L263 TraceCheckUtils]: 0: Hoare triple {386#true} call ULTIMATE.init(); {394#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:05:00,444 INFO L280 TraceCheckUtils]: 1: Hoare triple {394#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {386#true} is VALID [2020-07-10 15:05:00,444 INFO L280 TraceCheckUtils]: 2: Hoare triple {386#true} assume true; {386#true} is VALID [2020-07-10 15:05:00,445 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {386#true} {386#true} #105#return; {386#true} is VALID [2020-07-10 15:05:00,445 INFO L263 TraceCheckUtils]: 4: Hoare triple {386#true} call #t~ret12 := main(); {386#true} is VALID [2020-07-10 15:05:00,445 INFO L280 TraceCheckUtils]: 5: Hoare triple {386#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~flag~0 := #t~nondet2;havoc #t~nondet2;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc3.base, #t~malloc3.offset; {386#true} is VALID [2020-07-10 15:05:00,446 INFO L280 TraceCheckUtils]: 6: Hoare triple {386#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {386#true} is VALID [2020-07-10 15:05:00,446 INFO L280 TraceCheckUtils]: 7: Hoare triple {386#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {391#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-10 15:05:00,447 INFO L280 TraceCheckUtils]: 8: Hoare triple {391#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {391#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-10 15:05:00,452 INFO L280 TraceCheckUtils]: 9: Hoare triple {391#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet4);havoc #t~nondet4; {391#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-10 15:05:00,453 INFO L280 TraceCheckUtils]: 10: Hoare triple {391#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {392#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-10 15:05:00,454 INFO L280 TraceCheckUtils]: 11: Hoare triple {392#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(0 != ~flag~0); {392#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-10 15:05:00,455 INFO L280 TraceCheckUtils]: 12: Hoare triple {392#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {393#(= 3 |main_#t~mem9|)} is VALID [2020-07-10 15:05:00,456 INFO L280 TraceCheckUtils]: 13: Hoare triple {393#(= 3 |main_#t~mem9|)} assume !!(1 == #t~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {387#false} is VALID [2020-07-10 15:05:00,456 INFO L280 TraceCheckUtils]: 14: Hoare triple {387#false} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {387#false} is VALID [2020-07-10 15:05:00,456 INFO L280 TraceCheckUtils]: 15: Hoare triple {387#false} assume !(1 == #t~mem9);havoc #t~mem9; {387#false} is VALID [2020-07-10 15:05:00,457 INFO L280 TraceCheckUtils]: 16: Hoare triple {387#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {387#false} is VALID [2020-07-10 15:05:00,457 INFO L280 TraceCheckUtils]: 17: Hoare triple {387#false} assume 3 != #t~mem11;havoc #t~mem11; {387#false} is VALID [2020-07-10 15:05:00,458 INFO L280 TraceCheckUtils]: 18: Hoare triple {387#false} assume !false; {387#false} is VALID [2020-07-10 15:05:00,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:05:00,463 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828893320] [2020-07-10 15:05:00,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:05:00,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:05:00,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136899156] [2020-07-10 15:05:00,465 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-07-10 15:05:00,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:05:00,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:05:00,494 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:05:00,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:05:00,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:05:00,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:05:00,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:05:00,496 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 6 states. [2020-07-10 15:05:00,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:00,842 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-07-10 15:05:00,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:05:00,842 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-07-10 15:05:00,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:05:00,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:05:00,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2020-07-10 15:05:00,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:05:00,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2020-07-10 15:05:00,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2020-07-10 15:05:00,936 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:05:00,939 INFO L225 Difference]: With dead ends: 50 [2020-07-10 15:05:00,939 INFO L226 Difference]: Without dead ends: 42 [2020-07-10 15:05:00,942 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:05:00,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-10 15:05:00,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2020-07-10 15:05:00,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:05:00,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 30 states. [2020-07-10 15:05:00,960 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 30 states. [2020-07-10 15:05:00,960 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 30 states. [2020-07-10 15:05:00,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:00,964 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-07-10 15:05:00,964 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-10 15:05:00,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:00,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:00,965 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 42 states. [2020-07-10 15:05:00,965 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 42 states. [2020-07-10 15:05:00,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:00,968 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-07-10 15:05:00,968 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-10 15:05:00,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:00,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:00,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:05:00,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:05:00,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-10 15:05:00,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2020-07-10 15:05:00,971 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 19 [2020-07-10 15:05:00,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:05:00,971 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2020-07-10 15:05:00,971 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:05:00,972 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2020-07-10 15:05:00,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 15:05:00,972 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:05:00,972 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:05:00,973 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:05:00,973 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:05:00,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:05:00,976 INFO L82 PathProgramCache]: Analyzing trace with hash -472715872, now seen corresponding path program 1 times [2020-07-10 15:05:00,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:05:00,977 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837856529] [2020-07-10 15:05:00,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:05:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:01,062 INFO L280 TraceCheckUtils]: 0: Hoare triple {595#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {587#true} is VALID [2020-07-10 15:05:01,062 INFO L280 TraceCheckUtils]: 1: Hoare triple {587#true} assume true; {587#true} is VALID [2020-07-10 15:05:01,063 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {587#true} {587#true} #105#return; {587#true} is VALID [2020-07-10 15:05:01,064 INFO L263 TraceCheckUtils]: 0: Hoare triple {587#true} call ULTIMATE.init(); {595#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:05:01,064 INFO L280 TraceCheckUtils]: 1: Hoare triple {595#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {587#true} is VALID [2020-07-10 15:05:01,064 INFO L280 TraceCheckUtils]: 2: Hoare triple {587#true} assume true; {587#true} is VALID [2020-07-10 15:05:01,065 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {587#true} {587#true} #105#return; {587#true} is VALID [2020-07-10 15:05:01,065 INFO L263 TraceCheckUtils]: 4: Hoare triple {587#true} call #t~ret12 := main(); {587#true} is VALID [2020-07-10 15:05:01,065 INFO L280 TraceCheckUtils]: 5: Hoare triple {587#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~flag~0 := #t~nondet2;havoc #t~nondet2;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc3.base, #t~malloc3.offset; {587#true} is VALID [2020-07-10 15:05:01,065 INFO L280 TraceCheckUtils]: 6: Hoare triple {587#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {587#true} is VALID [2020-07-10 15:05:01,066 INFO L280 TraceCheckUtils]: 7: Hoare triple {587#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {592#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-10 15:05:01,067 INFO L280 TraceCheckUtils]: 8: Hoare triple {592#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {592#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-10 15:05:01,068 INFO L280 TraceCheckUtils]: 9: Hoare triple {592#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet4);havoc #t~nondet4; {592#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-10 15:05:01,069 INFO L280 TraceCheckUtils]: 10: Hoare triple {592#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {593#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-10 15:05:01,070 INFO L280 TraceCheckUtils]: 11: Hoare triple {593#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume 0 != ~flag~0; {593#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-10 15:05:01,070 INFO L280 TraceCheckUtils]: 12: Hoare triple {593#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {594#(= 3 |main_#t~mem7|)} is VALID [2020-07-10 15:05:01,071 INFO L280 TraceCheckUtils]: 13: Hoare triple {594#(= 3 |main_#t~mem7|)} assume !!(2 == #t~mem7);havoc #t~mem7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {588#false} is VALID [2020-07-10 15:05:01,071 INFO L280 TraceCheckUtils]: 14: Hoare triple {588#false} call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {588#false} is VALID [2020-07-10 15:05:01,072 INFO L280 TraceCheckUtils]: 15: Hoare triple {588#false} assume !(2 == #t~mem7);havoc #t~mem7; {588#false} is VALID [2020-07-10 15:05:01,072 INFO L280 TraceCheckUtils]: 16: Hoare triple {588#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {588#false} is VALID [2020-07-10 15:05:01,072 INFO L280 TraceCheckUtils]: 17: Hoare triple {588#false} assume 3 != #t~mem11;havoc #t~mem11; {588#false} is VALID [2020-07-10 15:05:01,072 INFO L280 TraceCheckUtils]: 18: Hoare triple {588#false} assume !false; {588#false} is VALID [2020-07-10 15:05:01,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:05:01,074 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837856529] [2020-07-10 15:05:01,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:05:01,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:05:01,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504387368] [2020-07-10 15:05:01,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-07-10 15:05:01,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:05:01,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:05:01,095 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:05:01,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:05:01,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:05:01,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:05:01,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:05:01,097 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 6 states. [2020-07-10 15:05:01,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:01,359 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2020-07-10 15:05:01,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:05:01,359 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-07-10 15:05:01,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:05:01,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:05:01,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2020-07-10 15:05:01,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:05:01,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2020-07-10 15:05:01,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2020-07-10 15:05:01,433 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:05:01,435 INFO L225 Difference]: With dead ends: 48 [2020-07-10 15:05:01,435 INFO L226 Difference]: Without dead ends: 38 [2020-07-10 15:05:01,436 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:05:01,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-10 15:05:01,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2020-07-10 15:05:01,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:05:01,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 26 states. [2020-07-10 15:05:01,450 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 26 states. [2020-07-10 15:05:01,451 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 26 states. [2020-07-10 15:05:01,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:01,453 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2020-07-10 15:05:01,453 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2020-07-10 15:05:01,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:01,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:01,454 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 38 states. [2020-07-10 15:05:01,454 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 38 states. [2020-07-10 15:05:01,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:01,457 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2020-07-10 15:05:01,457 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2020-07-10 15:05:01,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:01,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:01,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:05:01,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:05:01,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-10 15:05:01,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2020-07-10 15:05:01,464 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 19 [2020-07-10 15:05:01,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:05:01,464 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2020-07-10 15:05:01,464 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:05:01,464 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2020-07-10 15:05:01,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:05:01,465 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:05:01,469 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:05:01,469 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 15:05:01,469 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:05:01,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:05:01,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1962636917, now seen corresponding path program 1 times [2020-07-10 15:05:01,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:05:01,470 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020805567] [2020-07-10 15:05:01,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:05:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:01,578 INFO L280 TraceCheckUtils]: 0: Hoare triple {778#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {772#true} is VALID [2020-07-10 15:05:01,579 INFO L280 TraceCheckUtils]: 1: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-10 15:05:01,579 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {772#true} {772#true} #105#return; {772#true} is VALID [2020-07-10 15:05:01,580 INFO L263 TraceCheckUtils]: 0: Hoare triple {772#true} call ULTIMATE.init(); {778#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:05:01,580 INFO L280 TraceCheckUtils]: 1: Hoare triple {778#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {772#true} is VALID [2020-07-10 15:05:01,581 INFO L280 TraceCheckUtils]: 2: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-10 15:05:01,581 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {772#true} {772#true} #105#return; {772#true} is VALID [2020-07-10 15:05:01,581 INFO L263 TraceCheckUtils]: 4: Hoare triple {772#true} call #t~ret12 := main(); {772#true} is VALID [2020-07-10 15:05:01,581 INFO L280 TraceCheckUtils]: 5: Hoare triple {772#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~flag~0 := #t~nondet2;havoc #t~nondet2;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc3.base, #t~malloc3.offset; {772#true} is VALID [2020-07-10 15:05:01,582 INFO L280 TraceCheckUtils]: 6: Hoare triple {772#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {772#true} is VALID [2020-07-10 15:05:01,582 INFO L280 TraceCheckUtils]: 7: Hoare triple {772#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {772#true} is VALID [2020-07-10 15:05:01,582 INFO L280 TraceCheckUtils]: 8: Hoare triple {772#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {772#true} is VALID [2020-07-10 15:05:01,583 INFO L280 TraceCheckUtils]: 9: Hoare triple {772#true} assume !!(0 != #t~nondet4);havoc #t~nondet4; {772#true} is VALID [2020-07-10 15:05:01,583 INFO L280 TraceCheckUtils]: 10: Hoare triple {772#true} assume 0 != ~flag~0;call write~int(1, ~p~0.base, ~p~0.offset, 4); {777#(not (= 0 main_~flag~0))} is VALID [2020-07-10 15:05:01,584 INFO L280 TraceCheckUtils]: 11: Hoare triple {777#(not (= 0 main_~flag~0))} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc5.base, #t~malloc5.offset; {777#(not (= 0 main_~flag~0))} is VALID [2020-07-10 15:05:01,585 INFO L280 TraceCheckUtils]: 12: Hoare triple {777#(not (= 0 main_~flag~0))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {777#(not (= 0 main_~flag~0))} is VALID [2020-07-10 15:05:01,585 INFO L280 TraceCheckUtils]: 13: Hoare triple {777#(not (= 0 main_~flag~0))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {777#(not (= 0 main_~flag~0))} is VALID [2020-07-10 15:05:01,586 INFO L280 TraceCheckUtils]: 14: Hoare triple {777#(not (= 0 main_~flag~0))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {777#(not (= 0 main_~flag~0))} is VALID [2020-07-10 15:05:01,586 INFO L280 TraceCheckUtils]: 15: Hoare triple {777#(not (= 0 main_~flag~0))} assume !(0 != #t~nondet4);havoc #t~nondet4; {777#(not (= 0 main_~flag~0))} is VALID [2020-07-10 15:05:01,587 INFO L280 TraceCheckUtils]: 16: Hoare triple {777#(not (= 0 main_~flag~0))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {777#(not (= 0 main_~flag~0))} is VALID [2020-07-10 15:05:01,588 INFO L280 TraceCheckUtils]: 17: Hoare triple {777#(not (= 0 main_~flag~0))} assume !(0 != ~flag~0); {773#false} is VALID [2020-07-10 15:05:01,588 INFO L280 TraceCheckUtils]: 18: Hoare triple {773#false} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {773#false} is VALID [2020-07-10 15:05:01,588 INFO L280 TraceCheckUtils]: 19: Hoare triple {773#false} assume !(1 == #t~mem9);havoc #t~mem9; {773#false} is VALID [2020-07-10 15:05:01,588 INFO L280 TraceCheckUtils]: 20: Hoare triple {773#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {773#false} is VALID [2020-07-10 15:05:01,589 INFO L280 TraceCheckUtils]: 21: Hoare triple {773#false} assume 3 != #t~mem11;havoc #t~mem11; {773#false} is VALID [2020-07-10 15:05:01,589 INFO L280 TraceCheckUtils]: 22: Hoare triple {773#false} assume !false; {773#false} is VALID [2020-07-10 15:05:01,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:05:01,590 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020805567] [2020-07-10 15:05:01,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:05:01,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:05:01,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106201798] [2020-07-10 15:05:01,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-07-10 15:05:01,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:05:01,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:05:01,613 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:05:01,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:05:01,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:05:01,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:05:01,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:05:01,614 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 4 states. [2020-07-10 15:05:01,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:01,753 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2020-07-10 15:05:01,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:05:01,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-07-10 15:05:01,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:05:01,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:05:01,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2020-07-10 15:05:01,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:05:01,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2020-07-10 15:05:01,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 62 transitions. [2020-07-10 15:05:01,836 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:05:01,838 INFO L225 Difference]: With dead ends: 54 [2020-07-10 15:05:01,838 INFO L226 Difference]: Without dead ends: 38 [2020-07-10 15:05:01,838 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:05:01,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-10 15:05:01,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2020-07-10 15:05:01,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:05:01,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 34 states. [2020-07-10 15:05:01,854 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 34 states. [2020-07-10 15:05:01,855 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 34 states. [2020-07-10 15:05:01,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:01,856 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-10 15:05:01,857 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-10 15:05:01,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:01,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:01,857 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 38 states. [2020-07-10 15:05:01,858 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 38 states. [2020-07-10 15:05:01,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:01,860 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-10 15:05:01,860 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-10 15:05:01,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:01,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:01,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:05:01,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:05:01,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-10 15:05:01,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2020-07-10 15:05:01,866 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 23 [2020-07-10 15:05:01,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:05:01,868 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2020-07-10 15:05:01,869 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:05:01,869 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2020-07-10 15:05:01,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:05:01,871 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:05:01,871 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:05:01,871 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 15:05:01,873 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:05:01,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:05:01,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1888593434, now seen corresponding path program 1 times [2020-07-10 15:05:01,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:05:01,874 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483616479] [2020-07-10 15:05:01,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:05:01,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:05:01,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:05:01,945 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:05:01,945 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:05:01,946 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 15:05:01,980 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:05:01,980 WARN L170 areAnnotationChecker]: myexitENTRY has no Hoare annotation [2020-07-10 15:05:01,980 WARN L170 areAnnotationChecker]: __bswap_32ENTRY has no Hoare annotation [2020-07-10 15:05:01,980 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:05:01,980 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:05:01,980 WARN L170 areAnnotationChecker]: __bswap_64ENTRY has no Hoare annotation [2020-07-10 15:05:01,981 WARN L170 areAnnotationChecker]: __uint16_identityENTRY has no Hoare annotation [2020-07-10 15:05:01,981 WARN L170 areAnnotationChecker]: __uint64_identityENTRY has no Hoare annotation [2020-07-10 15:05:01,981 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:05:01,981 WARN L170 areAnnotationChecker]: __uint32_identityENTRY has no Hoare annotation [2020-07-10 15:05:01,981 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:05:01,981 WARN L170 areAnnotationChecker]: L514 has no Hoare annotation [2020-07-10 15:05:01,981 WARN L170 areAnnotationChecker]: __bswap_32FINAL has no Hoare annotation [2020-07-10 15:05:01,981 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:05:01,981 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:05:01,982 WARN L170 areAnnotationChecker]: __bswap_64FINAL has no Hoare annotation [2020-07-10 15:05:01,982 WARN L170 areAnnotationChecker]: __uint16_identityFINAL has no Hoare annotation [2020-07-10 15:05:01,982 WARN L170 areAnnotationChecker]: __uint64_identityFINAL has no Hoare annotation [2020-07-10 15:05:01,982 WARN L170 areAnnotationChecker]: L524 has no Hoare annotation [2020-07-10 15:05:01,982 WARN L170 areAnnotationChecker]: L524 has no Hoare annotation [2020-07-10 15:05:01,982 WARN L170 areAnnotationChecker]: __uint32_identityFINAL has no Hoare annotation [2020-07-10 15:05:01,982 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:05:01,982 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:05:01,982 WARN L170 areAnnotationChecker]: L524-1 has no Hoare annotation [2020-07-10 15:05:01,982 WARN L170 areAnnotationChecker]: L524-1 has no Hoare annotation [2020-07-10 15:05:01,983 WARN L170 areAnnotationChecker]: L524-3 has no Hoare annotation [2020-07-10 15:05:01,983 WARN L170 areAnnotationChecker]: L526-3 has no Hoare annotation [2020-07-10 15:05:01,983 WARN L170 areAnnotationChecker]: L526-3 has no Hoare annotation [2020-07-10 15:05:01,984 WARN L170 areAnnotationChecker]: L526-4 has no Hoare annotation [2020-07-10 15:05:01,984 WARN L170 areAnnotationChecker]: L526-1 has no Hoare annotation [2020-07-10 15:05:01,985 WARN L170 areAnnotationChecker]: L526-1 has no Hoare annotation [2020-07-10 15:05:01,985 WARN L170 areAnnotationChecker]: L539 has no Hoare annotation [2020-07-10 15:05:01,985 WARN L170 areAnnotationChecker]: L539 has no Hoare annotation [2020-07-10 15:05:01,985 WARN L170 areAnnotationChecker]: L527 has no Hoare annotation [2020-07-10 15:05:01,985 WARN L170 areAnnotationChecker]: L527 has no Hoare annotation [2020-07-10 15:05:01,985 WARN L170 areAnnotationChecker]: L540-3 has no Hoare annotation [2020-07-10 15:05:01,985 WARN L170 areAnnotationChecker]: L540-3 has no Hoare annotation [2020-07-10 15:05:01,985 WARN L170 areAnnotationChecker]: L543-3 has no Hoare annotation [2020-07-10 15:05:01,985 WARN L170 areAnnotationChecker]: L543-3 has no Hoare annotation [2020-07-10 15:05:01,986 WARN L170 areAnnotationChecker]: L527-2 has no Hoare annotation [2020-07-10 15:05:01,986 WARN L170 areAnnotationChecker]: L543-4 has no Hoare annotation [2020-07-10 15:05:01,986 WARN L170 areAnnotationChecker]: L540-1 has no Hoare annotation [2020-07-10 15:05:01,986 WARN L170 areAnnotationChecker]: L540-1 has no Hoare annotation [2020-07-10 15:05:01,986 WARN L170 areAnnotationChecker]: L543-1 has no Hoare annotation [2020-07-10 15:05:01,986 WARN L170 areAnnotationChecker]: L543-1 has no Hoare annotation [2020-07-10 15:05:01,986 WARN L170 areAnnotationChecker]: L533 has no Hoare annotation [2020-07-10 15:05:01,986 WARN L170 areAnnotationChecker]: L533 has no Hoare annotation [2020-07-10 15:05:01,986 WARN L170 areAnnotationChecker]: L545 has no Hoare annotation [2020-07-10 15:05:01,987 WARN L170 areAnnotationChecker]: L545 has no Hoare annotation [2020-07-10 15:05:01,987 WARN L170 areAnnotationChecker]: L533-1 has no Hoare annotation [2020-07-10 15:05:01,987 WARN L170 areAnnotationChecker]: L533-1 has no Hoare annotation [2020-07-10 15:05:01,987 WARN L170 areAnnotationChecker]: L533-3 has no Hoare annotation [2020-07-10 15:05:01,992 WARN L170 areAnnotationChecker]: L546 has no Hoare annotation [2020-07-10 15:05:01,992 WARN L170 areAnnotationChecker]: L546 has no Hoare annotation [2020-07-10 15:05:01,992 WARN L170 areAnnotationChecker]: L545-2 has no Hoare annotation [2020-07-10 15:05:01,992 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:05:01,993 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. [2020-07-10 15:05:01,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:05:01 BoogieIcfgContainer [2020-07-10 15:05:01,995 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:05:02,000 INFO L168 Benchmark]: Toolchain (without parser) took 4620.58 ms. Allocated memory was 137.9 MB in the beginning and 251.1 MB in the end (delta: 113.2 MB). Free memory was 101.3 MB in the beginning and 129.1 MB in the end (delta: -27.8 MB). Peak memory consumption was 85.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:05:02,002 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-10 15:05:02,003 INFO L168 Benchmark]: CACSL2BoogieTranslator took 627.65 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 101.1 MB in the beginning and 169.0 MB in the end (delta: -67.9 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:05:02,004 INFO L168 Benchmark]: Boogie Preprocessor took 65.72 ms. Allocated memory is still 202.9 MB. Free memory was 169.0 MB in the beginning and 165.3 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:05:02,006 INFO L168 Benchmark]: RCFGBuilder took 670.88 ms. Allocated memory is still 202.9 MB. Free memory was 165.3 MB in the beginning and 112.8 MB in the end (delta: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:05:02,007 INFO L168 Benchmark]: TraceAbstraction took 3246.98 ms. Allocated memory was 202.9 MB in the beginning and 251.1 MB in the end (delta: 48.2 MB). Free memory was 112.2 MB in the beginning and 129.1 MB in the end (delta: -17.0 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:05:02,015 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 627.65 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 101.1 MB in the beginning and 169.0 MB in the end (delta: -67.9 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 65.72 ms. Allocated memory is still 202.9 MB. Free memory was 169.0 MB in the beginning and 165.3 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 670.88 ms. Allocated memory is still 202.9 MB. Free memory was 165.3 MB in the beginning and 112.8 MB in the end (delta: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3246.98 ms. Allocated memory was 202.9 MB in the beginning and 251.1 MB in the end (delta: 48.2 MB). Free memory was 112.2 MB in the beginning and 129.1 MB in the end (delta: -17.0 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 546]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L521] int flag = __VERIFIER_nondet_int(); [L522] List p, a, t; [L523] a = (List) malloc(sizeof(struct node)) VAL [a={-2:0}, flag=-1, malloc(sizeof(struct node))={-2:0}] [L524] COND FALSE !(a == 0) VAL [a={-2:0}, flag=-1, malloc(sizeof(struct node))={-2:0}] [L525] p = a VAL [a={-2:0}, flag=-1, malloc(sizeof(struct node))={-2:0}, p={-2:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] COND TRUE \read(flag) [L528] p->h = 1 VAL [a={-2:0}, flag=-1, malloc(sizeof(struct node))={-2:0}, p={-2:0}] [L532] t = (List) malloc(sizeof(struct node)) VAL [a={-2:0}, flag=-1, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, p={-2:0}, t={-3:0}] [L533] COND FALSE !(t == 0) VAL [a={-2:0}, flag=-1, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, p={-2:0}, t={-3:0}] [L534] p->n = t [L535] EXPR p->n [L535] p = p->n [L526] COND FALSE !(__VERIFIER_nondet_int()) [L537] p->h = 3 [L538] p = a VAL [a={-2:0}, flag=-1, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, p={-2:0}, t={-3:0}] [L539] COND TRUE \read(flag) VAL [a={-2:0}, flag=-1, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, p={-2:0}, t={-3:0}] [L540] EXPR p->h VAL [a={-2:0}, flag=-1, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, p={-2:0}, p->h=1, t={-3:0}] [L540] COND FALSE !(p->h == 2) [L545] EXPR p->h VAL [a={-2:0}, flag=-1, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, p={-2:0}, p->h=1, t={-3:0}] [L545] COND TRUE p->h != 3 [L546] __VERIFIER_error() VAL [a={-2:0}, flag=-1, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, p={-2:0}, t={-3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3.1s, OverallIterations: 6, TraceHistogramMax: 2, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 120 SDtfs, 73 SDslu, 178 SDs, 0 SdLazy, 288 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 40 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 4694 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...