java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/heap-manipulation/tree_false-unreach-call_false-valid-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 23:44:47,728 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 23:44:47,731 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 23:44:47,745 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 23:44:47,746 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 23:44:47,747 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 23:44:47,749 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 23:44:47,752 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 23:44:47,753 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 23:44:47,755 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 23:44:47,757 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 23:44:47,757 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 23:44:47,758 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 23:44:47,759 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 23:44:47,761 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 23:44:47,762 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 23:44:47,763 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 23:44:47,769 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 23:44:47,771 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 23:44:47,778 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 23:44:47,779 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 23:44:47,780 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 23:44:47,787 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 23:44:47,787 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 23:44:47,787 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 23:44:47,788 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 23:44:47,791 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 23:44:47,792 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 23:44:47,792 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 23:44:47,793 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 23:44:47,796 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 23:44:47,797 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 23:44:47,797 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 23:44:47,797 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 23:44:47,798 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 23:44:47,801 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 23:44:47,801 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 23:44:47,822 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 23:44:47,822 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 23:44:47,823 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 23:44:47,823 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 23:44:47,824 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 23:44:47,824 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 23:44:47,824 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 23:44:47,824 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 23:44:47,824 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 23:44:47,825 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 23:44:47,825 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 23:44:47,825 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 23:44:47,825 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 23:44:47,825 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 23:44:47,826 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 23:44:47,826 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 23:44:47,826 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 23:44:47,826 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 23:44:47,826 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 23:44:47,827 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 23:44:47,827 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 23:44:47,827 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 23:44:47,827 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 23:44:47,827 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:44:47,828 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 23:44:47,828 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 23:44:47,828 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 23:44:47,828 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 23:44:47,828 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 23:44:47,829 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 23:44:47,829 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 23:44:47,883 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 23:44:47,901 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 23:44:47,905 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 23:44:47,907 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 23:44:47,908 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 23:44:47,908 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/tree_false-unreach-call_false-valid-memcleanup.i [2018-11-18 23:44:47,977 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/403f0c2a8/1b62884aed764286a1dc060162dc8b15/FLAG35aa25e30 [2018-11-18 23:44:48,521 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 23:44:48,522 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/tree_false-unreach-call_false-valid-memcleanup.i [2018-11-18 23:44:48,543 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/403f0c2a8/1b62884aed764286a1dc060162dc8b15/FLAG35aa25e30 [2018-11-18 23:44:48,808 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/403f0c2a8/1b62884aed764286a1dc060162dc8b15 [2018-11-18 23:44:48,817 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 23:44:48,818 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 23:44:48,819 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 23:44:48,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 23:44:48,823 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 23:44:48,825 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:44:48" (1/1) ... [2018-11-18 23:44:48,828 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a5b935a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:48, skipping insertion in model container [2018-11-18 23:44:48,828 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:44:48" (1/1) ... [2018-11-18 23:44:48,838 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 23:44:48,904 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 23:44:49,360 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:44:49,374 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 23:44:49,443 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:44:49,515 INFO L195 MainTranslator]: Completed translation [2018-11-18 23:44:49,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:49 WrapperNode [2018-11-18 23:44:49,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 23:44:49,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 23:44:49,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 23:44:49,517 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 23:44:49,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:49" (1/1) ... [2018-11-18 23:44:49,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:49" (1/1) ... [2018-11-18 23:44:49,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:49" (1/1) ... [2018-11-18 23:44:49,632 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:49" (1/1) ... [2018-11-18 23:44:49,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:49" (1/1) ... [2018-11-18 23:44:49,681 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:49" (1/1) ... [2018-11-18 23:44:49,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:49" (1/1) ... [2018-11-18 23:44:49,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 23:44:49,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 23:44:49,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 23:44:49,697 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 23:44:49,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:44:49,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 23:44:49,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 23:44:49,757 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-18 23:44:49,757 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-18 23:44:49,757 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-11-18 23:44:49,757 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2018-11-18 23:44:49,757 INFO L138 BoogieDeclarations]: Found implementation of procedure create_tree [2018-11-18 23:44:49,757 INFO L138 BoogieDeclarations]: Found implementation of procedure free_tree [2018-11-18 23:44:49,758 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 23:44:49,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 23:44:49,758 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-18 23:44:49,758 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-18 23:44:49,758 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-18 23:44:49,759 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-18 23:44:49,759 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-18 23:44:49,759 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-18 23:44:49,759 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-18 23:44:49,759 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-18 23:44:49,760 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-18 23:44:49,760 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-18 23:44:49,760 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-18 23:44:49,760 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-18 23:44:49,760 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-18 23:44:49,761 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-18 23:44:49,761 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-18 23:44:49,761 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-18 23:44:49,761 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-18 23:44:49,761 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-18 23:44:49,762 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-18 23:44:49,762 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-18 23:44:49,762 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-18 23:44:49,762 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-18 23:44:49,762 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-18 23:44:49,762 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-18 23:44:49,763 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-18 23:44:49,763 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-18 23:44:49,763 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-18 23:44:49,763 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-18 23:44:49,763 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-18 23:44:49,763 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-18 23:44:49,764 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-18 23:44:49,764 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-18 23:44:49,764 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-18 23:44:49,764 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-18 23:44:49,764 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-18 23:44:49,765 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-18 23:44:49,765 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-18 23:44:49,765 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-18 23:44:49,765 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-18 23:44:49,765 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-18 23:44:49,765 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-18 23:44:49,765 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-18 23:44:49,766 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-18 23:44:49,766 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-18 23:44:49,766 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-18 23:44:49,766 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-18 23:44:49,766 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-18 23:44:49,766 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-18 23:44:49,766 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-18 23:44:49,767 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-18 23:44:49,767 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-18 23:44:49,767 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-18 23:44:49,767 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 23:44:49,767 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-18 23:44:49,767 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-18 23:44:49,767 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-18 23:44:49,768 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-18 23:44:49,768 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-18 23:44:49,768 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-18 23:44:49,768 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-18 23:44:49,768 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-18 23:44:49,768 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-18 23:44:49,768 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-18 23:44:49,769 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 23:44:49,769 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-18 23:44:49,769 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-18 23:44:49,769 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-18 23:44:49,769 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-18 23:44:49,769 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-18 23:44:49,769 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-18 23:44:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-18 23:44:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-18 23:44:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-18 23:44:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-18 23:44:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-18 23:44:49,771 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-18 23:44:49,771 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-18 23:44:49,771 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-18 23:44:49,771 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-18 23:44:49,771 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-18 23:44:49,771 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-18 23:44:49,772 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-18 23:44:49,772 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-18 23:44:49,772 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-18 23:44:49,772 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-18 23:44:49,772 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-18 23:44:49,773 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-18 23:44:49,773 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-18 23:44:49,773 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-18 23:44:49,773 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-18 23:44:49,773 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-18 23:44:49,773 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-18 23:44:49,774 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-18 23:44:49,774 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-18 23:44:49,774 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-18 23:44:49,774 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-18 23:44:49,774 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-18 23:44:49,775 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-18 23:44:49,775 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-18 23:44:49,775 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-18 23:44:49,775 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-18 23:44:49,775 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-18 23:44:49,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 23:44:49,776 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-11-18 23:44:49,776 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2018-11-18 23:44:49,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 23:44:49,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 23:44:49,776 INFO L130 BoogieDeclarations]: Found specification of procedure create_tree [2018-11-18 23:44:49,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 23:44:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 23:44:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 23:44:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure free_tree [2018-11-18 23:44:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 23:44:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 23:44:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 23:44:49,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 23:44:49,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 23:44:51,040 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 23:44:51,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:44:51 BoogieIcfgContainer [2018-11-18 23:44:51,041 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 23:44:51,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 23:44:51,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 23:44:51,045 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 23:44:51,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:44:48" (1/3) ... [2018-11-18 23:44:51,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c1fe70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:44:51, skipping insertion in model container [2018-11-18 23:44:51,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:44:49" (2/3) ... [2018-11-18 23:44:51,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c1fe70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:44:51, skipping insertion in model container [2018-11-18 23:44:51,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:44:51" (3/3) ... [2018-11-18 23:44:51,049 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_false-unreach-call_false-valid-memcleanup.i [2018-11-18 23:44:51,060 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 23:44:51,070 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 23:44:51,089 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 23:44:51,124 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 23:44:51,125 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 23:44:51,125 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 23:44:51,125 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 23:44:51,125 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 23:44:51,126 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 23:44:51,126 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 23:44:51,126 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 23:44:51,126 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 23:44:51,147 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states. [2018-11-18 23:44:51,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 23:44:51,155 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:44:51,156 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:44:51,158 INFO L423 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:44:51,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:44:51,165 INFO L82 PathProgramCache]: Analyzing trace with hash -887985475, now seen corresponding path program 1 times [2018-11-18 23:44:51,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:44:51,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:44:51,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:44:51,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:44:51,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:44:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:44:51,382 INFO L256 TraceCheckUtils]: 0: Hoare triple {70#true} call ULTIMATE.init(); {70#true} is VALID [2018-11-18 23:44:51,387 INFO L273 TraceCheckUtils]: 1: Hoare triple {70#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {70#true} is VALID [2018-11-18 23:44:51,387 INFO L273 TraceCheckUtils]: 2: Hoare triple {70#true} assume true; {70#true} is VALID [2018-11-18 23:44:51,388 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {70#true} {70#true} #215#return; {70#true} is VALID [2018-11-18 23:44:51,388 INFO L256 TraceCheckUtils]: 4: Hoare triple {70#true} call #t~ret24 := main(); {70#true} is VALID [2018-11-18 23:44:51,389 INFO L256 TraceCheckUtils]: 5: Hoare triple {70#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {70#true} is VALID [2018-11-18 23:44:51,389 INFO L273 TraceCheckUtils]: 6: Hoare triple {70#true} ~nodelast~0.base, ~nodelast~0.offset := 0, 0;~node~0.base, ~node~0.offset := 0, 0; {70#true} is VALID [2018-11-18 23:44:51,402 INFO L273 TraceCheckUtils]: 7: Hoare triple {70#true} assume !true; {71#false} is VALID [2018-11-18 23:44:51,403 INFO L273 TraceCheckUtils]: 8: Hoare triple {71#false} assume ~node~0.base != 0 || ~node~0.offset != 0;call write~$Pointer$(0, 0, ~node~0.base, 8 + ~node~0.offset, 4); {71#false} is VALID [2018-11-18 23:44:51,403 INFO L273 TraceCheckUtils]: 9: Hoare triple {71#false} assume !true; {71#false} is VALID [2018-11-18 23:44:51,404 INFO L273 TraceCheckUtils]: 10: Hoare triple {71#false} #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; {71#false} is VALID [2018-11-18 23:44:51,404 INFO L273 TraceCheckUtils]: 11: Hoare triple {71#false} assume true; {71#false} is VALID [2018-11-18 23:44:51,404 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {71#false} {70#true} #203#return; {71#false} is VALID [2018-11-18 23:44:51,405 INFO L273 TraceCheckUtils]: 13: Hoare triple {71#false} ~data~0.base, ~data~0.offset := #t~ret23.base, #t~ret23.offset;havoc #t~ret23.base, #t~ret23.offset; {71#false} is VALID [2018-11-18 23:44:51,405 INFO L273 TraceCheckUtils]: 14: Hoare triple {71#false} assume !(~data~0.base == 0 && ~data~0.offset == 0); {71#false} is VALID [2018-11-18 23:44:51,406 INFO L256 TraceCheckUtils]: 15: Hoare triple {71#false} call inspect(~data~0.base, ~data~0.offset); {71#false} is VALID [2018-11-18 23:44:51,406 INFO L273 TraceCheckUtils]: 16: Hoare triple {71#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {71#false} is VALID [2018-11-18 23:44:51,406 INFO L273 TraceCheckUtils]: 17: Hoare triple {71#false} assume true; {71#false} is VALID [2018-11-18 23:44:51,407 INFO L273 TraceCheckUtils]: 18: Hoare triple {71#false} assume ~node.base == 0 && ~node.offset == 0; {71#false} is VALID [2018-11-18 23:44:51,407 INFO L256 TraceCheckUtils]: 19: Hoare triple {71#false} call fail(); {71#false} is VALID [2018-11-18 23:44:51,407 INFO L273 TraceCheckUtils]: 20: Hoare triple {71#false} assume !false; {71#false} is VALID [2018-11-18 23:44:51,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:44:51,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:44:51,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 23:44:51,421 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-18 23:44:51,424 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:44:51,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 23:44:51,709 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:44:51,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 23:44:51,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 23:44:51,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:44:51,724 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 2 states. [2018-11-18 23:44:52,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:52,085 INFO L93 Difference]: Finished difference Result 125 states and 186 transitions. [2018-11-18 23:44:52,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 23:44:52,085 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-18 23:44:52,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:44:52,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:44:52,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 186 transitions. [2018-11-18 23:44:52,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:44:52,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 186 transitions. [2018-11-18 23:44:52,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 186 transitions. [2018-11-18 23:44:52,688 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:44:52,703 INFO L225 Difference]: With dead ends: 125 [2018-11-18 23:44:52,704 INFO L226 Difference]: Without dead ends: 44 [2018-11-18 23:44:52,708 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:44:52,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-18 23:44:52,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-18 23:44:52,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:44:52,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-18 23:44:52,804 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-18 23:44:52,804 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-18 23:44:52,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:52,811 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-11-18 23:44:52,812 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-18 23:44:52,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:44:52,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:44:52,813 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-18 23:44:52,813 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-18 23:44:52,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:52,818 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-11-18 23:44:52,818 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-18 23:44:52,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:44:52,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:44:52,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:44:52,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:44:52,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-18 23:44:52,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-11-18 23:44:52,825 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 21 [2018-11-18 23:44:52,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:44:52,825 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-18 23:44:52,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 23:44:52,826 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-18 23:44:52,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 23:44:52,827 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:44:52,827 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:44:52,827 INFO L423 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:44:52,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:44:52,828 INFO L82 PathProgramCache]: Analyzing trace with hash 955978790, now seen corresponding path program 1 times [2018-11-18 23:44:52,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:44:52,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:44:52,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:44:52,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:44:52,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:44:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:44:52,973 INFO L256 TraceCheckUtils]: 0: Hoare triple {374#true} call ULTIMATE.init(); {374#true} is VALID [2018-11-18 23:44:52,974 INFO L273 TraceCheckUtils]: 1: Hoare triple {374#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {374#true} is VALID [2018-11-18 23:44:52,974 INFO L273 TraceCheckUtils]: 2: Hoare triple {374#true} assume true; {374#true} is VALID [2018-11-18 23:44:52,974 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {374#true} {374#true} #215#return; {374#true} is VALID [2018-11-18 23:44:52,975 INFO L256 TraceCheckUtils]: 4: Hoare triple {374#true} call #t~ret24 := main(); {374#true} is VALID [2018-11-18 23:44:52,975 INFO L256 TraceCheckUtils]: 5: Hoare triple {374#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {374#true} is VALID [2018-11-18 23:44:52,980 INFO L273 TraceCheckUtils]: 6: Hoare triple {374#true} ~nodelast~0.base, ~nodelast~0.offset := 0, 0;~node~0.base, ~node~0.offset := 0, 0; {376#(and (= create_tree_~node~0.offset 0) (= create_tree_~node~0.base 0))} is VALID [2018-11-18 23:44:52,980 INFO L273 TraceCheckUtils]: 7: Hoare triple {376#(and (= create_tree_~node~0.offset 0) (= create_tree_~node~0.base 0))} assume true; {376#(and (= create_tree_~node~0.offset 0) (= create_tree_~node~0.base 0))} is VALID [2018-11-18 23:44:52,981 INFO L273 TraceCheckUtils]: 8: Hoare triple {376#(and (= create_tree_~node~0.offset 0) (= create_tree_~node~0.base 0))} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {376#(and (= create_tree_~node~0.offset 0) (= create_tree_~node~0.base 0))} is VALID [2018-11-18 23:44:52,991 INFO L273 TraceCheckUtils]: 9: Hoare triple {376#(and (= create_tree_~node~0.offset 0) (= create_tree_~node~0.base 0))} assume !(0 != #t~nondet7);havoc #t~nondet7; {376#(and (= create_tree_~node~0.offset 0) (= create_tree_~node~0.base 0))} is VALID [2018-11-18 23:44:52,994 INFO L273 TraceCheckUtils]: 10: Hoare triple {376#(and (= create_tree_~node~0.offset 0) (= create_tree_~node~0.base 0))} assume ~node~0.base != 0 || ~node~0.offset != 0;call write~$Pointer$(0, 0, ~node~0.base, 8 + ~node~0.offset, 4); {375#false} is VALID [2018-11-18 23:44:52,994 INFO L273 TraceCheckUtils]: 11: Hoare triple {375#false} assume true; {375#false} is VALID [2018-11-18 23:44:52,994 INFO L273 TraceCheckUtils]: 12: Hoare triple {375#false} assume !(~node~0.base != 0 || ~node~0.offset != 0); {375#false} is VALID [2018-11-18 23:44:52,995 INFO L273 TraceCheckUtils]: 13: Hoare triple {375#false} #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; {375#false} is VALID [2018-11-18 23:44:52,995 INFO L273 TraceCheckUtils]: 14: Hoare triple {375#false} assume true; {375#false} is VALID [2018-11-18 23:44:52,995 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {375#false} {374#true} #203#return; {375#false} is VALID [2018-11-18 23:44:52,995 INFO L273 TraceCheckUtils]: 16: Hoare triple {375#false} ~data~0.base, ~data~0.offset := #t~ret23.base, #t~ret23.offset;havoc #t~ret23.base, #t~ret23.offset; {375#false} is VALID [2018-11-18 23:44:52,995 INFO L273 TraceCheckUtils]: 17: Hoare triple {375#false} assume !(~data~0.base == 0 && ~data~0.offset == 0); {375#false} is VALID [2018-11-18 23:44:52,996 INFO L256 TraceCheckUtils]: 18: Hoare triple {375#false} call inspect(~data~0.base, ~data~0.offset); {375#false} is VALID [2018-11-18 23:44:52,996 INFO L273 TraceCheckUtils]: 19: Hoare triple {375#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {375#false} is VALID [2018-11-18 23:44:52,996 INFO L273 TraceCheckUtils]: 20: Hoare triple {375#false} assume true; {375#false} is VALID [2018-11-18 23:44:52,996 INFO L273 TraceCheckUtils]: 21: Hoare triple {375#false} assume ~node.base == 0 && ~node.offset == 0; {375#false} is VALID [2018-11-18 23:44:52,997 INFO L256 TraceCheckUtils]: 22: Hoare triple {375#false} call fail(); {375#false} is VALID [2018-11-18 23:44:52,997 INFO L273 TraceCheckUtils]: 23: Hoare triple {375#false} assume !false; {375#false} is VALID [2018-11-18 23:44:53,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:44:53,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:44:53,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:44:53,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 23:44:53,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:44:53,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:44:53,066 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:44:53,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:44:53,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:44:53,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:44:53,068 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 3 states. [2018-11-18 23:44:53,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:53,302 INFO L93 Difference]: Finished difference Result 79 states and 93 transitions. [2018-11-18 23:44:53,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:44:53,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 23:44:53,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:44:53,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:44:53,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2018-11-18 23:44:53,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:44:53,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2018-11-18 23:44:53,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2018-11-18 23:44:53,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:44:53,473 INFO L225 Difference]: With dead ends: 79 [2018-11-18 23:44:53,473 INFO L226 Difference]: Without dead ends: 50 [2018-11-18 23:44:53,474 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:44:53,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-18 23:44:53,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-18 23:44:53,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:44:53,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2018-11-18 23:44:53,497 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-18 23:44:53,497 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-18 23:44:53,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:53,502 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-11-18 23:44:53,502 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2018-11-18 23:44:53,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:44:53,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:44:53,503 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-18 23:44:53,504 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-18 23:44:53,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:53,507 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-11-18 23:44:53,508 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2018-11-18 23:44:53,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:44:53,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:44:53,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:44:53,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:44:53,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-18 23:44:53,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2018-11-18 23:44:53,512 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 24 [2018-11-18 23:44:53,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:44:53,512 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2018-11-18 23:44:53,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:44:53,513 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2018-11-18 23:44:53,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 23:44:53,514 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:44:53,514 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:44:53,514 INFO L423 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:44:53,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:44:53,515 INFO L82 PathProgramCache]: Analyzing trace with hash -55138460, now seen corresponding path program 1 times [2018-11-18 23:44:53,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:44:53,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:44:53,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:44:53,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:44:53,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:44:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:44:53,743 INFO L256 TraceCheckUtils]: 0: Hoare triple {646#true} call ULTIMATE.init(); {646#true} is VALID [2018-11-18 23:44:53,743 INFO L273 TraceCheckUtils]: 1: Hoare triple {646#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {646#true} is VALID [2018-11-18 23:44:53,744 INFO L273 TraceCheckUtils]: 2: Hoare triple {646#true} assume true; {646#true} is VALID [2018-11-18 23:44:53,744 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {646#true} {646#true} #215#return; {646#true} is VALID [2018-11-18 23:44:53,744 INFO L256 TraceCheckUtils]: 4: Hoare triple {646#true} call #t~ret24 := main(); {646#true} is VALID [2018-11-18 23:44:53,744 INFO L256 TraceCheckUtils]: 5: Hoare triple {646#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {646#true} is VALID [2018-11-18 23:44:53,749 INFO L273 TraceCheckUtils]: 6: Hoare triple {646#true} ~nodelast~0.base, ~nodelast~0.offset := 0, 0;~node~0.base, ~node~0.offset := 0, 0; {648#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} is VALID [2018-11-18 23:44:53,750 INFO L273 TraceCheckUtils]: 7: Hoare triple {648#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} assume true; {648#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} is VALID [2018-11-18 23:44:53,751 INFO L273 TraceCheckUtils]: 8: Hoare triple {648#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {648#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} is VALID [2018-11-18 23:44:53,751 INFO L273 TraceCheckUtils]: 9: Hoare triple {648#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} assume !(0 != #t~nondet7);havoc #t~nondet7; {648#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} is VALID [2018-11-18 23:44:53,757 INFO L273 TraceCheckUtils]: 10: Hoare triple {648#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} assume !(~node~0.base != 0 || ~node~0.offset != 0); {648#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} is VALID [2018-11-18 23:44:53,776 INFO L273 TraceCheckUtils]: 11: Hoare triple {648#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} assume true; {648#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} is VALID [2018-11-18 23:44:53,789 INFO L273 TraceCheckUtils]: 12: Hoare triple {648#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} assume !(~node~0.base != 0 || ~node~0.offset != 0); {648#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} is VALID [2018-11-18 23:44:53,790 INFO L273 TraceCheckUtils]: 13: Hoare triple {648#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; {649#(and (= 0 |create_tree_#res.base|) (= 0 |create_tree_#res.offset|))} is VALID [2018-11-18 23:44:53,793 INFO L273 TraceCheckUtils]: 14: Hoare triple {649#(and (= 0 |create_tree_#res.base|) (= 0 |create_tree_#res.offset|))} assume true; {649#(and (= 0 |create_tree_#res.base|) (= 0 |create_tree_#res.offset|))} is VALID [2018-11-18 23:44:53,794 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {649#(and (= 0 |create_tree_#res.base|) (= 0 |create_tree_#res.offset|))} {646#true} #203#return; {650#(and (= 0 |main_#t~ret23.base|) (= 0 |main_#t~ret23.offset|))} is VALID [2018-11-18 23:44:53,795 INFO L273 TraceCheckUtils]: 16: Hoare triple {650#(and (= 0 |main_#t~ret23.base|) (= 0 |main_#t~ret23.offset|))} ~data~0.base, ~data~0.offset := #t~ret23.base, #t~ret23.offset;havoc #t~ret23.base, #t~ret23.offset; {651#(and (= 0 main_~data~0.offset) (= 0 main_~data~0.base))} is VALID [2018-11-18 23:44:53,806 INFO L273 TraceCheckUtils]: 17: Hoare triple {651#(and (= 0 main_~data~0.offset) (= 0 main_~data~0.base))} assume !(~data~0.base == 0 && ~data~0.offset == 0); {647#false} is VALID [2018-11-18 23:44:53,806 INFO L256 TraceCheckUtils]: 18: Hoare triple {647#false} call inspect(~data~0.base, ~data~0.offset); {647#false} is VALID [2018-11-18 23:44:53,806 INFO L273 TraceCheckUtils]: 19: Hoare triple {647#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {647#false} is VALID [2018-11-18 23:44:53,807 INFO L273 TraceCheckUtils]: 20: Hoare triple {647#false} assume true; {647#false} is VALID [2018-11-18 23:44:53,807 INFO L273 TraceCheckUtils]: 21: Hoare triple {647#false} assume ~node.base == 0 && ~node.offset == 0; {647#false} is VALID [2018-11-18 23:44:53,807 INFO L256 TraceCheckUtils]: 22: Hoare triple {647#false} call fail(); {647#false} is VALID [2018-11-18 23:44:53,808 INFO L273 TraceCheckUtils]: 23: Hoare triple {647#false} assume !false; {647#false} is VALID [2018-11-18 23:44:53,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:44:53,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:44:53,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 23:44:53,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-18 23:44:53,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:44:53,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 23:44:53,844 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:44:53,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 23:44:53,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 23:44:53,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 23:44:53,845 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand 6 states. [2018-11-18 23:44:54,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:54,220 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2018-11-18 23:44:54,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 23:44:54,220 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-18 23:44:54,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:44:54,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:44:54,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2018-11-18 23:44:54,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:44:54,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2018-11-18 23:44:54,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 112 transitions. [2018-11-18 23:44:54,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:44:54,417 INFO L225 Difference]: With dead ends: 100 [2018-11-18 23:44:54,418 INFO L226 Difference]: Without dead ends: 53 [2018-11-18 23:44:54,419 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 23:44:54,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-18 23:44:54,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-11-18 23:44:54,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:44:54,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 52 states. [2018-11-18 23:44:54,447 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 52 states. [2018-11-18 23:44:54,448 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 52 states. [2018-11-18 23:44:54,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:54,451 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-11-18 23:44:54,451 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-11-18 23:44:54,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:44:54,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:44:54,452 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 53 states. [2018-11-18 23:44:54,452 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 53 states. [2018-11-18 23:44:54,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:54,455 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-11-18 23:44:54,455 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-11-18 23:44:54,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:44:54,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:44:54,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:44:54,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:44:54,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-18 23:44:54,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-11-18 23:44:54,460 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 24 [2018-11-18 23:44:54,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:44:54,460 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-11-18 23:44:54,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 23:44:54,461 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-11-18 23:44:54,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 23:44:54,462 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:44:54,462 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:44:54,463 INFO L423 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:44:54,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:44:54,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1484430908, now seen corresponding path program 1 times [2018-11-18 23:44:54,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:44:54,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:44:54,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:44:54,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:44:54,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:44:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:44:54,555 INFO L256 TraceCheckUtils]: 0: Hoare triple {953#true} call ULTIMATE.init(); {953#true} is VALID [2018-11-18 23:44:54,555 INFO L273 TraceCheckUtils]: 1: Hoare triple {953#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {953#true} is VALID [2018-11-18 23:44:54,556 INFO L273 TraceCheckUtils]: 2: Hoare triple {953#true} assume true; {953#true} is VALID [2018-11-18 23:44:54,556 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {953#true} {953#true} #215#return; {953#true} is VALID [2018-11-18 23:44:54,557 INFO L256 TraceCheckUtils]: 4: Hoare triple {953#true} call #t~ret24 := main(); {953#true} is VALID [2018-11-18 23:44:54,557 INFO L256 TraceCheckUtils]: 5: Hoare triple {953#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {953#true} is VALID [2018-11-18 23:44:54,557 INFO L273 TraceCheckUtils]: 6: Hoare triple {953#true} ~nodelast~0.base, ~nodelast~0.offset := 0, 0;~node~0.base, ~node~0.offset := 0, 0; {953#true} is VALID [2018-11-18 23:44:54,558 INFO L273 TraceCheckUtils]: 7: Hoare triple {953#true} assume true; {953#true} is VALID [2018-11-18 23:44:54,558 INFO L273 TraceCheckUtils]: 8: Hoare triple {953#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {953#true} is VALID [2018-11-18 23:44:54,559 INFO L273 TraceCheckUtils]: 9: Hoare triple {953#true} assume !!(0 != #t~nondet7);havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(16);~node~0.base, ~node~0.offset := #t~malloc8.base, #t~malloc8.offset; {955#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-18 23:44:54,561 INFO L273 TraceCheckUtils]: 10: Hoare triple {955#(not (= create_tree_~node~0.base 0))} assume !(~node~0.base == 0 && ~node~0.offset == 0); {955#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-18 23:44:54,561 INFO L273 TraceCheckUtils]: 11: Hoare triple {955#(not (= create_tree_~node~0.base 0))} call write~$Pointer$(0, 0, ~node~0.base, ~node~0.offset, 4);call write~$Pointer$(~nodelast~0.base, ~nodelast~0.offset, ~node~0.base, 4 + ~node~0.offset, 4); {955#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-18 23:44:54,563 INFO L273 TraceCheckUtils]: 12: Hoare triple {955#(not (= create_tree_~node~0.base 0))} assume !(~nodelast~0.base != 0 || ~nodelast~0.offset != 0); {955#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-18 23:44:54,563 INFO L273 TraceCheckUtils]: 13: Hoare triple {955#(not (= create_tree_~node~0.base 0))} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~value~0 := #t~nondet9;havoc #t~nondet9;call write~int(~value~0, ~node~0.base, 12 + ~node~0.offset, 4);~nodelast~0.base, ~nodelast~0.offset := ~node~0.base, ~node~0.offset; {955#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-18 23:44:54,565 INFO L273 TraceCheckUtils]: 14: Hoare triple {955#(not (= create_tree_~node~0.base 0))} assume true; {955#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-18 23:44:54,567 INFO L273 TraceCheckUtils]: 15: Hoare triple {955#(not (= create_tree_~node~0.base 0))} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {955#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-18 23:44:54,569 INFO L273 TraceCheckUtils]: 16: Hoare triple {955#(not (= create_tree_~node~0.base 0))} assume !(0 != #t~nondet7);havoc #t~nondet7; {955#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-18 23:44:54,569 INFO L273 TraceCheckUtils]: 17: Hoare triple {955#(not (= create_tree_~node~0.base 0))} assume ~node~0.base != 0 || ~node~0.offset != 0;call write~$Pointer$(0, 0, ~node~0.base, 8 + ~node~0.offset, 4); {955#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-18 23:44:54,572 INFO L273 TraceCheckUtils]: 18: Hoare triple {955#(not (= create_tree_~node~0.base 0))} assume true; {955#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-18 23:44:54,572 INFO L273 TraceCheckUtils]: 19: Hoare triple {955#(not (= create_tree_~node~0.base 0))} assume !(~node~0.base != 0 || ~node~0.offset != 0); {954#false} is VALID [2018-11-18 23:44:54,572 INFO L273 TraceCheckUtils]: 20: Hoare triple {954#false} #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; {954#false} is VALID [2018-11-18 23:44:54,573 INFO L273 TraceCheckUtils]: 21: Hoare triple {954#false} assume true; {954#false} is VALID [2018-11-18 23:44:54,573 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {954#false} {953#true} #203#return; {954#false} is VALID [2018-11-18 23:44:54,573 INFO L273 TraceCheckUtils]: 23: Hoare triple {954#false} ~data~0.base, ~data~0.offset := #t~ret23.base, #t~ret23.offset;havoc #t~ret23.base, #t~ret23.offset; {954#false} is VALID [2018-11-18 23:44:54,574 INFO L273 TraceCheckUtils]: 24: Hoare triple {954#false} assume !(~data~0.base == 0 && ~data~0.offset == 0); {954#false} is VALID [2018-11-18 23:44:54,574 INFO L256 TraceCheckUtils]: 25: Hoare triple {954#false} call inspect(~data~0.base, ~data~0.offset); {954#false} is VALID [2018-11-18 23:44:54,574 INFO L273 TraceCheckUtils]: 26: Hoare triple {954#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {954#false} is VALID [2018-11-18 23:44:54,575 INFO L273 TraceCheckUtils]: 27: Hoare triple {954#false} assume true; {954#false} is VALID [2018-11-18 23:44:54,575 INFO L273 TraceCheckUtils]: 28: Hoare triple {954#false} assume ~node.base == 0 && ~node.offset == 0; {954#false} is VALID [2018-11-18 23:44:54,576 INFO L256 TraceCheckUtils]: 29: Hoare triple {954#false} call fail(); {954#false} is VALID [2018-11-18 23:44:54,576 INFO L273 TraceCheckUtils]: 30: Hoare triple {954#false} assume !false; {954#false} is VALID [2018-11-18 23:44:54,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:44:54,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:44:54,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:44:54,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 23:44:54,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:44:54,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:44:54,651 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:44:54,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:44:54,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:44:54,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:44:54,652 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 3 states. [2018-11-18 23:44:54,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:54,852 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2018-11-18 23:44:54,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:44:54,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 23:44:54,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:44:54,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:44:54,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2018-11-18 23:44:54,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:44:54,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2018-11-18 23:44:54,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 89 transitions. [2018-11-18 23:44:55,019 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:44:55,021 INFO L225 Difference]: With dead ends: 81 [2018-11-18 23:44:55,021 INFO L226 Difference]: Without dead ends: 54 [2018-11-18 23:44:55,022 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:44:55,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-18 23:44:55,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-18 23:44:55,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:44:55,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 52 states. [2018-11-18 23:44:55,042 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 52 states. [2018-11-18 23:44:55,043 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 52 states. [2018-11-18 23:44:55,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:55,045 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-11-18 23:44:55,045 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-11-18 23:44:55,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:44:55,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:44:55,047 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 54 states. [2018-11-18 23:44:55,047 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 54 states. [2018-11-18 23:44:55,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:55,049 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-11-18 23:44:55,050 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-11-18 23:44:55,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:44:55,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:44:55,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:44:55,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:44:55,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-18 23:44:55,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-11-18 23:44:55,054 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 31 [2018-11-18 23:44:55,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:44:55,054 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-11-18 23:44:55,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:44:55,054 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-11-18 23:44:55,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 23:44:55,055 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:44:55,056 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:44:55,056 INFO L423 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:44:55,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:44:55,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1103659356, now seen corresponding path program 1 times [2018-11-18 23:44:55,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:44:55,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:44:55,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:44:55,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:44:55,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:44:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:44:55,293 INFO L256 TraceCheckUtils]: 0: Hoare triple {1237#true} call ULTIMATE.init(); {1237#true} is VALID [2018-11-18 23:44:55,294 INFO L273 TraceCheckUtils]: 1: Hoare triple {1237#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1237#true} is VALID [2018-11-18 23:44:55,294 INFO L273 TraceCheckUtils]: 2: Hoare triple {1237#true} assume true; {1237#true} is VALID [2018-11-18 23:44:55,295 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1237#true} {1237#true} #215#return; {1237#true} is VALID [2018-11-18 23:44:55,295 INFO L256 TraceCheckUtils]: 4: Hoare triple {1237#true} call #t~ret24 := main(); {1237#true} is VALID [2018-11-18 23:44:55,295 INFO L256 TraceCheckUtils]: 5: Hoare triple {1237#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {1237#true} is VALID [2018-11-18 23:44:55,296 INFO L273 TraceCheckUtils]: 6: Hoare triple {1237#true} ~nodelast~0.base, ~nodelast~0.offset := 0, 0;~node~0.base, ~node~0.offset := 0, 0; {1237#true} is VALID [2018-11-18 23:44:55,296 INFO L273 TraceCheckUtils]: 7: Hoare triple {1237#true} assume true; {1237#true} is VALID [2018-11-18 23:44:55,297 INFO L273 TraceCheckUtils]: 8: Hoare triple {1237#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {1237#true} is VALID [2018-11-18 23:44:55,300 INFO L273 TraceCheckUtils]: 9: Hoare triple {1237#true} assume !!(0 != #t~nondet7);havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(16);~node~0.base, ~node~0.offset := #t~malloc8.base, #t~malloc8.offset; {1239#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-18 23:44:55,301 INFO L273 TraceCheckUtils]: 10: Hoare triple {1239#(not (= create_tree_~node~0.base 0))} assume !(~node~0.base == 0 && ~node~0.offset == 0); {1239#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-18 23:44:55,304 INFO L273 TraceCheckUtils]: 11: Hoare triple {1239#(not (= create_tree_~node~0.base 0))} call write~$Pointer$(0, 0, ~node~0.base, ~node~0.offset, 4);call write~$Pointer$(~nodelast~0.base, ~nodelast~0.offset, ~node~0.base, 4 + ~node~0.offset, 4); {1239#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-18 23:44:55,305 INFO L273 TraceCheckUtils]: 12: Hoare triple {1239#(not (= create_tree_~node~0.base 0))} assume !(~nodelast~0.base != 0 || ~nodelast~0.offset != 0); {1239#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-18 23:44:55,305 INFO L273 TraceCheckUtils]: 13: Hoare triple {1239#(not (= create_tree_~node~0.base 0))} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~value~0 := #t~nondet9;havoc #t~nondet9;call write~int(~value~0, ~node~0.base, 12 + ~node~0.offset, 4);~nodelast~0.base, ~nodelast~0.offset := ~node~0.base, ~node~0.offset; {1240#(not (= create_tree_~nodelast~0.base 0))} is VALID [2018-11-18 23:44:55,307 INFO L273 TraceCheckUtils]: 14: Hoare triple {1240#(not (= create_tree_~nodelast~0.base 0))} assume true; {1240#(not (= create_tree_~nodelast~0.base 0))} is VALID [2018-11-18 23:44:55,307 INFO L273 TraceCheckUtils]: 15: Hoare triple {1240#(not (= create_tree_~nodelast~0.base 0))} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {1240#(not (= create_tree_~nodelast~0.base 0))} is VALID [2018-11-18 23:44:55,307 INFO L273 TraceCheckUtils]: 16: Hoare triple {1240#(not (= create_tree_~nodelast~0.base 0))} assume !(0 != #t~nondet7);havoc #t~nondet7; {1240#(not (= create_tree_~nodelast~0.base 0))} is VALID [2018-11-18 23:44:55,308 INFO L273 TraceCheckUtils]: 17: Hoare triple {1240#(not (= create_tree_~nodelast~0.base 0))} assume ~node~0.base != 0 || ~node~0.offset != 0;call write~$Pointer$(0, 0, ~node~0.base, 8 + ~node~0.offset, 4); {1240#(not (= create_tree_~nodelast~0.base 0))} is VALID [2018-11-18 23:44:55,308 INFO L273 TraceCheckUtils]: 18: Hoare triple {1240#(not (= create_tree_~nodelast~0.base 0))} assume true; {1240#(not (= create_tree_~nodelast~0.base 0))} is VALID [2018-11-18 23:44:55,309 INFO L273 TraceCheckUtils]: 19: Hoare triple {1240#(not (= create_tree_~nodelast~0.base 0))} assume !!(~node~0.base != 0 || ~node~0.offset != 0);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(16);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~node~0.base, ~node~0.offset, 4); {1240#(not (= create_tree_~nodelast~0.base 0))} is VALID [2018-11-18 23:44:55,310 INFO L273 TraceCheckUtils]: 20: Hoare triple {1240#(not (= create_tree_~nodelast~0.base 0))} assume !(~node~0.base == 0 && ~node~0.offset == 0); {1240#(not (= create_tree_~nodelast~0.base 0))} is VALID [2018-11-18 23:44:55,325 INFO L273 TraceCheckUtils]: 21: Hoare triple {1240#(not (= create_tree_~nodelast~0.base 0))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4);call write~$Pointer$(0, 0, #t~mem11.base, #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4);call write~$Pointer$(0, 0, #t~mem12.base, 4 + #t~mem12.offset, 4);havoc #t~mem12.base, #t~mem12.offset;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4);call write~int(42, #t~mem13.base, 12 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4);call write~$Pointer$(~node~0.base, ~node~0.offset, #t~mem14.base, 8 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~node~0.base, 4 + ~node~0.offset, 4);~node~0.base, ~node~0.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {1240#(not (= create_tree_~nodelast~0.base 0))} is VALID [2018-11-18 23:44:55,326 INFO L273 TraceCheckUtils]: 22: Hoare triple {1240#(not (= create_tree_~nodelast~0.base 0))} assume true; {1240#(not (= create_tree_~nodelast~0.base 0))} is VALID [2018-11-18 23:44:55,328 INFO L273 TraceCheckUtils]: 23: Hoare triple {1240#(not (= create_tree_~nodelast~0.base 0))} assume !(~node~0.base != 0 || ~node~0.offset != 0); {1240#(not (= create_tree_~nodelast~0.base 0))} is VALID [2018-11-18 23:44:55,333 INFO L273 TraceCheckUtils]: 24: Hoare triple {1240#(not (= create_tree_~nodelast~0.base 0))} #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; {1241#(not (= |create_tree_#res.base| 0))} is VALID [2018-11-18 23:44:55,333 INFO L273 TraceCheckUtils]: 25: Hoare triple {1241#(not (= |create_tree_#res.base| 0))} assume true; {1241#(not (= |create_tree_#res.base| 0))} is VALID [2018-11-18 23:44:55,334 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1241#(not (= |create_tree_#res.base| 0))} {1237#true} #203#return; {1242#(not (= |main_#t~ret23.base| 0))} is VALID [2018-11-18 23:44:55,335 INFO L273 TraceCheckUtils]: 27: Hoare triple {1242#(not (= |main_#t~ret23.base| 0))} ~data~0.base, ~data~0.offset := #t~ret23.base, #t~ret23.offset;havoc #t~ret23.base, #t~ret23.offset; {1243#(not (= main_~data~0.base 0))} is VALID [2018-11-18 23:44:55,338 INFO L273 TraceCheckUtils]: 28: Hoare triple {1243#(not (= main_~data~0.base 0))} assume !(~data~0.base == 0 && ~data~0.offset == 0); {1243#(not (= main_~data~0.base 0))} is VALID [2018-11-18 23:44:55,338 INFO L256 TraceCheckUtils]: 29: Hoare triple {1243#(not (= main_~data~0.base 0))} call inspect(~data~0.base, ~data~0.offset); {1244#(not (= |inspect_#in~node.base| 0))} is VALID [2018-11-18 23:44:55,339 INFO L273 TraceCheckUtils]: 30: Hoare triple {1244#(not (= |inspect_#in~node.base| 0))} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {1245#(not (= inspect_~node.base 0))} is VALID [2018-11-18 23:44:55,339 INFO L273 TraceCheckUtils]: 31: Hoare triple {1245#(not (= inspect_~node.base 0))} assume true; {1245#(not (= inspect_~node.base 0))} is VALID [2018-11-18 23:44:55,340 INFO L273 TraceCheckUtils]: 32: Hoare triple {1245#(not (= inspect_~node.base 0))} assume ~node.base == 0 && ~node.offset == 0; {1238#false} is VALID [2018-11-18 23:44:55,340 INFO L256 TraceCheckUtils]: 33: Hoare triple {1238#false} call fail(); {1238#false} is VALID [2018-11-18 23:44:55,340 INFO L273 TraceCheckUtils]: 34: Hoare triple {1238#false} assume !false; {1238#false} is VALID [2018-11-18 23:44:55,345 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 23:44:55,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:44:55,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 23:44:55,346 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-11-18 23:44:55,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:44:55,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 23:44:55,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:44:55,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 23:44:55,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 23:44:55,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 23:44:55,415 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 9 states. [2018-11-18 23:44:56,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:56,228 INFO L93 Difference]: Finished difference Result 105 states and 120 transitions. [2018-11-18 23:44:56,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 23:44:56,229 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-11-18 23:44:56,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:44:56,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 23:44:56,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2018-11-18 23:44:56,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 23:44:56,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2018-11-18 23:44:56,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 118 transitions. [2018-11-18 23:44:56,440 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:44:56,443 INFO L225 Difference]: With dead ends: 105 [2018-11-18 23:44:56,443 INFO L226 Difference]: Without dead ends: 66 [2018-11-18 23:44:56,444 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-18 23:44:56,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-18 23:44:56,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 51. [2018-11-18 23:44:56,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:44:56,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 51 states. [2018-11-18 23:44:56,466 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 51 states. [2018-11-18 23:44:56,467 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 51 states. [2018-11-18 23:44:56,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:56,470 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2018-11-18 23:44:56,470 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-11-18 23:44:56,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:44:56,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:44:56,471 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 66 states. [2018-11-18 23:44:56,471 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 66 states. [2018-11-18 23:44:56,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:44:56,474 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2018-11-18 23:44:56,474 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-11-18 23:44:56,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:44:56,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:44:56,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:44:56,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:44:56,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-18 23:44:56,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-18 23:44:56,478 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 35 [2018-11-18 23:44:56,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:44:56,478 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-18 23:44:56,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 23:44:56,478 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-18 23:44:56,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-18 23:44:56,479 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:44:56,480 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:44:56,480 INFO L423 AbstractCegarLoop]: === Iteration 6 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:44:56,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:44:56,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1604943851, now seen corresponding path program 1 times [2018-11-18 23:44:56,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:44:56,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:44:56,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:44:56,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:44:56,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:44:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:44:57,068 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 20 [2018-11-18 23:44:57,144 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:87) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:154) 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:155) 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-18 23:44:57,149 INFO L168 Benchmark]: Toolchain (without parser) took 8331.43 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -249.9 MB). Peak memory consumption was 481.4 MB. Max. memory is 7.1 GB. [2018-11-18 23:44:57,151 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-18 23:44:57,151 INFO L168 Benchmark]: CACSL2BoogieTranslator took 697.10 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-11-18 23:44:57,152 INFO L168 Benchmark]: Boogie Preprocessor took 179.81 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -802.4 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2018-11-18 23:44:57,153 INFO L168 Benchmark]: RCFGBuilder took 1343.83 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 76.2 MB). Peak memory consumption was 76.2 MB. Max. memory is 7.1 GB. [2018-11-18 23:44:57,153 INFO L168 Benchmark]: TraceAbstraction took 6106.03 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 455.1 MB). Peak memory consumption was 455.1 MB. Max. memory is 7.1 GB. [2018-11-18 23:44:57,158 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 697.10 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 179.81 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -802.4 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1343.83 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 76.2 MB). Peak memory consumption was 76.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6106.03 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 455.1 MB). Peak memory consumption was 455.1 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:87) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...