java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-properties/simple_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:22:20,211 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:22:20,213 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:22:20,226 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:22:20,226 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:22:20,227 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:22:20,229 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:22:20,230 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:22:20,232 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:22:20,233 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:22:20,234 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:22:20,234 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:22:20,235 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:22:20,236 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:22:20,237 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:22:20,238 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:22:20,239 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:22:20,241 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:22:20,243 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:22:20,245 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:22:20,246 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:22:20,247 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:22:20,250 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:22:20,250 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:22:20,250 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:22:20,251 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:22:20,252 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:22:20,253 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:22:20,254 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:22:20,255 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:22:20,255 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:22:20,256 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:22:20,256 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:22:20,256 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:22:20,257 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:22:20,258 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:22:20,259 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:22:20,283 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:22:20,283 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:22:20,284 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:22:20,284 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:22:20,285 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:22:20,285 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:22:20,285 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:22:20,285 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:22:20,285 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:22:20,286 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:22:20,286 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:22:20,286 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:22:20,286 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:22:20,286 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:22:20,287 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:22:20,287 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:22:20,287 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:22:20,287 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:22:20,287 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:22:20,288 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:22:20,288 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:22:20,288 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:22:20,288 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:22:20,288 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:22:20,289 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:22:20,289 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:22:20,289 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:22:20,289 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:22:20,289 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:22:20,290 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:22:20,346 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:22:20,358 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:22:20,362 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:22:20,364 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:22:20,364 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:22:20,365 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/simple_true-unreach-call_false-valid-memtrack.i [2018-11-14 17:22:20,433 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c2c4d121/42d4def2758a408e968a179f5e5376fd/FLAGbc9ab905e [2018-11-14 17:22:20,922 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:22:20,923 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/simple_true-unreach-call_false-valid-memtrack.i [2018-11-14 17:22:20,937 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c2c4d121/42d4def2758a408e968a179f5e5376fd/FLAGbc9ab905e [2018-11-14 17:22:20,952 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c2c4d121/42d4def2758a408e968a179f5e5376fd [2018-11-14 17:22:20,963 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:22:20,965 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:22:20,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:22:20,966 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:22:20,972 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:22:20,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:22:20" (1/1) ... [2018-11-14 17:22:20,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628dd538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:20, skipping insertion in model container [2018-11-14 17:22:20,977 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:22:20" (1/1) ... [2018-11-14 17:22:20,989 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:22:21,055 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:22:21,482 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:22:21,493 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:22:21,537 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:22:21,600 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:22:21,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:21 WrapperNode [2018-11-14 17:22:21,601 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:22:21,602 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:22:21,602 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:22:21,602 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:22:21,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:21" (1/1) ... [2018-11-14 17:22:21,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:21" (1/1) ... [2018-11-14 17:22:21,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:21" (1/1) ... [2018-11-14 17:22:21,712 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:21" (1/1) ... [2018-11-14 17:22:21,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:21" (1/1) ... [2018-11-14 17:22:21,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:21" (1/1) ... [2018-11-14 17:22:21,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:21" (1/1) ... [2018-11-14 17:22:21,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:22:21,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:22:21,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:22:21,781 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:22:21,785 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:21" (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 17:22:21,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:22:21,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:22:21,855 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-14 17:22:21,856 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:22:21,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:22:21,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:22:21,856 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 17:22:21,856 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 17:22:21,856 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 17:22:21,858 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 17:22:21,858 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 17:22:21,858 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 17:22:21,859 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 17:22:21,859 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 17:22:21,859 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 17:22:21,859 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 17:22:21,859 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 17:22:21,859 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 17:22:21,859 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 17:22:21,859 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 17:22:21,859 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 17:22:21,860 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 17:22:21,860 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 17:22:21,860 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 17:22:21,860 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 17:22:21,860 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 17:22:21,861 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 17:22:21,861 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 17:22:21,861 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 17:22:21,861 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 17:22:21,861 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 17:22:21,861 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 17:22:21,861 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 17:22:21,861 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 17:22:21,862 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 17:22:21,862 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 17:22:21,862 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 17:22:21,862 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 17:22:21,862 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 17:22:21,862 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 17:22:21,863 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 17:22:21,863 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 17:22:21,863 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 17:22:21,863 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 17:22:21,863 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 17:22:21,863 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 17:22:21,863 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 17:22:21,864 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 17:22:21,864 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 17:22:21,864 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 17:22:21,864 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 17:22:21,864 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 17:22:21,864 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 17:22:21,864 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 17:22:21,865 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 17:22:21,865 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 17:22:21,865 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 17:22:21,866 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 17:22:21,866 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 17:22:21,866 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 17:22:21,866 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 17:22:21,866 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 17:22:21,866 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 17:22:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 17:22:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 17:22:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 17:22:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 17:22:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 17:22:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 17:22:21,868 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 17:22:21,868 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-11-14 17:22:21,868 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 17:22:21,868 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 17:22:21,868 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 17:22:21,868 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 17:22:21,868 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 17:22:21,869 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 17:22:21,869 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 17:22:21,869 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 17:22:21,869 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 17:22:21,869 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 17:22:21,869 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 17:22:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 17:22:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 17:22:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 17:22:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 17:22:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 17:22:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 17:22:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 17:22:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 17:22:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 17:22:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 17:22:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 17:22:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 17:22:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 17:22:21,872 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 17:22:21,872 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 17:22:21,872 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 17:22:21,872 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 17:22:21,872 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 17:22:21,872 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 17:22:21,872 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 17:22:21,873 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 17:22:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 17:22:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 17:22:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 17:22:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 17:22:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:22:21,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:22:21,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:22:21,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 17:22:21,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 17:22:21,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:22:21,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:22:21,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:22:21,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:22:21,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:22:22,588 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:22:22,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:22:22 BoogieIcfgContainer [2018-11-14 17:22:22,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:22:22,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:22:22,590 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:22:22,594 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:22:22,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:22:20" (1/3) ... [2018-11-14 17:22:22,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64bdfe7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:22:22, skipping insertion in model container [2018-11-14 17:22:22,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:21" (2/3) ... [2018-11-14 17:22:22,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64bdfe7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:22:22, skipping insertion in model container [2018-11-14 17:22:22,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:22:22" (3/3) ... [2018-11-14 17:22:22,598 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_true-unreach-call_false-valid-memtrack.i [2018-11-14 17:22:22,608 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:22:22,617 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:22:22,636 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:22:22,670 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:22:22,671 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:22:22,671 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:22:22,671 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:22:22,671 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:22:22,672 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:22:22,672 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:22:22,672 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:22:22,672 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:22:22,692 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-14 17:22:22,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 17:22:22,699 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:22,701 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:22:22,703 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:22,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:22,710 INFO L82 PathProgramCache]: Analyzing trace with hash 2008060971, now seen corresponding path program 1 times [2018-11-14 17:22:22,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:22,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:22,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:22,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:22,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:22,934 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-14 17:22:22,939 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32#true} is VALID [2018-11-14 17:22:22,939 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-14 17:22:22,940 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #71#return; {32#true} is VALID [2018-11-14 17:22:22,940 INFO L256 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2018-11-14 17:22:22,941 INFO L273 TraceCheckUtils]: 5: Hoare triple {32#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {32#true} is VALID [2018-11-14 17:22:22,941 INFO L273 TraceCheckUtils]: 6: Hoare triple {32#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {32#true} is VALID [2018-11-14 17:22:22,941 INFO L273 TraceCheckUtils]: 7: Hoare triple {32#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {32#true} is VALID [2018-11-14 17:22:22,942 INFO L273 TraceCheckUtils]: 8: Hoare triple {32#true} assume !true; {33#false} is VALID [2018-11-14 17:22:22,943 INFO L273 TraceCheckUtils]: 9: Hoare triple {33#false} call write~int(1, ~p~0.base, ~p~0.offset + 0, 4);call write~$Pointer$(0, 0, ~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {33#false} is VALID [2018-11-14 17:22:22,943 INFO L273 TraceCheckUtils]: 10: Hoare triple {33#false} assume true; {33#false} is VALID [2018-11-14 17:22:22,943 INFO L273 TraceCheckUtils]: 11: Hoare triple {33#false} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem4 := read~int(~p~0.base, ~p~0.offset + 0, 4); {33#false} is VALID [2018-11-14 17:22:22,944 INFO L273 TraceCheckUtils]: 12: Hoare triple {33#false} assume #t~mem4 != 1;havoc #t~mem4; {33#false} is VALID [2018-11-14 17:22:22,944 INFO L273 TraceCheckUtils]: 13: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-14 17:22:22,947 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 17:22:22,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:22:22,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:22:22,955 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-14 17:22:22,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:22:22,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:22:23,082 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 17:22:23,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:22:23,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:22:23,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:22:23,094 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-14 17:22:23,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:23,285 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-11-14 17:22:23,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:22:23,286 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-14 17:22:23,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:22:23,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:22:23,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2018-11-14 17:22:23,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:22:23,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2018-11-14 17:22:23,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 48 transitions. [2018-11-14 17:22:23,471 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:23,483 INFO L225 Difference]: With dead ends: 41 [2018-11-14 17:22:23,483 INFO L226 Difference]: Without dead ends: 20 [2018-11-14 17:22:23,487 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 17:22:23,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-14 17:22:23,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-14 17:22:23,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:22:23,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-14 17:22:23,524 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 17:22:23,524 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 17:22:23,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:23,528 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-14 17:22:23,529 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-14 17:22:23,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:23,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:23,530 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 17:22:23,530 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 17:22:23,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:23,534 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-14 17:22:23,534 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-14 17:22:23,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:23,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:23,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:22:23,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:22:23,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 17:22:23,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-14 17:22:23,539 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2018-11-14 17:22:23,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:22:23,540 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-14 17:22:23,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:22:23,540 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-14 17:22:23,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 17:22:23,541 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:23,541 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:22:23,541 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:23,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:23,542 INFO L82 PathProgramCache]: Analyzing trace with hash -984219335, now seen corresponding path program 1 times [2018-11-14 17:22:23,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:23,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:23,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:23,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:23,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:24,026 INFO L256 TraceCheckUtils]: 0: Hoare triple {153#true} call ULTIMATE.init(); {153#true} is VALID [2018-11-14 17:22:24,026 INFO L273 TraceCheckUtils]: 1: Hoare triple {153#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {153#true} is VALID [2018-11-14 17:22:24,027 INFO L273 TraceCheckUtils]: 2: Hoare triple {153#true} assume true; {153#true} is VALID [2018-11-14 17:22:24,027 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {153#true} {153#true} #71#return; {153#true} is VALID [2018-11-14 17:22:24,027 INFO L256 TraceCheckUtils]: 4: Hoare triple {153#true} call #t~ret6 := main(); {153#true} is VALID [2018-11-14 17:22:24,027 INFO L273 TraceCheckUtils]: 5: Hoare triple {153#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {153#true} is VALID [2018-11-14 17:22:24,028 INFO L273 TraceCheckUtils]: 6: Hoare triple {153#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {153#true} is VALID [2018-11-14 17:22:24,031 INFO L273 TraceCheckUtils]: 7: Hoare triple {153#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {155#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:24,032 INFO L273 TraceCheckUtils]: 8: Hoare triple {155#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {155#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:24,033 INFO L273 TraceCheckUtils]: 9: Hoare triple {155#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {155#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:24,034 INFO L273 TraceCheckUtils]: 10: Hoare triple {155#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(#t~nondet1 != 0);havoc #t~nondet1; {155#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:24,037 INFO L273 TraceCheckUtils]: 11: Hoare triple {155#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~int(1, ~p~0.base, ~p~0.offset + 0, 4);call write~$Pointer$(0, 0, ~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {156#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 17:22:24,038 INFO L273 TraceCheckUtils]: 12: Hoare triple {156#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {156#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 17:22:24,039 INFO L273 TraceCheckUtils]: 13: Hoare triple {156#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem4 := read~int(~p~0.base, ~p~0.offset + 0, 4); {157#(= |main_#t~mem4| 1)} is VALID [2018-11-14 17:22:24,040 INFO L273 TraceCheckUtils]: 14: Hoare triple {157#(= |main_#t~mem4| 1)} assume #t~mem4 != 1;havoc #t~mem4; {154#false} is VALID [2018-11-14 17:22:24,040 INFO L273 TraceCheckUtils]: 15: Hoare triple {154#false} assume !false; {154#false} is VALID [2018-11-14 17:22:24,044 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 17:22:24,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:22:24,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:22:24,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-14 17:22:24,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:22:24,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:22:24,139 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:24,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:22:24,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:22:24,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:22:24,140 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2018-11-14 17:22:24,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:24,620 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-14 17:22:24,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:22:24,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-14 17:22:24,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:22:24,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:22:24,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2018-11-14 17:22:24,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:22:24,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2018-11-14 17:22:24,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2018-11-14 17:22:24,707 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:24,711 INFO L225 Difference]: With dead ends: 38 [2018-11-14 17:22:24,711 INFO L226 Difference]: Without dead ends: 36 [2018-11-14 17:22:24,713 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:22:24,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-14 17:22:24,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-11-14 17:22:24,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:22:24,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 27 states. [2018-11-14 17:22:24,730 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 27 states. [2018-11-14 17:22:24,730 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 27 states. [2018-11-14 17:22:24,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:24,734 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-14 17:22:24,734 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-14 17:22:24,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:24,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:24,735 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 36 states. [2018-11-14 17:22:24,735 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 36 states. [2018-11-14 17:22:24,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:24,739 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-14 17:22:24,739 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-14 17:22:24,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:24,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:24,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:22:24,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:22:24,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 17:22:24,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-14 17:22:24,743 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 16 [2018-11-14 17:22:24,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:22:24,743 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-14 17:22:24,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:22:24,744 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-14 17:22:24,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 17:22:24,745 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:24,745 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:22:24,745 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:24,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:24,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1148372801, now seen corresponding path program 1 times [2018-11-14 17:22:24,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:24,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:24,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:24,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:24,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:25,091 INFO L256 TraceCheckUtils]: 0: Hoare triple {318#true} call ULTIMATE.init(); {318#true} is VALID [2018-11-14 17:22:25,092 INFO L273 TraceCheckUtils]: 1: Hoare triple {318#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {318#true} is VALID [2018-11-14 17:22:25,092 INFO L273 TraceCheckUtils]: 2: Hoare triple {318#true} assume true; {318#true} is VALID [2018-11-14 17:22:25,093 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {318#true} {318#true} #71#return; {318#true} is VALID [2018-11-14 17:22:25,093 INFO L256 TraceCheckUtils]: 4: Hoare triple {318#true} call #t~ret6 := main(); {318#true} is VALID [2018-11-14 17:22:25,094 INFO L273 TraceCheckUtils]: 5: Hoare triple {318#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {320#(= 0 main_~a~0.offset)} is VALID [2018-11-14 17:22:25,095 INFO L273 TraceCheckUtils]: 6: Hoare triple {320#(= 0 main_~a~0.offset)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {320#(= 0 main_~a~0.offset)} is VALID [2018-11-14 17:22:25,096 INFO L273 TraceCheckUtils]: 7: Hoare triple {320#(= 0 main_~a~0.offset)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {321#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:25,097 INFO L273 TraceCheckUtils]: 8: Hoare triple {321#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} assume true; {321#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:25,097 INFO L273 TraceCheckUtils]: 9: Hoare triple {321#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {321#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:25,098 INFO L273 TraceCheckUtils]: 10: Hoare triple {321#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} assume !(#t~nondet1 != 0);havoc #t~nondet1; {321#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:25,100 INFO L273 TraceCheckUtils]: 11: Hoare triple {321#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} call write~int(1, ~p~0.base, ~p~0.offset + 0, 4);call write~$Pointer$(0, 0, ~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {322#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-14 17:22:25,103 INFO L273 TraceCheckUtils]: 12: Hoare triple {322#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume true; {322#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-14 17:22:25,121 INFO L273 TraceCheckUtils]: 13: Hoare triple {322#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem4 := read~int(~p~0.base, ~p~0.offset + 0, 4); {322#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-14 17:22:25,122 INFO L273 TraceCheckUtils]: 14: Hoare triple {322#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !(#t~mem4 != 1);havoc #t~mem4; {322#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-14 17:22:25,123 INFO L273 TraceCheckUtils]: 15: Hoare triple {322#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {323#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} is VALID [2018-11-14 17:22:25,124 INFO L273 TraceCheckUtils]: 16: Hoare triple {323#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} assume true; {323#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} is VALID [2018-11-14 17:22:25,128 INFO L273 TraceCheckUtils]: 17: Hoare triple {323#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem4 := read~int(~p~0.base, ~p~0.offset + 0, 4); {319#false} is VALID [2018-11-14 17:22:25,128 INFO L273 TraceCheckUtils]: 18: Hoare triple {319#false} assume #t~mem4 != 1;havoc #t~mem4; {319#false} is VALID [2018-11-14 17:22:25,128 INFO L273 TraceCheckUtils]: 19: Hoare triple {319#false} assume !false; {319#false} is VALID [2018-11-14 17:22:25,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:22:25,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:22:25,132 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 17:22:25,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:25,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:22:25,549 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 17:22:25,558 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 17:22:25,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:22:25,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:25,587 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 17:22:25,594 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 17:22:25,598 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 17:22:25,600 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:25,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:25,614 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-14 17:22:25,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 11 [2018-11-14 17:22:25,832 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 17:22:25,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:22:25,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:25,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 11 [2018-11-14 17:22:25,857 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 17:22:25,858 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 17:22:25,861 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:25,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:25,868 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-14 17:22:25,874 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:22:25,880 INFO L256 TraceCheckUtils]: 0: Hoare triple {318#true} call ULTIMATE.init(); {318#true} is VALID [2018-11-14 17:22:25,881 INFO L273 TraceCheckUtils]: 1: Hoare triple {318#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {318#true} is VALID [2018-11-14 17:22:25,881 INFO L273 TraceCheckUtils]: 2: Hoare triple {318#true} assume true; {318#true} is VALID [2018-11-14 17:22:25,882 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {318#true} {318#true} #71#return; {318#true} is VALID [2018-11-14 17:22:25,882 INFO L256 TraceCheckUtils]: 4: Hoare triple {318#true} call #t~ret6 := main(); {318#true} is VALID [2018-11-14 17:22:25,885 INFO L273 TraceCheckUtils]: 5: Hoare triple {318#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {320#(= 0 main_~a~0.offset)} is VALID [2018-11-14 17:22:25,887 INFO L273 TraceCheckUtils]: 6: Hoare triple {320#(= 0 main_~a~0.offset)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {320#(= 0 main_~a~0.offset)} is VALID [2018-11-14 17:22:25,887 INFO L273 TraceCheckUtils]: 7: Hoare triple {320#(= 0 main_~a~0.offset)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {321#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:25,893 INFO L273 TraceCheckUtils]: 8: Hoare triple {321#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} assume true; {321#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:25,895 INFO L273 TraceCheckUtils]: 9: Hoare triple {321#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {321#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:25,895 INFO L273 TraceCheckUtils]: 10: Hoare triple {321#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} assume !(#t~nondet1 != 0);havoc #t~nondet1; {321#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:25,897 INFO L273 TraceCheckUtils]: 11: Hoare triple {321#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} call write~int(1, ~p~0.base, ~p~0.offset + 0, 4);call write~$Pointer$(0, 0, ~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {322#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-14 17:22:25,903 INFO L273 TraceCheckUtils]: 12: Hoare triple {322#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume true; {322#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-14 17:22:25,906 INFO L273 TraceCheckUtils]: 13: Hoare triple {322#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem4 := read~int(~p~0.base, ~p~0.offset + 0, 4); {322#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-14 17:22:25,906 INFO L273 TraceCheckUtils]: 14: Hoare triple {322#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !(#t~mem4 != 1);havoc #t~mem4; {322#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-14 17:22:25,908 INFO L273 TraceCheckUtils]: 15: Hoare triple {322#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {323#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} is VALID [2018-11-14 17:22:25,910 INFO L273 TraceCheckUtils]: 16: Hoare triple {323#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} assume true; {323#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} is VALID [2018-11-14 17:22:25,910 INFO L273 TraceCheckUtils]: 17: Hoare triple {323#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem4 := read~int(~p~0.base, ~p~0.offset + 0, 4); {319#false} is VALID [2018-11-14 17:22:25,911 INFO L273 TraceCheckUtils]: 18: Hoare triple {319#false} assume #t~mem4 != 1;havoc #t~mem4; {319#false} is VALID [2018-11-14 17:22:25,911 INFO L273 TraceCheckUtils]: 19: Hoare triple {319#false} assume !false; {319#false} is VALID [2018-11-14 17:22:25,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:22:25,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:22:25,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-14 17:22:25,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-14 17:22:25,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:22:25,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:22:25,979 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:25,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:22:25,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:22:25,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:22:25,980 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 6 states. [2018-11-14 17:22:26,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:26,417 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-14 17:22:26,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:22:26,418 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-14 17:22:26,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:22:26,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:22:26,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2018-11-14 17:22:26,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:22:26,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2018-11-14 17:22:26,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2018-11-14 17:22:26,568 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:26,571 INFO L225 Difference]: With dead ends: 44 [2018-11-14 17:22:26,571 INFO L226 Difference]: Without dead ends: 31 [2018-11-14 17:22:26,572 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:22:26,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-14 17:22:26,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2018-11-14 17:22:26,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:22:26,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 23 states. [2018-11-14 17:22:26,596 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 23 states. [2018-11-14 17:22:26,596 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 23 states. [2018-11-14 17:22:26,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:26,599 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-14 17:22:26,600 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-14 17:22:26,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:26,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:26,600 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 31 states. [2018-11-14 17:22:26,601 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 31 states. [2018-11-14 17:22:26,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:26,603 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-14 17:22:26,603 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-14 17:22:26,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:26,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:26,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:22:26,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:22:26,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 17:22:26,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-14 17:22:26,607 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-11-14 17:22:26,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:22:26,607 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-14 17:22:26,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:22:26,607 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-14 17:22:26,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 17:22:26,608 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:26,608 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:22:26,609 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:26,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:26,609 INFO L82 PathProgramCache]: Analyzing trace with hash -577286192, now seen corresponding path program 1 times [2018-11-14 17:22:26,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:26,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:26,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:26,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:26,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:26,813 INFO L256 TraceCheckUtils]: 0: Hoare triple {534#true} call ULTIMATE.init(); {534#true} is VALID [2018-11-14 17:22:26,814 INFO L273 TraceCheckUtils]: 1: Hoare triple {534#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {534#true} is VALID [2018-11-14 17:22:26,814 INFO L273 TraceCheckUtils]: 2: Hoare triple {534#true} assume true; {534#true} is VALID [2018-11-14 17:22:26,815 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {534#true} {534#true} #71#return; {534#true} is VALID [2018-11-14 17:22:26,815 INFO L256 TraceCheckUtils]: 4: Hoare triple {534#true} call #t~ret6 := main(); {534#true} is VALID [2018-11-14 17:22:26,816 INFO L273 TraceCheckUtils]: 5: Hoare triple {534#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {536#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-14 17:22:26,817 INFO L273 TraceCheckUtils]: 6: Hoare triple {536#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {536#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-14 17:22:26,818 INFO L273 TraceCheckUtils]: 7: Hoare triple {536#(= (select |#valid| main_~a~0.base) 1)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {537#(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 17:22:26,819 INFO L273 TraceCheckUtils]: 8: Hoare triple {537#(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; {537#(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 17:22:26,820 INFO L273 TraceCheckUtils]: 9: Hoare triple {537#(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 -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {537#(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 17:22:26,821 INFO L273 TraceCheckUtils]: 10: Hoare triple {537#(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~nondet1 != 0);havoc #t~nondet1;call write~int(1, ~p~0.base, ~p~0.offset + 0, 4);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; {538#(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 17:22:26,822 INFO L273 TraceCheckUtils]: 11: Hoare triple {538#(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); {538#(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 17:22:26,824 INFO L273 TraceCheckUtils]: 12: Hoare triple {538#(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 + 4, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {539#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 1)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 17:22:26,825 INFO L273 TraceCheckUtils]: 13: Hoare triple {539#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 1)) main_~a~0.base) main_~a~0.offset))} assume true; {539#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 1)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 17:22:26,826 INFO L273 TraceCheckUtils]: 14: Hoare triple {539#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 1)) main_~a~0.base) main_~a~0.offset))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {539#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 1)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 17:22:26,827 INFO L273 TraceCheckUtils]: 15: Hoare triple {539#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 1)) main_~a~0.base) main_~a~0.offset))} assume !(#t~nondet1 != 0);havoc #t~nondet1; {539#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 1)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 17:22:26,828 INFO L273 TraceCheckUtils]: 16: Hoare triple {539#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 1)) main_~a~0.base) main_~a~0.offset))} call write~int(1, ~p~0.base, ~p~0.offset + 0, 4);call write~$Pointer$(0, 0, ~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {540#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 17:22:26,829 INFO L273 TraceCheckUtils]: 17: Hoare triple {540#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {540#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 17:22:26,830 INFO L273 TraceCheckUtils]: 18: Hoare triple {540#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem4 := read~int(~p~0.base, ~p~0.offset + 0, 4); {541#(= |main_#t~mem4| 1)} is VALID [2018-11-14 17:22:26,831 INFO L273 TraceCheckUtils]: 19: Hoare triple {541#(= |main_#t~mem4| 1)} assume #t~mem4 != 1;havoc #t~mem4; {535#false} is VALID [2018-11-14 17:22:26,832 INFO L273 TraceCheckUtils]: 20: Hoare triple {535#false} assume !false; {535#false} is VALID [2018-11-14 17:22:26,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:22:26,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:22:26,835 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:22:26,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:26,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:22:26,976 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 17:22:27,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 17:22:27,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:27,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-14 17:22:27,054 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:22:27,192 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:22:27,194 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:22:27,196 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 17:22:27,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 17:22:27,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 17:22:27,229 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 17:22:27,233 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 17:22:27,235 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:27,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:27,245 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2018-11-14 17:22:27,249 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:22:27,330 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 17:22:27,335 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 17:22:27,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:22:27,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:27,353 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 17:22:27,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-11-14 17:22:27,358 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:22:27,411 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 17:22:27,426 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 17:22:27,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:22:27,440 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 17:22:27,443 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 17:22:27,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:27,450 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 17:22:27,451 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-14 17:22:27,454 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:22:27,460 INFO L256 TraceCheckUtils]: 0: Hoare triple {534#true} call ULTIMATE.init(); {534#true} is VALID [2018-11-14 17:22:27,461 INFO L273 TraceCheckUtils]: 1: Hoare triple {534#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {534#true} is VALID [2018-11-14 17:22:27,461 INFO L273 TraceCheckUtils]: 2: Hoare triple {534#true} assume true; {534#true} is VALID [2018-11-14 17:22:27,462 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {534#true} {534#true} #71#return; {534#true} is VALID [2018-11-14 17:22:27,462 INFO L256 TraceCheckUtils]: 4: Hoare triple {534#true} call #t~ret6 := main(); {534#true} is VALID [2018-11-14 17:22:27,463 INFO L273 TraceCheckUtils]: 5: Hoare triple {534#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {536#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-14 17:22:27,464 INFO L273 TraceCheckUtils]: 6: Hoare triple {536#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {536#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-14 17:22:27,464 INFO L273 TraceCheckUtils]: 7: Hoare triple {536#(= (select |#valid| main_~a~0.base) 1)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {537#(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 17:22:27,465 INFO L273 TraceCheckUtils]: 8: Hoare triple {537#(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; {537#(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 17:22:27,466 INFO L273 TraceCheckUtils]: 9: Hoare triple {537#(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 -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {537#(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 17:22:27,472 INFO L273 TraceCheckUtils]: 10: Hoare triple {537#(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~nondet1 != 0);havoc #t~nondet1;call write~int(1, ~p~0.base, ~p~0.offset + 0, 4);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; {538#(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 17:22:27,473 INFO L273 TraceCheckUtils]: 11: Hoare triple {538#(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); {538#(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 17:22:27,474 INFO L273 TraceCheckUtils]: 12: Hoare triple {538#(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 + 4, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {581#(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 17:22:27,474 INFO L273 TraceCheckUtils]: 13: Hoare triple {581#(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; {581#(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 17:22:27,475 INFO L273 TraceCheckUtils]: 14: Hoare triple {581#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {581#(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 17:22:27,480 INFO L273 TraceCheckUtils]: 15: Hoare triple {581#(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~nondet1 != 0);havoc #t~nondet1; {581#(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 17:22:27,488 INFO L273 TraceCheckUtils]: 16: Hoare triple {581#(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(1, ~p~0.base, ~p~0.offset + 0, 4);call write~$Pointer$(0, 0, ~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {594#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_14 Int) (v_main_~p~0.offset_14 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_14) v_main_~p~0.offset_14) 1) (not (= v_main_~p~0.base_14 main_~p~0.base)))))} is VALID [2018-11-14 17:22:27,493 INFO L273 TraceCheckUtils]: 17: Hoare triple {594#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_14 Int) (v_main_~p~0.offset_14 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_14) v_main_~p~0.offset_14) 1) (not (= v_main_~p~0.base_14 main_~p~0.base)))))} assume true; {594#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_14 Int) (v_main_~p~0.offset_14 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_14) v_main_~p~0.offset_14) 1) (not (= v_main_~p~0.base_14 main_~p~0.base)))))} is VALID [2018-11-14 17:22:27,496 INFO L273 TraceCheckUtils]: 18: Hoare triple {594#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_14 Int) (v_main_~p~0.offset_14 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_14) v_main_~p~0.offset_14) 1) (not (= v_main_~p~0.base_14 main_~p~0.base)))))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem4 := read~int(~p~0.base, ~p~0.offset + 0, 4); {541#(= |main_#t~mem4| 1)} is VALID [2018-11-14 17:22:27,496 INFO L273 TraceCheckUtils]: 19: Hoare triple {541#(= |main_#t~mem4| 1)} assume #t~mem4 != 1;havoc #t~mem4; {535#false} is VALID [2018-11-14 17:22:27,496 INFO L273 TraceCheckUtils]: 20: Hoare triple {535#false} assume !false; {535#false} is VALID [2018-11-14 17:22:27,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:22:27,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:22:27,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-14 17:22:27,519 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-11-14 17:22:27,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:22:27,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 17:22:27,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:27,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 17:22:27,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 17:22:27,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:22:27,632 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 10 states. [2018-11-14 17:22:28,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:28,654 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-11-14 17:22:28,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 17:22:28,654 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-11-14 17:22:28,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:22:28,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:22:28,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 50 transitions. [2018-11-14 17:22:28,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:22:28,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 50 transitions. [2018-11-14 17:22:28,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 50 transitions. [2018-11-14 17:22:28,809 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:28,812 INFO L225 Difference]: With dead ends: 47 [2018-11-14 17:22:28,812 INFO L226 Difference]: Without dead ends: 45 [2018-11-14 17:22:28,813 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-11-14 17:22:28,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-14 17:22:28,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 26. [2018-11-14 17:22:28,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:22:28,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 26 states. [2018-11-14 17:22:28,853 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 26 states. [2018-11-14 17:22:28,853 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 26 states. [2018-11-14 17:22:28,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:28,856 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-11-14 17:22:28,857 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-11-14 17:22:28,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:28,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:28,858 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 45 states. [2018-11-14 17:22:28,858 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 45 states. [2018-11-14 17:22:28,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:28,861 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-11-14 17:22:28,861 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-11-14 17:22:28,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:28,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:28,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:22:28,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:22:28,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:22:28,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-11-14 17:22:28,864 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 21 [2018-11-14 17:22:28,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:22:28,864 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-14 17:22:28,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 17:22:28,865 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-14 17:22:28,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 17:22:28,865 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:28,866 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:22:28,866 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:28,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:28,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1481837992, now seen corresponding path program 1 times [2018-11-14 17:22:28,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:28,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:28,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:28,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:28,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:29,132 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 17:22:29,136 INFO L168 Benchmark]: Toolchain (without parser) took 8172.77 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.6 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -288.4 MB). Peak memory consumption was 458.2 MB. Max. memory is 7.1 GB. [2018-11-14 17:22:29,138 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:22:29,139 INFO L168 Benchmark]: CACSL2BoogieTranslator took 635.16 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 17:22:29,140 INFO L168 Benchmark]: Boogie Preprocessor took 179.27 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -828.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2018-11-14 17:22:29,141 INFO L168 Benchmark]: RCFGBuilder took 808.34 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 51.4 MB). Peak memory consumption was 51.4 MB. Max. memory is 7.1 GB. [2018-11-14 17:22:29,141 INFO L168 Benchmark]: TraceAbstraction took 6544.96 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 456.8 MB). Peak memory consumption was 456.8 MB. Max. memory is 7.1 GB. [2018-11-14 17:22:29,145 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 635.16 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 179.27 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -828.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 808.34 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 51.4 MB). Peak memory consumption was 51.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6544.96 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 456.8 MB). Peak memory consumption was 456.8 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...