java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/list-ext-properties/list-ext_flag_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:12:38,243 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:12:38,246 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:12:38,259 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:12:38,259 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:12:38,260 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:12:38,261 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:12:38,263 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:12:38,265 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:12:38,266 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:12:38,267 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:12:38,267 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:12:38,268 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:12:38,269 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:12:38,270 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:12:38,271 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:12:38,272 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:12:38,273 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:12:38,276 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:12:38,277 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:12:38,278 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:12:38,280 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:12:38,282 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:12:38,282 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:12:38,283 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:12:38,284 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:12:38,285 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:12:38,285 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:12:38,286 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:12:38,287 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:12:38,288 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:12:38,288 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:12:38,289 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:12:38,289 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:12:38,290 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:12:38,291 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:12:38,291 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 19:12:38,321 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:12:38,322 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:12:38,322 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:12:38,324 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:12:38,325 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:12:38,325 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:12:38,325 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:12:38,325 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:12:38,326 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:12:38,327 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:12:38,327 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:12:38,327 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:12:38,327 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:12:38,327 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:12:38,328 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:12:38,328 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:12:38,328 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:12:38,328 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:12:38,328 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:12:38,329 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:12:38,329 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:12:38,329 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:12:38,329 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:12:38,329 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:12:38,330 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:12:38,330 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:12:38,330 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:12:38,330 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:12:38,330 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:12:38,330 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:12:38,332 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:12:38,401 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:12:38,415 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:12:38,419 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:12:38,421 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:12:38,421 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:12:38,422 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/list-ext_flag_false-unreach-call_false-valid-deref.i [2018-11-14 19:12:38,473 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e1613aed/69fa6c0268c04843be8742199d12579c/FLAG0e27c8aeb [2018-11-14 19:12:38,942 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:12:38,943 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext-properties/list-ext_flag_false-unreach-call_false-valid-deref.i [2018-11-14 19:12:38,958 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e1613aed/69fa6c0268c04843be8742199d12579c/FLAG0e27c8aeb [2018-11-14 19:12:38,974 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e1613aed/69fa6c0268c04843be8742199d12579c [2018-11-14 19:12:38,983 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:12:38,985 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:12:38,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:12:38,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:12:38,989 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:12:38,991 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:12:38" (1/1) ... [2018-11-14 19:12:38,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63f630ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:12:38, skipping insertion in model container [2018-11-14 19:12:38,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:12:38" (1/1) ... [2018-11-14 19:12:39,003 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:12:39,055 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:12:39,446 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:12:39,457 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:12:39,537 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:12:39,607 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:12:39,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:12:39 WrapperNode [2018-11-14 19:12:39,607 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:12:39,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:12:39,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:12:39,609 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:12:39,699 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:12:39" (1/1) ... [2018-11-14 19:12:39,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:12:39" (1/1) ... [2018-11-14 19:12:39,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:12:39" (1/1) ... [2018-11-14 19:12:39,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:12:39" (1/1) ... [2018-11-14 19:12:39,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:12:39" (1/1) ... [2018-11-14 19:12:39,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:12:39" (1/1) ... [2018-11-14 19:12:39,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:12:39" (1/1) ... [2018-11-14 19:12:39,763 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:12:39,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:12:39,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:12:39,768 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:12:39,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:12:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:12:39,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:12:39,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:12:39,828 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-14 19:12:39,828 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:12:39,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:12:39,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 19:12:39,829 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 19:12:39,829 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 19:12:39,829 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 19:12:39,829 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 19:12:39,829 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 19:12:39,829 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 19:12:39,830 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 19:12:39,830 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 19:12:39,830 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 19:12:39,830 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 19:12:39,831 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 19:12:39,831 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 19:12:39,831 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 19:12:39,831 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 19:12:39,831 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 19:12:39,832 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 19:12:39,832 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 19:12:39,832 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 19:12:39,832 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 19:12:39,832 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 19:12:39,832 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 19:12:39,832 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 19:12:39,833 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 19:12:39,833 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 19:12:39,833 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 19:12:39,833 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 19:12:39,833 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 19:12:39,833 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 19:12:39,834 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 19:12:39,834 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 19:12:39,834 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 19:12:39,834 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 19:12:39,834 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 19:12:39,834 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 19:12:39,835 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 19:12:39,835 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 19:12:39,835 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 19:12:39,835 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 19:12:39,835 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 19:12:39,836 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 19:12:39,836 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 19:12:39,836 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 19:12:39,836 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 19:12:39,836 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 19:12:39,836 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 19:12:39,836 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 19:12:39,837 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 19:12:39,837 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 19:12:39,837 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 19:12:39,837 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 19:12:39,837 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 19:12:39,837 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 19:12:39,838 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 19:12:39,838 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 19:12:39,838 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 19:12:39,838 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 19:12:39,838 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 19:12:39,838 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 19:12:39,838 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 19:12:39,839 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 19:12:39,839 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 19:12:39,839 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 19:12:39,839 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 19:12:39,839 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 19:12:39,839 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-11-14 19:12:39,839 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 19:12:39,840 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 19:12:39,840 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 19:12:39,840 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 19:12:39,840 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 19:12:39,840 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 19:12:39,840 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 19:12:39,841 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 19:12:39,841 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 19:12:39,841 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 19:12:39,841 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 19:12:39,841 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 19:12:39,841 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 19:12:39,841 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 19:12:39,842 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 19:12:39,842 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 19:12:39,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 19:12:39,842 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 19:12:39,842 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 19:12:39,842 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 19:12:39,842 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 19:12:39,843 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 19:12:39,843 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 19:12:39,843 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 19:12:39,843 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 19:12:39,843 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 19:12:39,843 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 19:12:39,844 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 19:12:39,844 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 19:12:39,844 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 19:12:39,844 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 19:12:39,844 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 19:12:39,844 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 19:12:39,844 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 19:12:39,845 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 19:12:39,845 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 19:12:39,845 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:12:39,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 19:12:39,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 19:12:39,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 19:12:39,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 19:12:39,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 19:12:39,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 19:12:39,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:12:39,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:12:39,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 19:12:40,837 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:12:40,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:12:40 BoogieIcfgContainer [2018-11-14 19:12:40,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:12:40,838 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:12:40,839 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:12:40,842 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:12:40,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:12:38" (1/3) ... [2018-11-14 19:12:40,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75290bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:12:40, skipping insertion in model container [2018-11-14 19:12:40,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:12:39" (2/3) ... [2018-11-14 19:12:40,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75290bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:12:40, skipping insertion in model container [2018-11-14 19:12:40,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:12:40" (3/3) ... [2018-11-14 19:12:40,845 INFO L112 eAbstractionObserver]: Analyzing ICFG list-ext_flag_false-unreach-call_false-valid-deref.i [2018-11-14 19:12:40,855 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:12:40,864 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 19:12:40,881 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 19:12:40,913 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:12:40,913 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:12:40,914 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:12:40,914 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:12:40,914 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:12:40,914 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:12:40,915 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:12:40,915 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:12:40,915 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:12:40,933 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-11-14 19:12:40,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 19:12:40,939 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:12:40,940 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:12:40,943 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:12:40,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:12:40,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1985352596, now seen corresponding path program 1 times [2018-11-14 19:12:40,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:12:40,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:12:41,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:41,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:12:41,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:12:41,114 INFO L256 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {43#true} is VALID [2018-11-14 19:12:41,117 INFO L273 TraceCheckUtils]: 1: Hoare triple {43#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {43#true} is VALID [2018-11-14 19:12:41,118 INFO L273 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2018-11-14 19:12:41,118 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #114#return; {43#true} is VALID [2018-11-14 19:12:41,118 INFO L256 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret17 := main(); {43#true} is VALID [2018-11-14 19:12:41,119 INFO L273 TraceCheckUtils]: 5: Hoare triple {43#true} havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {43#true} is VALID [2018-11-14 19:12:41,119 INFO L273 TraceCheckUtils]: 6: Hoare triple {43#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {43#true} is VALID [2018-11-14 19:12:41,119 INFO L273 TraceCheckUtils]: 7: Hoare triple {43#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~i~0 := 0; {43#true} is VALID [2018-11-14 19:12:41,120 INFO L273 TraceCheckUtils]: 8: Hoare triple {43#true} assume !true; {44#false} is VALID [2018-11-14 19:12:41,120 INFO L273 TraceCheckUtils]: 9: Hoare triple {44#false} call write~int(3, ~p~0.base, ~p~0.offset + 0, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {44#false} is VALID [2018-11-14 19:12:41,121 INFO L273 TraceCheckUtils]: 10: Hoare triple {44#false} assume !true; {44#false} is VALID [2018-11-14 19:12:41,121 INFO L273 TraceCheckUtils]: 11: Hoare triple {44#false} call #t~mem14 := read~int(~p~0.base, ~p~0.offset + 0, 4); {44#false} is VALID [2018-11-14 19:12:41,121 INFO L273 TraceCheckUtils]: 12: Hoare triple {44#false} assume #t~mem14 != 3 || ~i~0 > 20;havoc #t~mem14; {44#false} is VALID [2018-11-14 19:12:41,123 INFO L273 TraceCheckUtils]: 13: Hoare triple {44#false} assume !false; {44#false} is VALID [2018-11-14 19:12:41,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:12:41,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:12:41,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 19:12:41,134 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-14 19:12:41,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:12:41,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 19:12:41,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:12:41,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 19:12:41,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 19:12:41,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:12:41,306 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-11-14 19:12:41,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:41,496 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2018-11-14 19:12:41,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 19:12:41,496 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-14 19:12:41,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:12:41,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:12:41,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 79 transitions. [2018-11-14 19:12:41,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:12:41,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 79 transitions. [2018-11-14 19:12:41,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 79 transitions. [2018-11-14 19:12:41,960 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:12:41,971 INFO L225 Difference]: With dead ends: 60 [2018-11-14 19:12:41,972 INFO L226 Difference]: Without dead ends: 28 [2018-11-14 19:12:41,975 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:12:41,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-14 19:12:42,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-14 19:12:42,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:12:42,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-14 19:12:42,016 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 19:12:42,016 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 19:12:42,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:42,020 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-11-14 19:12:42,020 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2018-11-14 19:12:42,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:42,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:42,021 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 19:12:42,021 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 19:12:42,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:42,025 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-11-14 19:12:42,026 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2018-11-14 19:12:42,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:42,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:42,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:12:42,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:12:42,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 19:12:42,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2018-11-14 19:12:42,036 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 14 [2018-11-14 19:12:42,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:12:42,037 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-11-14 19:12:42,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 19:12:42,037 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2018-11-14 19:12:42,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 19:12:42,038 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:12:42,038 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:12:42,039 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:12:42,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:12:42,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1674274239, now seen corresponding path program 1 times [2018-11-14 19:12:42,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:12:42,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:12:42,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:42,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:12:42,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:12:42,410 INFO L256 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {212#true} is VALID [2018-11-14 19:12:42,411 INFO L273 TraceCheckUtils]: 1: Hoare triple {212#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {212#true} is VALID [2018-11-14 19:12:42,411 INFO L273 TraceCheckUtils]: 2: Hoare triple {212#true} assume true; {212#true} is VALID [2018-11-14 19:12:42,411 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} #114#return; {212#true} is VALID [2018-11-14 19:12:42,412 INFO L256 TraceCheckUtils]: 4: Hoare triple {212#true} call #t~ret17 := main(); {212#true} is VALID [2018-11-14 19:12:42,412 INFO L273 TraceCheckUtils]: 5: Hoare triple {212#true} havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {212#true} is VALID [2018-11-14 19:12:42,412 INFO L273 TraceCheckUtils]: 6: Hoare triple {212#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {212#true} is VALID [2018-11-14 19:12:42,413 INFO L273 TraceCheckUtils]: 7: Hoare triple {212#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~i~0 := 0; {214#(= main_~i~0 0)} is VALID [2018-11-14 19:12:42,416 INFO L273 TraceCheckUtils]: 8: Hoare triple {214#(= main_~i~0 0)} assume true; {214#(= main_~i~0 0)} is VALID [2018-11-14 19:12:42,416 INFO L273 TraceCheckUtils]: 9: Hoare triple {214#(= main_~i~0 0)} #t~short2 := ~i~0 < 20; {214#(= main_~i~0 0)} is VALID [2018-11-14 19:12:42,417 INFO L273 TraceCheckUtils]: 10: Hoare triple {214#(= main_~i~0 0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := #t~nondet1 != 0; {214#(= main_~i~0 0)} is VALID [2018-11-14 19:12:42,417 INFO L273 TraceCheckUtils]: 11: Hoare triple {214#(= main_~i~0 0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {214#(= main_~i~0 0)} is VALID [2018-11-14 19:12:42,418 INFO L273 TraceCheckUtils]: 12: Hoare triple {214#(= main_~i~0 0)} call write~int(3, ~p~0.base, ~p~0.offset + 0, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {214#(= main_~i~0 0)} is VALID [2018-11-14 19:12:42,418 INFO L273 TraceCheckUtils]: 13: Hoare triple {214#(= main_~i~0 0)} assume true; {214#(= main_~i~0 0)} is VALID [2018-11-14 19:12:42,437 INFO L273 TraceCheckUtils]: 14: Hoare triple {214#(= main_~i~0 0)} call #t~mem8 := read~int(~p~0.base, ~p~0.offset + 0, 4); {215#(and (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem8|) (= main_~i~0 0))} is VALID [2018-11-14 19:12:42,440 INFO L273 TraceCheckUtils]: 15: Hoare triple {215#(and (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem8|) (= main_~i~0 0))} assume !(#t~mem8 != 3);havoc #t~mem8; {216#(and (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~i~0 0))} is VALID [2018-11-14 19:12:42,441 INFO L273 TraceCheckUtils]: 16: Hoare triple {216#(and (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~i~0 0))} call #t~mem14 := read~int(~p~0.base, ~p~0.offset + 0, 4); {217#(and (= 3 |main_#t~mem14|) (= main_~i~0 0))} is VALID [2018-11-14 19:12:42,443 INFO L273 TraceCheckUtils]: 17: Hoare triple {217#(and (= 3 |main_#t~mem14|) (= main_~i~0 0))} assume #t~mem14 != 3 || ~i~0 > 20;havoc #t~mem14; {213#false} is VALID [2018-11-14 19:12:42,443 INFO L273 TraceCheckUtils]: 18: Hoare triple {213#false} assume !false; {213#false} is VALID [2018-11-14 19:12:42,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:12:42,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:12:42,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 19:12:42,448 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-14 19:12:42,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:12:42,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:12:42,478 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:12:42,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:12:42,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:12:42,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:12:42,479 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 6 states. [2018-11-14 19:12:42,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:42,826 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-14 19:12:42,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 19:12:42,826 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-14 19:12:42,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:12:42,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:12:42,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2018-11-14 19:12:42,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:12:42,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2018-11-14 19:12:42,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2018-11-14 19:12:42,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:12:42,965 INFO L225 Difference]: With dead ends: 46 [2018-11-14 19:12:42,965 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 19:12:42,966 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:12:42,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 19:12:43,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2018-11-14 19:12:43,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:12:43,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 36 states. [2018-11-14 19:12:43,022 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 36 states. [2018-11-14 19:12:43,022 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 36 states. [2018-11-14 19:12:43,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:43,026 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2018-11-14 19:12:43,026 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2018-11-14 19:12:43,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:43,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:43,027 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 42 states. [2018-11-14 19:12:43,027 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 42 states. [2018-11-14 19:12:43,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:43,031 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2018-11-14 19:12:43,031 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2018-11-14 19:12:43,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:43,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:43,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:12:43,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:12:43,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 19:12:43,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-14 19:12:43,035 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 19 [2018-11-14 19:12:43,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:12:43,035 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-14 19:12:43,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:12:43,036 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-14 19:12:43,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 19:12:43,036 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:12:43,037 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:12:43,037 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:12:43,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:12:43,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1674315965, now seen corresponding path program 1 times [2018-11-14 19:12:43,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:12:43,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:12:43,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:43,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:12:43,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:12:43,176 INFO L256 TraceCheckUtils]: 0: Hoare triple {408#true} call ULTIMATE.init(); {408#true} is VALID [2018-11-14 19:12:43,177 INFO L273 TraceCheckUtils]: 1: Hoare triple {408#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {408#true} is VALID [2018-11-14 19:12:43,177 INFO L273 TraceCheckUtils]: 2: Hoare triple {408#true} assume true; {408#true} is VALID [2018-11-14 19:12:43,177 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {408#true} {408#true} #114#return; {408#true} is VALID [2018-11-14 19:12:43,178 INFO L256 TraceCheckUtils]: 4: Hoare triple {408#true} call #t~ret17 := main(); {408#true} is VALID [2018-11-14 19:12:43,178 INFO L273 TraceCheckUtils]: 5: Hoare triple {408#true} havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {408#true} is VALID [2018-11-14 19:12:43,178 INFO L273 TraceCheckUtils]: 6: Hoare triple {408#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {408#true} is VALID [2018-11-14 19:12:43,179 INFO L273 TraceCheckUtils]: 7: Hoare triple {408#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~i~0 := 0; {410#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:43,180 INFO L273 TraceCheckUtils]: 8: Hoare triple {410#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {410#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:43,181 INFO L273 TraceCheckUtils]: 9: Hoare triple {410#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} #t~short2 := ~i~0 < 20; {410#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:43,181 INFO L273 TraceCheckUtils]: 10: Hoare triple {410#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := #t~nondet1 != 0; {410#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:43,182 INFO L273 TraceCheckUtils]: 11: Hoare triple {410#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {410#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:43,200 INFO L273 TraceCheckUtils]: 12: Hoare triple {410#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~int(3, ~p~0.base, ~p~0.offset + 0, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {411#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:12:43,208 INFO L273 TraceCheckUtils]: 13: Hoare triple {411#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {411#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:12:43,209 INFO L273 TraceCheckUtils]: 14: Hoare triple {411#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem8 := read~int(~p~0.base, ~p~0.offset + 0, 4); {412#(= |main_#t~mem8| 3)} is VALID [2018-11-14 19:12:43,214 INFO L273 TraceCheckUtils]: 15: Hoare triple {412#(= |main_#t~mem8| 3)} assume !!(#t~mem8 != 3);havoc #t~mem8;call #t~mem9 := read~int(~p~0.base, ~p~0.offset + 4, 4); {409#false} is VALID [2018-11-14 19:12:43,214 INFO L273 TraceCheckUtils]: 16: Hoare triple {409#false} assume #t~mem9 != 0;havoc #t~mem9;call #t~mem10 := read~int(~p~0.base, ~p~0.offset + 0, 4); {409#false} is VALID [2018-11-14 19:12:43,214 INFO L273 TraceCheckUtils]: 17: Hoare triple {409#false} assume #t~mem10 != 1;havoc #t~mem10; {409#false} is VALID [2018-11-14 19:12:43,215 INFO L273 TraceCheckUtils]: 18: Hoare triple {409#false} assume !false; {409#false} is VALID [2018-11-14 19:12:43,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:12:43,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:12:43,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 19:12:43,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-14 19:12:43,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:12:43,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:12:43,240 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:12:43,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:12:43,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:12:43,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:12:43,241 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 5 states. [2018-11-14 19:12:43,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:43,538 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2018-11-14 19:12:43,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:12:43,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-14 19:12:43,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:12:43,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:12:43,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2018-11-14 19:12:43,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:12:43,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2018-11-14 19:12:43,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2018-11-14 19:12:43,701 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:12:43,705 INFO L225 Difference]: With dead ends: 62 [2018-11-14 19:12:43,705 INFO L226 Difference]: Without dead ends: 47 [2018-11-14 19:12:43,705 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:12:43,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-14 19:12:43,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-11-14 19:12:43,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:12:43,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 32 states. [2018-11-14 19:12:43,728 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 32 states. [2018-11-14 19:12:43,728 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 32 states. [2018-11-14 19:12:43,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:43,732 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2018-11-14 19:12:43,732 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2018-11-14 19:12:43,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:43,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:43,733 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 47 states. [2018-11-14 19:12:43,733 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 47 states. [2018-11-14 19:12:43,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:43,737 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2018-11-14 19:12:43,737 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2018-11-14 19:12:43,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:43,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:43,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:12:43,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:12:43,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 19:12:43,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-11-14 19:12:43,741 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 19 [2018-11-14 19:12:43,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:12:43,741 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-14 19:12:43,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:12:43,741 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2018-11-14 19:12:43,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 19:12:43,742 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:12:43,743 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:12:43,743 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:12:43,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:12:43,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1621587279, now seen corresponding path program 1 times [2018-11-14 19:12:43,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:12:43,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:12:43,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:43,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:12:43,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:12:43,910 INFO L256 TraceCheckUtils]: 0: Hoare triple {628#true} call ULTIMATE.init(); {628#true} is VALID [2018-11-14 19:12:43,910 INFO L273 TraceCheckUtils]: 1: Hoare triple {628#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {628#true} is VALID [2018-11-14 19:12:43,911 INFO L273 TraceCheckUtils]: 2: Hoare triple {628#true} assume true; {628#true} is VALID [2018-11-14 19:12:43,911 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {628#true} {628#true} #114#return; {628#true} is VALID [2018-11-14 19:12:43,912 INFO L256 TraceCheckUtils]: 4: Hoare triple {628#true} call #t~ret17 := main(); {628#true} is VALID [2018-11-14 19:12:43,912 INFO L273 TraceCheckUtils]: 5: Hoare triple {628#true} havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {628#true} is VALID [2018-11-14 19:12:43,913 INFO L273 TraceCheckUtils]: 6: Hoare triple {628#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {628#true} is VALID [2018-11-14 19:12:43,914 INFO L273 TraceCheckUtils]: 7: Hoare triple {628#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~i~0 := 0; {628#true} is VALID [2018-11-14 19:12:43,914 INFO L273 TraceCheckUtils]: 8: Hoare triple {628#true} assume true; {628#true} is VALID [2018-11-14 19:12:43,914 INFO L273 TraceCheckUtils]: 9: Hoare triple {628#true} #t~short2 := ~i~0 < 20; {628#true} is VALID [2018-11-14 19:12:43,915 INFO L273 TraceCheckUtils]: 10: Hoare triple {628#true} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := #t~nondet1 != 0; {628#true} is VALID [2018-11-14 19:12:43,915 INFO L273 TraceCheckUtils]: 11: Hoare triple {628#true} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;#t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + 4, 4);havoc #t~nondet4;call #t~mem5 := read~int(~p~0.base, ~p~0.offset + 4, 4); {628#true} is VALID [2018-11-14 19:12:43,915 INFO L273 TraceCheckUtils]: 12: Hoare triple {628#true} assume #t~mem5 != 0;havoc #t~mem5;call write~int(1, ~p~0.base, ~p~0.offset + 0, 4); {628#true} is VALID [2018-11-14 19:12:43,916 INFO L273 TraceCheckUtils]: 13: Hoare triple {628#true} call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12);~t~0.base, ~t~0.offset := #t~malloc6.base, #t~malloc6.offset; {628#true} is VALID [2018-11-14 19:12:43,916 INFO L273 TraceCheckUtils]: 14: Hoare triple {628#true} assume !(~t~0.base == 0 && ~t~0.offset == 0); {628#true} is VALID [2018-11-14 19:12:43,916 INFO L273 TraceCheckUtils]: 15: Hoare triple {628#true} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~p~0.offset + 8, 4);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~p~0.base, ~p~0.offset + 8, 4);~p~0.base, ~p~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {628#true} is VALID [2018-11-14 19:12:43,917 INFO L273 TraceCheckUtils]: 16: Hoare triple {628#true} assume true; {628#true} is VALID [2018-11-14 19:12:43,918 INFO L273 TraceCheckUtils]: 17: Hoare triple {628#true} #t~short2 := ~i~0 < 20; {630#(or (not |main_#t~short2|) (<= main_~i~0 19))} is VALID [2018-11-14 19:12:43,919 INFO L273 TraceCheckUtils]: 18: Hoare triple {630#(or (not |main_#t~short2|) (<= main_~i~0 19))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := #t~nondet1 != 0; {631#(<= main_~i~0 19)} is VALID [2018-11-14 19:12:43,921 INFO L273 TraceCheckUtils]: 19: Hoare triple {631#(<= main_~i~0 19)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {631#(<= main_~i~0 19)} is VALID [2018-11-14 19:12:43,921 INFO L273 TraceCheckUtils]: 20: Hoare triple {631#(<= main_~i~0 19)} call write~int(3, ~p~0.base, ~p~0.offset + 0, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {631#(<= main_~i~0 19)} is VALID [2018-11-14 19:12:43,923 INFO L273 TraceCheckUtils]: 21: Hoare triple {631#(<= main_~i~0 19)} assume true; {631#(<= main_~i~0 19)} is VALID [2018-11-14 19:12:43,925 INFO L273 TraceCheckUtils]: 22: Hoare triple {631#(<= main_~i~0 19)} call #t~mem8 := read~int(~p~0.base, ~p~0.offset + 0, 4); {632#(and (<= main_~i~0 19) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem8|))} is VALID [2018-11-14 19:12:43,925 INFO L273 TraceCheckUtils]: 23: Hoare triple {632#(and (<= main_~i~0 19) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem8|))} assume !(#t~mem8 != 3);havoc #t~mem8; {633#(and (<= main_~i~0 19) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-14 19:12:43,927 INFO L273 TraceCheckUtils]: 24: Hoare triple {633#(and (<= main_~i~0 19) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} call #t~mem14 := read~int(~p~0.base, ~p~0.offset + 0, 4); {634#(and (= 3 |main_#t~mem14|) (<= main_~i~0 19))} is VALID [2018-11-14 19:12:43,927 INFO L273 TraceCheckUtils]: 25: Hoare triple {634#(and (= 3 |main_#t~mem14|) (<= main_~i~0 19))} assume #t~mem14 != 3 || ~i~0 > 20;havoc #t~mem14; {629#false} is VALID [2018-11-14 19:12:43,928 INFO L273 TraceCheckUtils]: 26: Hoare triple {629#false} assume !false; {629#false} is VALID [2018-11-14 19:12:43,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 19:12:43,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:12:43,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 19:12:43,930 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-14 19:12:43,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:12:43,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 19:12:43,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:12:43,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 19:12:43,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 19:12:43,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:12:43,964 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 7 states. [2018-11-14 19:12:44,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:44,200 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2018-11-14 19:12:44,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:12:44,200 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-14 19:12:44,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:12:44,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:12:44,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2018-11-14 19:12:44,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:12:44,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2018-11-14 19:12:44,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 56 transitions. [2018-11-14 19:12:44,311 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:12:44,313 INFO L225 Difference]: With dead ends: 47 [2018-11-14 19:12:44,313 INFO L226 Difference]: Without dead ends: 43 [2018-11-14 19:12:44,316 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:12:44,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-14 19:12:44,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2018-11-14 19:12:44,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:12:44,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 37 states. [2018-11-14 19:12:44,344 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 37 states. [2018-11-14 19:12:44,344 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 37 states. [2018-11-14 19:12:44,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:44,347 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2018-11-14 19:12:44,348 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2018-11-14 19:12:44,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:44,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:44,349 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 43 states. [2018-11-14 19:12:44,349 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 43 states. [2018-11-14 19:12:44,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:44,351 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2018-11-14 19:12:44,352 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2018-11-14 19:12:44,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:44,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:44,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:12:44,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:12:44,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 19:12:44,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2018-11-14 19:12:44,355 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 27 [2018-11-14 19:12:44,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:12:44,355 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2018-11-14 19:12:44,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 19:12:44,356 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-14 19:12:44,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 19:12:44,357 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:12:44,357 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:12:44,357 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:12:44,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:12:44,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1621629005, now seen corresponding path program 1 times [2018-11-14 19:12:44,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:12:44,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:12:44,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:44,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:12:44,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:12:44,678 INFO L256 TraceCheckUtils]: 0: Hoare triple {829#true} call ULTIMATE.init(); {829#true} is VALID [2018-11-14 19:12:44,679 INFO L273 TraceCheckUtils]: 1: Hoare triple {829#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {829#true} is VALID [2018-11-14 19:12:44,679 INFO L273 TraceCheckUtils]: 2: Hoare triple {829#true} assume true; {829#true} is VALID [2018-11-14 19:12:44,680 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {829#true} {829#true} #114#return; {829#true} is VALID [2018-11-14 19:12:44,680 INFO L256 TraceCheckUtils]: 4: Hoare triple {829#true} call #t~ret17 := main(); {829#true} is VALID [2018-11-14 19:12:44,681 INFO L273 TraceCheckUtils]: 5: Hoare triple {829#true} havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {831#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-14 19:12:44,682 INFO L273 TraceCheckUtils]: 6: Hoare triple {831#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {831#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-14 19:12:44,683 INFO L273 TraceCheckUtils]: 7: Hoare triple {831#(= (select |#valid| main_~a~0.base) 1)} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~i~0 := 0; {832#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:44,684 INFO L273 TraceCheckUtils]: 8: Hoare triple {832#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {832#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:44,684 INFO L273 TraceCheckUtils]: 9: Hoare triple {832#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} #t~short2 := ~i~0 < 20; {832#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:44,685 INFO L273 TraceCheckUtils]: 10: Hoare triple {832#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := #t~nondet1 != 0; {832#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:44,687 INFO L273 TraceCheckUtils]: 11: Hoare triple {832#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;#t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + 4, 4);havoc #t~nondet4;call #t~mem5 := read~int(~p~0.base, ~p~0.offset + 4, 4); {832#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:44,688 INFO L273 TraceCheckUtils]: 12: Hoare triple {832#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume #t~mem5 != 0;havoc #t~mem5;call write~int(1, ~p~0.base, ~p~0.offset + 0, 4); {833#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:44,689 INFO L273 TraceCheckUtils]: 13: Hoare triple {833#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12);~t~0.base, ~t~0.offset := #t~malloc6.base, #t~malloc6.offset; {834#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:44,691 INFO L273 TraceCheckUtils]: 14: Hoare triple {834#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {834#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:44,692 INFO L273 TraceCheckUtils]: 15: Hoare triple {834#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~p~0.offset + 8, 4);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~p~0.base, ~p~0.offset + 8, 4);~p~0.base, ~p~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {835#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 19:12:44,693 INFO L273 TraceCheckUtils]: 16: Hoare triple {835#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume true; {835#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 19:12:44,694 INFO L273 TraceCheckUtils]: 17: Hoare triple {835#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} #t~short2 := ~i~0 < 20; {835#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 19:12:44,695 INFO L273 TraceCheckUtils]: 18: Hoare triple {835#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := #t~nondet1 != 0; {835#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 19:12:44,695 INFO L273 TraceCheckUtils]: 19: Hoare triple {835#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {835#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 19:12:44,697 INFO L273 TraceCheckUtils]: 20: Hoare triple {835#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} call write~int(3, ~p~0.base, ~p~0.offset + 0, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {836#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:12:44,698 INFO L273 TraceCheckUtils]: 21: Hoare triple {836#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {836#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:12:44,699 INFO L273 TraceCheckUtils]: 22: Hoare triple {836#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem8 := read~int(~p~0.base, ~p~0.offset + 0, 4); {836#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:12:44,699 INFO L273 TraceCheckUtils]: 23: Hoare triple {836#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(#t~mem8 != 3);havoc #t~mem8;call #t~mem9 := read~int(~p~0.base, ~p~0.offset + 4, 4); {836#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:12:44,700 INFO L273 TraceCheckUtils]: 24: Hoare triple {836#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume #t~mem9 != 0;havoc #t~mem9;call #t~mem10 := read~int(~p~0.base, ~p~0.offset + 0, 4); {837#(= 1 |main_#t~mem10|)} is VALID [2018-11-14 19:12:44,701 INFO L273 TraceCheckUtils]: 25: Hoare triple {837#(= 1 |main_#t~mem10|)} assume #t~mem10 != 1;havoc #t~mem10; {830#false} is VALID [2018-11-14 19:12:44,702 INFO L273 TraceCheckUtils]: 26: Hoare triple {830#false} assume !false; {830#false} is VALID [2018-11-14 19:12:44,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:12:44,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:12:44,707 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:12:44,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:12:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:12:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:12:44,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:12:44,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-14 19:12:44,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 19:12:44,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:12:44,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-14 19:12:44,892 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 19:12:44,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 19:12:44,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 19:12:44,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 19:12:45,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:12:45,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:12:45,037 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-14 19:12:45,108 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:12:45,109 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:12:45,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-14 19:12:45,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 19:12:45,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:12:45,123 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-11-14 19:12:45,127 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 19:12:45,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-14 19:12:45,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 19:12:45,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 19:12:45,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:12:45,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 19:12:45,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-11-14 19:12:45,410 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 19:12:45,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-14 19:12:45,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 19:12:45,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 19:12:45,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-14 19:12:45,574 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 19:12:45,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:12:45,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:12:45,584 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-14 19:12:45,586 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 19:12:45,596 INFO L256 TraceCheckUtils]: 0: Hoare triple {829#true} call ULTIMATE.init(); {829#true} is VALID [2018-11-14 19:12:45,597 INFO L273 TraceCheckUtils]: 1: Hoare triple {829#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {829#true} is VALID [2018-11-14 19:12:45,597 INFO L273 TraceCheckUtils]: 2: Hoare triple {829#true} assume true; {829#true} is VALID [2018-11-14 19:12:45,598 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {829#true} {829#true} #114#return; {829#true} is VALID [2018-11-14 19:12:45,598 INFO L256 TraceCheckUtils]: 4: Hoare triple {829#true} call #t~ret17 := main(); {829#true} is VALID [2018-11-14 19:12:45,599 INFO L273 TraceCheckUtils]: 5: Hoare triple {829#true} havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {831#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-14 19:12:45,600 INFO L273 TraceCheckUtils]: 6: Hoare triple {831#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {831#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-14 19:12:45,601 INFO L273 TraceCheckUtils]: 7: Hoare triple {831#(= (select |#valid| main_~a~0.base) 1)} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~i~0 := 0; {832#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:45,602 INFO L273 TraceCheckUtils]: 8: Hoare triple {832#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {832#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:45,603 INFO L273 TraceCheckUtils]: 9: Hoare triple {832#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} #t~short2 := ~i~0 < 20; {832#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:45,604 INFO L273 TraceCheckUtils]: 10: Hoare triple {832#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := #t~nondet1 != 0; {832#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:45,605 INFO L273 TraceCheckUtils]: 11: Hoare triple {832#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;#t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + 4, 4);havoc #t~nondet4;call #t~mem5 := read~int(~p~0.base, ~p~0.offset + 4, 4); {832#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:45,607 INFO L273 TraceCheckUtils]: 12: Hoare triple {832#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume #t~mem5 != 0;havoc #t~mem5;call write~int(1, ~p~0.base, ~p~0.offset + 0, 4); {833#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:45,608 INFO L273 TraceCheckUtils]: 13: Hoare triple {833#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12);~t~0.base, ~t~0.offset := #t~malloc6.base, #t~malloc6.offset; {834#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:45,609 INFO L273 TraceCheckUtils]: 14: Hoare triple {834#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {834#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:45,625 INFO L273 TraceCheckUtils]: 15: Hoare triple {834#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~p~0.offset + 8, 4);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~p~0.base, ~p~0.offset + 8, 4);~p~0.base, ~p~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {886#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 19:12:45,626 INFO L273 TraceCheckUtils]: 16: Hoare triple {886#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume true; {886#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 19:12:45,626 INFO L273 TraceCheckUtils]: 17: Hoare triple {886#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} #t~short2 := ~i~0 < 20; {886#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 19:12:45,627 INFO L273 TraceCheckUtils]: 18: Hoare triple {886#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := #t~nondet1 != 0; {886#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 19:12:45,629 INFO L273 TraceCheckUtils]: 19: Hoare triple {886#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {886#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 19:12:45,631 INFO L273 TraceCheckUtils]: 20: Hoare triple {886#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~int(3, ~p~0.base, ~p~0.offset + 0, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {902#(and (exists ((v_main_~p~0.base_23 Int) (v_main_~p~0.offset_23 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_23) v_main_~p~0.offset_23) 3) (not (= v_main_~p~0.base_23 main_~p~0.base)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-14 19:12:45,632 INFO L273 TraceCheckUtils]: 21: Hoare triple {902#(and (exists ((v_main_~p~0.base_23 Int) (v_main_~p~0.offset_23 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_23) v_main_~p~0.offset_23) 3) (not (= v_main_~p~0.base_23 main_~p~0.base)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume true; {902#(and (exists ((v_main_~p~0.base_23 Int) (v_main_~p~0.offset_23 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_23) v_main_~p~0.offset_23) 3) (not (= v_main_~p~0.base_23 main_~p~0.base)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-14 19:12:45,637 INFO L273 TraceCheckUtils]: 22: Hoare triple {902#(and (exists ((v_main_~p~0.base_23 Int) (v_main_~p~0.offset_23 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_23) v_main_~p~0.offset_23) 3) (not (= v_main_~p~0.base_23 main_~p~0.base)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} call #t~mem8 := read~int(~p~0.base, ~p~0.offset + 0, 4); {902#(and (exists ((v_main_~p~0.base_23 Int) (v_main_~p~0.offset_23 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_23) v_main_~p~0.offset_23) 3) (not (= v_main_~p~0.base_23 main_~p~0.base)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-14 19:12:45,642 INFO L273 TraceCheckUtils]: 23: Hoare triple {902#(and (exists ((v_main_~p~0.base_23 Int) (v_main_~p~0.offset_23 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_23) v_main_~p~0.offset_23) 3) (not (= v_main_~p~0.base_23 main_~p~0.base)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume !!(#t~mem8 != 3);havoc #t~mem8;call #t~mem9 := read~int(~p~0.base, ~p~0.offset + 4, 4); {902#(and (exists ((v_main_~p~0.base_23 Int) (v_main_~p~0.offset_23 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_23) v_main_~p~0.offset_23) 3) (not (= v_main_~p~0.base_23 main_~p~0.base)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-14 19:12:45,643 INFO L273 TraceCheckUtils]: 24: Hoare triple {902#(and (exists ((v_main_~p~0.base_23 Int) (v_main_~p~0.offset_23 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_23) v_main_~p~0.offset_23) 3) (not (= v_main_~p~0.base_23 main_~p~0.base)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume #t~mem9 != 0;havoc #t~mem9;call #t~mem10 := read~int(~p~0.base, ~p~0.offset + 0, 4); {837#(= 1 |main_#t~mem10|)} is VALID [2018-11-14 19:12:45,643 INFO L273 TraceCheckUtils]: 25: Hoare triple {837#(= 1 |main_#t~mem10|)} assume #t~mem10 != 1;havoc #t~mem10; {830#false} is VALID [2018-11-14 19:12:45,643 INFO L273 TraceCheckUtils]: 26: Hoare triple {830#false} assume !false; {830#false} is VALID [2018-11-14 19:12:45,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:12:45,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:12:45,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-11-14 19:12:45,680 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-11-14 19:12:45,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:12:45,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 19:12:45,743 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:12:45,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 19:12:45,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 19:12:45,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-14 19:12:45,744 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 11 states. [2018-11-14 19:12:47,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:47,076 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2018-11-14 19:12:47,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 19:12:47,077 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-11-14 19:12:47,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:12:47,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 19:12:47,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 94 transitions. [2018-11-14 19:12:47,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 19:12:47,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 94 transitions. [2018-11-14 19:12:47,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 94 transitions. [2018-11-14 19:12:47,280 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:12:47,282 INFO L225 Difference]: With dead ends: 88 [2018-11-14 19:12:47,283 INFO L226 Difference]: Without dead ends: 86 [2018-11-14 19:12:47,283 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2018-11-14 19:12:47,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-14 19:12:47,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2018-11-14 19:12:47,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:12:47,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 56 states. [2018-11-14 19:12:47,353 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 56 states. [2018-11-14 19:12:47,353 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 56 states. [2018-11-14 19:12:47,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:47,358 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2018-11-14 19:12:47,358 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2018-11-14 19:12:47,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:47,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:47,359 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 86 states. [2018-11-14 19:12:47,359 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 86 states. [2018-11-14 19:12:47,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:47,364 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2018-11-14 19:12:47,364 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2018-11-14 19:12:47,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:47,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:47,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:12:47,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:12:47,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-14 19:12:47,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2018-11-14 19:12:47,368 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 27 [2018-11-14 19:12:47,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:12:47,369 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2018-11-14 19:12:47,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 19:12:47,369 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2018-11-14 19:12:47,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 19:12:47,370 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:12:47,370 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:12:47,370 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:12:47,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:12:47,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1621635949, now seen corresponding path program 1 times [2018-11-14 19:12:47,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:12:47,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:12:47,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:47,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:12:47,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:12:47,929 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:128) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-14 19:12:47,935 INFO L168 Benchmark]: Toolchain (without parser) took 8950.72 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 753.4 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -206.4 MB). Peak memory consumption was 547.0 MB. Max. memory is 7.1 GB. [2018-11-14 19:12:47,937 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:12:47,937 INFO L168 Benchmark]: CACSL2BoogieTranslator took 622.47 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-14 19:12:47,938 INFO L168 Benchmark]: Boogie Preprocessor took 154.77 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 753.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -834.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2018-11-14 19:12:47,939 INFO L168 Benchmark]: RCFGBuilder took 1074.32 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 51.6 MB). Peak memory consumption was 51.6 MB. Max. memory is 7.1 GB. [2018-11-14 19:12:47,940 INFO L168 Benchmark]: TraceAbstraction took 7094.50 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 545.3 MB). Peak memory consumption was 545.3 MB. Max. memory is 7.1 GB. [2018-11-14 19:12:47,944 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 622.47 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 154.77 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 753.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -834.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1074.32 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 51.6 MB). Peak memory consumption was 51.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7094.50 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 545.3 MB). Peak memory consumption was 545.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...