java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-sorted_false-unreach-call_false-valid-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:11:34,639 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:11:34,641 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:11:34,654 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:11:34,654 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:11:34,655 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:11:34,657 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:11:34,659 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:11:34,661 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:11:34,662 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:11:34,663 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:11:34,663 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:11:34,664 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:11:34,665 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:11:34,667 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:11:34,667 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:11:34,668 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:11:34,670 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:11:34,672 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:11:34,674 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:11:34,676 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:11:34,677 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:11:34,681 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:11:34,681 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:11:34,682 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:11:34,686 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:11:34,687 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:11:34,688 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:11:34,692 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:11:34,694 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:11:34,697 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:11:34,698 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:11:34,698 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:11:34,698 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:11:34,703 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:11:34,703 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:11:34,704 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 19:11:34,722 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:11:34,723 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:11:34,724 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:11:34,724 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:11:34,725 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:11:34,725 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:11:34,725 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:11:34,725 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:11:34,726 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:11:34,726 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:11:34,726 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:11:34,726 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:11:34,726 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:11:34,726 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:11:34,728 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:11:34,728 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:11:34,728 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:11:34,728 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:11:34,728 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:11:34,729 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:11:34,729 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:11:34,729 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:11:34,729 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:11:34,729 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:11:34,731 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:11:34,731 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:11:34,731 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:11:34,731 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:11:34,732 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:11:34,732 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:11:34,732 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:11:34,783 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:11:34,801 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:11:34,805 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:11:34,807 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:11:34,807 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:11:34,808 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-sorted_false-unreach-call_false-valid-memcleanup.i [2018-11-14 19:11:34,877 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc6b9f2d8/9366260f38ab4b109b86761d6e06af6d/FLAG34a889b11 [2018-11-14 19:11:35,370 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:11:35,371 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted_false-unreach-call_false-valid-memcleanup.i [2018-11-14 19:11:35,385 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc6b9f2d8/9366260f38ab4b109b86761d6e06af6d/FLAG34a889b11 [2018-11-14 19:11:35,400 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc6b9f2d8/9366260f38ab4b109b86761d6e06af6d [2018-11-14 19:11:35,412 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:11:35,413 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:11:35,414 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:11:35,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:11:35,419 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:11:35,420 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:11:35" (1/1) ... [2018-11-14 19:11:35,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40a98d72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:11:35, skipping insertion in model container [2018-11-14 19:11:35,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:11:35" (1/1) ... [2018-11-14 19:11:35,434 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:11:35,484 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:11:35,895 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:11:35,913 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:11:36,004 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:11:36,142 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:11:36,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:11:36 WrapperNode [2018-11-14 19:11:36,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:11:36,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:11:36,144 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:11:36,144 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:11:36,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:11:36" (1/1) ... [2018-11-14 19:11:36,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:11:36" (1/1) ... [2018-11-14 19:11:36,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:11:36" (1/1) ... [2018-11-14 19:11:36,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:11:36" (1/1) ... [2018-11-14 19:11:36,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:11:36" (1/1) ... [2018-11-14 19:11:36,235 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:11:36" (1/1) ... [2018-11-14 19:11:36,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:11:36" (1/1) ... [2018-11-14 19:11:36,247 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:11:36,249 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:11:36,249 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:11:36,249 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:11:36,250 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:11:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:11:36,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:11:36,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:11:36,311 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:11:36,311 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 19:11:36,311 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 19:11:36,312 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 19:11:36,312 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 19:11:36,312 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 19:11:36,312 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 19:11:36,312 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 19:11:36,313 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 19:11:36,313 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 19:11:36,313 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 19:11:36,313 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 19:11:36,313 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 19:11:36,314 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 19:11:36,314 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 19:11:36,314 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 19:11:36,314 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 19:11:36,314 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 19:11:36,314 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 19:11:36,315 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 19:11:36,315 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 19:11:36,315 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 19:11:36,315 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 19:11:36,316 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 19:11:36,316 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 19:11:36,316 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 19:11:36,316 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 19:11:36,316 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 19:11:36,316 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 19:11:36,317 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 19:11:36,317 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 19:11:36,317 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 19:11:36,317 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 19:11:36,317 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 19:11:36,317 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 19:11:36,317 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 19:11:36,318 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 19:11:36,318 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 19:11:36,318 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 19:11:36,318 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 19:11:36,318 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 19:11:36,318 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 19:11:36,318 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 19:11:36,319 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 19:11:36,319 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 19:11:36,320 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 19:11:36,320 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 19:11:36,321 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 19:11:36,321 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 19:11:36,321 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 19:11:36,321 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 19:11:36,321 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 19:11:36,321 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 19:11:36,322 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 19:11:36,322 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 19:11:36,322 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 19:11:36,322 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 19:11:36,322 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 19:11:36,322 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 19:11:36,323 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 19:11:36,323 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 19:11:36,323 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 19:11:36,323 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 19:11:36,323 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 19:11:36,323 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 19:11:36,324 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 19:11:36,324 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 19:11:36,324 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 19:11:36,324 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 19:11:36,324 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 19:11:36,324 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 19:11:36,325 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 19:11:36,325 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 19:11:36,325 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 19:11:36,325 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 19:11:36,325 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 19:11:36,325 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 19:11:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 19:11:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 19:11:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 19:11:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 19:11:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 19:11:36,327 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 19:11:36,329 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 19:11:36,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 19:11:36,330 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 19:11:36,330 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 19:11:36,330 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 19:11:36,330 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 19:11:36,330 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 19:11:36,331 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 19:11:36,331 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 19:11:36,331 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 19:11:36,331 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 19:11:36,331 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 19:11:36,331 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 19:11:36,333 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 19:11:36,334 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 19:11:36,334 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 19:11:36,334 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 19:11:36,334 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 19:11:36,334 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 19:11:36,335 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 19:11:36,335 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 19:11:36,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 19:11:36,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:11:36,336 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:11:36,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 19:11:36,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 19:11:36,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 19:11:36,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 19:11:36,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 19:11:36,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 19:11:36,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:11:36,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:11:36,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 19:11:37,758 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:11:37,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:11:37 BoogieIcfgContainer [2018-11-14 19:11:37,760 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:11:37,761 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:11:37,762 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:11:37,767 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:11:37,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:11:35" (1/3) ... [2018-11-14 19:11:37,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2390e158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:11:37, skipping insertion in model container [2018-11-14 19:11:37,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:11:36" (2/3) ... [2018-11-14 19:11:37,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2390e158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:11:37, skipping insertion in model container [2018-11-14 19:11:37,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:11:37" (3/3) ... [2018-11-14 19:11:37,772 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-sorted_false-unreach-call_false-valid-memcleanup.i [2018-11-14 19:11:37,785 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:11:37,799 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-11-14 19:11:37,823 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-11-14 19:11:37,867 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:11:37,868 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:11:37,868 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:11:37,868 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:11:37,868 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:11:37,869 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:11:37,869 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:11:37,869 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:11:37,870 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:11:37,895 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-11-14 19:11:37,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 19:11:37,903 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:11:37,904 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:11:37,908 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:11:37,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:11:37,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1023559784, now seen corresponding path program 1 times [2018-11-14 19:11:37,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:11:37,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:11:37,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:37,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:11:37,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:11:38,222 INFO L256 TraceCheckUtils]: 0: Hoare triple {73#true} call ULTIMATE.init(); {73#true} is VALID [2018-11-14 19:11:38,227 INFO L273 TraceCheckUtils]: 1: Hoare triple {73#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {73#true} is VALID [2018-11-14 19:11:38,228 INFO L273 TraceCheckUtils]: 2: Hoare triple {73#true} assume true; {73#true} is VALID [2018-11-14 19:11:38,229 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {73#true} {73#true} #250#return; {73#true} is VALID [2018-11-14 19:11:38,229 INFO L256 TraceCheckUtils]: 4: Hoare triple {73#true} call #t~ret27 := main(); {73#true} is VALID [2018-11-14 19:11:38,229 INFO L273 TraceCheckUtils]: 5: Hoare triple {73#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset + 0, 4);call write~int(0, ~head~0.base, ~head~0.offset + 4, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~marked~0 := 0; {73#true} is VALID [2018-11-14 19:11:38,246 INFO L273 TraceCheckUtils]: 6: Hoare triple {73#true} assume !true; {74#false} is VALID [2018-11-14 19:11:38,247 INFO L273 TraceCheckUtils]: 7: Hoare triple {74#false} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {74#false} is VALID [2018-11-14 19:11:38,247 INFO L273 TraceCheckUtils]: 8: Hoare triple {74#false} assume true; {74#false} is VALID [2018-11-14 19:11:38,247 INFO L273 TraceCheckUtils]: 9: Hoare triple {74#false} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {74#false} is VALID [2018-11-14 19:11:38,248 INFO L273 TraceCheckUtils]: 10: Hoare triple {74#false} assume !false; {74#false} is VALID [2018-11-14 19:11:38,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:11:38,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:11:38,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 19:11:38,265 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 19:11:38,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:11:38,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 19:11:38,374 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:11:38,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 19:11:38,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 19:11:38,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:11:38,388 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 2 states. [2018-11-14 19:11:38,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:38,843 INFO L93 Difference]: Finished difference Result 129 states and 195 transitions. [2018-11-14 19:11:38,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 19:11:38,843 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 19:11:38,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:11:38,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:11:38,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 195 transitions. [2018-11-14 19:11:38,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:11:38,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 195 transitions. [2018-11-14 19:11:38,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 195 transitions. [2018-11-14 19:11:39,574 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:11:39,590 INFO L225 Difference]: With dead ends: 129 [2018-11-14 19:11:39,590 INFO L226 Difference]: Without dead ends: 62 [2018-11-14 19:11:39,594 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:11:39,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-14 19:11:39,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-14 19:11:39,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:11:39,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 62 states. [2018-11-14 19:11:39,659 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-14 19:11:39,659 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-14 19:11:39,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:39,666 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2018-11-14 19:11:39,666 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2018-11-14 19:11:39,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:11:39,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:11:39,667 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-14 19:11:39,668 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-14 19:11:39,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:39,674 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2018-11-14 19:11:39,674 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2018-11-14 19:11:39,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:11:39,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:11:39,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:11:39,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:11:39,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-14 19:11:39,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2018-11-14 19:11:39,682 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 11 [2018-11-14 19:11:39,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:11:39,682 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2018-11-14 19:11:39,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 19:11:39,683 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2018-11-14 19:11:39,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 19:11:39,684 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:11:39,684 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:11:39,684 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:11:39,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:11:39,685 INFO L82 PathProgramCache]: Analyzing trace with hash 2122076678, now seen corresponding path program 1 times [2018-11-14 19:11:39,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:11:39,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:11:39,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:39,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:11:39,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:11:39,820 INFO L256 TraceCheckUtils]: 0: Hoare triple {422#true} call ULTIMATE.init(); {422#true} is VALID [2018-11-14 19:11:39,821 INFO L273 TraceCheckUtils]: 1: Hoare triple {422#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {422#true} is VALID [2018-11-14 19:11:39,821 INFO L273 TraceCheckUtils]: 2: Hoare triple {422#true} assume true; {422#true} is VALID [2018-11-14 19:11:39,821 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {422#true} {422#true} #250#return; {422#true} is VALID [2018-11-14 19:11:39,822 INFO L256 TraceCheckUtils]: 4: Hoare triple {422#true} call #t~ret27 := main(); {422#true} is VALID [2018-11-14 19:11:39,836 INFO L273 TraceCheckUtils]: 5: Hoare triple {422#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset + 0, 4);call write~int(0, ~head~0.base, ~head~0.offset + 4, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~marked~0 := 0; {424#(= main_~marked~0 0)} is VALID [2018-11-14 19:11:39,847 INFO L273 TraceCheckUtils]: 6: Hoare triple {424#(= main_~marked~0 0)} assume true; {424#(= main_~marked~0 0)} is VALID [2018-11-14 19:11:39,848 INFO L273 TraceCheckUtils]: 7: Hoare triple {424#(= main_~marked~0 0)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {424#(= main_~marked~0 0)} is VALID [2018-11-14 19:11:39,851 INFO L273 TraceCheckUtils]: 8: Hoare triple {424#(= main_~marked~0 0)} assume !(#t~nondet1 != 0 || ~marked~0 == 0);havoc #t~nondet1; {423#false} is VALID [2018-11-14 19:11:39,851 INFO L273 TraceCheckUtils]: 9: Hoare triple {423#false} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {423#false} is VALID [2018-11-14 19:11:39,851 INFO L273 TraceCheckUtils]: 10: Hoare triple {423#false} assume true; {423#false} is VALID [2018-11-14 19:11:39,852 INFO L273 TraceCheckUtils]: 11: Hoare triple {423#false} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {423#false} is VALID [2018-11-14 19:11:39,852 INFO L273 TraceCheckUtils]: 12: Hoare triple {423#false} assume !false; {423#false} is VALID [2018-11-14 19:11:39,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:11:39,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:11:39,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 19:11:39,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-14 19:11:39,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:11:39,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 19:11:39,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:11:39,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 19:11:39,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 19:11:39,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:11:39,894 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 3 states. [2018-11-14 19:11:40,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:40,189 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2018-11-14 19:11:40,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 19:11:40,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-14 19:11:40,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:11:40,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:11:40,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2018-11-14 19:11:40,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:11:40,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2018-11-14 19:11:40,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 148 transitions. [2018-11-14 19:11:40,458 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:11:40,461 INFO L225 Difference]: With dead ends: 125 [2018-11-14 19:11:40,462 INFO L226 Difference]: Without dead ends: 69 [2018-11-14 19:11:40,463 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-14 19:11:40,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-14 19:11:40,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-14 19:11:40,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:11:40,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 67 states. [2018-11-14 19:11:40,507 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 67 states. [2018-11-14 19:11:40,507 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 67 states. [2018-11-14 19:11:40,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:40,511 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2018-11-14 19:11:40,512 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2018-11-14 19:11:40,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:11:40,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:11:40,513 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 69 states. [2018-11-14 19:11:40,513 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 69 states. [2018-11-14 19:11:40,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:40,517 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2018-11-14 19:11:40,518 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2018-11-14 19:11:40,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:11:40,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:11:40,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:11:40,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:11:40,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-14 19:11:40,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2018-11-14 19:11:40,523 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 13 [2018-11-14 19:11:40,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:11:40,523 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2018-11-14 19:11:40,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 19:11:40,524 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2018-11-14 19:11:40,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 19:11:40,525 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:11:40,525 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:11:40,525 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:11:40,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:11:40,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1388213915, now seen corresponding path program 1 times [2018-11-14 19:11:40,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:11:40,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:11:40,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:40,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:11:40,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:11:40,712 INFO L256 TraceCheckUtils]: 0: Hoare triple {788#true} call ULTIMATE.init(); {788#true} is VALID [2018-11-14 19:11:40,712 INFO L273 TraceCheckUtils]: 1: Hoare triple {788#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {788#true} is VALID [2018-11-14 19:11:40,713 INFO L273 TraceCheckUtils]: 2: Hoare triple {788#true} assume true; {788#true} is VALID [2018-11-14 19:11:40,713 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {788#true} {788#true} #250#return; {788#true} is VALID [2018-11-14 19:11:40,713 INFO L256 TraceCheckUtils]: 4: Hoare triple {788#true} call #t~ret27 := main(); {788#true} is VALID [2018-11-14 19:11:40,714 INFO L273 TraceCheckUtils]: 5: Hoare triple {788#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset + 0, 4);call write~int(0, ~head~0.base, ~head~0.offset + 4, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~marked~0 := 0; {790#(not (= 0 main_~head~0.base))} is VALID [2018-11-14 19:11:40,719 INFO L273 TraceCheckUtils]: 6: Hoare triple {790#(not (= 0 main_~head~0.base))} assume true; {790#(not (= 0 main_~head~0.base))} is VALID [2018-11-14 19:11:40,719 INFO L273 TraceCheckUtils]: 7: Hoare triple {790#(not (= 0 main_~head~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {790#(not (= 0 main_~head~0.base))} is VALID [2018-11-14 19:11:40,720 INFO L273 TraceCheckUtils]: 8: Hoare triple {790#(not (= 0 main_~head~0.base))} assume !!(#t~nondet1 != 0 || ~marked~0 == 0);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset + 0, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset + 0, 4);~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~$Pointer$(0, 0, ~x~0.base, ~x~0.offset + 0, 4);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {790#(not (= 0 main_~head~0.base))} is VALID [2018-11-14 19:11:40,720 INFO L273 TraceCheckUtils]: 9: Hoare triple {790#(not (= 0 main_~head~0.base))} assume #t~nondet4 != 0;havoc #t~nondet4;~marked~0 := 1; {790#(not (= 0 main_~head~0.base))} is VALID [2018-11-14 19:11:40,721 INFO L273 TraceCheckUtils]: 10: Hoare triple {790#(not (= 0 main_~head~0.base))} assume ~marked~0 != 0;call write~int(1, ~x~0.base, ~x~0.offset + 4, 4); {790#(not (= 0 main_~head~0.base))} is VALID [2018-11-14 19:11:40,721 INFO L273 TraceCheckUtils]: 11: Hoare triple {790#(not (= 0 main_~head~0.base))} assume true; {790#(not (= 0 main_~head~0.base))} is VALID [2018-11-14 19:11:40,722 INFO L273 TraceCheckUtils]: 12: Hoare triple {790#(not (= 0 main_~head~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {790#(not (= 0 main_~head~0.base))} is VALID [2018-11-14 19:11:40,722 INFO L273 TraceCheckUtils]: 13: Hoare triple {790#(not (= 0 main_~head~0.base))} assume !(#t~nondet1 != 0 || ~marked~0 == 0);havoc #t~nondet1; {790#(not (= 0 main_~head~0.base))} is VALID [2018-11-14 19:11:40,723 INFO L273 TraceCheckUtils]: 14: Hoare triple {790#(not (= 0 main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {791#(not (= 0 main_~x~0.base))} is VALID [2018-11-14 19:11:40,724 INFO L273 TraceCheckUtils]: 15: Hoare triple {791#(not (= 0 main_~x~0.base))} assume true; {791#(not (= 0 main_~x~0.base))} is VALID [2018-11-14 19:11:40,725 INFO L273 TraceCheckUtils]: 16: Hoare triple {791#(not (= 0 main_~x~0.base))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {789#false} is VALID [2018-11-14 19:11:40,725 INFO L273 TraceCheckUtils]: 17: Hoare triple {789#false} assume !false; {789#false} is VALID [2018-11-14 19:11:40,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 19:11:40,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:11:40,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 19:11:40,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-14 19:11:40,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:11:40,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 19:11:40,790 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:11:40,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 19:11:40,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 19:11:40,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 19:11:40,791 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 4 states. [2018-11-14 19:11:41,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:41,178 INFO L93 Difference]: Finished difference Result 106 states and 124 transitions. [2018-11-14 19:11:41,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 19:11:41,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-14 19:11:41,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:11:41,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:11:41,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2018-11-14 19:11:41,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:11:41,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2018-11-14 19:11:41,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 118 transitions. [2018-11-14 19:11:41,364 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-14 19:11:41,368 INFO L225 Difference]: With dead ends: 106 [2018-11-14 19:11:41,368 INFO L226 Difference]: Without dead ends: 104 [2018-11-14 19:11:41,369 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:11:41,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-14 19:11:41,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 65. [2018-11-14 19:11:41,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:11:41,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 65 states. [2018-11-14 19:11:41,456 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 65 states. [2018-11-14 19:11:41,456 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 65 states. [2018-11-14 19:11:41,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:41,461 INFO L93 Difference]: Finished difference Result 104 states and 122 transitions. [2018-11-14 19:11:41,461 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 122 transitions. [2018-11-14 19:11:41,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:11:41,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:11:41,463 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 104 states. [2018-11-14 19:11:41,463 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 104 states. [2018-11-14 19:11:41,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:41,474 INFO L93 Difference]: Finished difference Result 104 states and 122 transitions. [2018-11-14 19:11:41,474 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 122 transitions. [2018-11-14 19:11:41,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:11:41,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:11:41,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:11:41,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:11:41,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-14 19:11:41,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2018-11-14 19:11:41,483 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 18 [2018-11-14 19:11:41,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:11:41,484 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2018-11-14 19:11:41,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 19:11:41,484 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2018-11-14 19:11:41,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 19:11:41,485 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:11:41,486 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] [2018-11-14 19:11:41,486 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:11:41,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:11:41,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1742810719, now seen corresponding path program 1 times [2018-11-14 19:11:41,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:11:41,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:11:41,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:41,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:11:41,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:11:41,721 INFO L256 TraceCheckUtils]: 0: Hoare triple {1203#true} call ULTIMATE.init(); {1203#true} is VALID [2018-11-14 19:11:41,721 INFO L273 TraceCheckUtils]: 1: Hoare triple {1203#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1203#true} is VALID [2018-11-14 19:11:41,721 INFO L273 TraceCheckUtils]: 2: Hoare triple {1203#true} assume true; {1203#true} is VALID [2018-11-14 19:11:41,722 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1203#true} {1203#true} #250#return; {1203#true} is VALID [2018-11-14 19:11:41,722 INFO L256 TraceCheckUtils]: 4: Hoare triple {1203#true} call #t~ret27 := main(); {1203#true} is VALID [2018-11-14 19:11:41,722 INFO L273 TraceCheckUtils]: 5: Hoare triple {1203#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset + 0, 4);call write~int(0, ~head~0.base, ~head~0.offset + 4, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~marked~0 := 0; {1203#true} is VALID [2018-11-14 19:11:41,722 INFO L273 TraceCheckUtils]: 6: Hoare triple {1203#true} assume true; {1203#true} is VALID [2018-11-14 19:11:41,723 INFO L273 TraceCheckUtils]: 7: Hoare triple {1203#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1203#true} is VALID [2018-11-14 19:11:41,723 INFO L273 TraceCheckUtils]: 8: Hoare triple {1203#true} assume !!(#t~nondet1 != 0 || ~marked~0 == 0);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset + 0, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset + 0, 4);~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~$Pointer$(0, 0, ~x~0.base, ~x~0.offset + 0, 4);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1203#true} is VALID [2018-11-14 19:11:41,723 INFO L273 TraceCheckUtils]: 9: Hoare triple {1203#true} assume #t~nondet4 != 0;havoc #t~nondet4;~marked~0 := 1; {1203#true} is VALID [2018-11-14 19:11:41,724 INFO L273 TraceCheckUtils]: 10: Hoare triple {1203#true} assume ~marked~0 != 0;call write~int(1, ~x~0.base, ~x~0.offset + 4, 4); {1203#true} is VALID [2018-11-14 19:11:41,724 INFO L273 TraceCheckUtils]: 11: Hoare triple {1203#true} assume true; {1203#true} is VALID [2018-11-14 19:11:41,724 INFO L273 TraceCheckUtils]: 12: Hoare triple {1203#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1203#true} is VALID [2018-11-14 19:11:41,725 INFO L273 TraceCheckUtils]: 13: Hoare triple {1203#true} assume !(#t~nondet1 != 0 || ~marked~0 == 0);havoc #t~nondet1; {1203#true} is VALID [2018-11-14 19:11:41,725 INFO L273 TraceCheckUtils]: 14: Hoare triple {1203#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1203#true} is VALID [2018-11-14 19:11:41,725 INFO L273 TraceCheckUtils]: 15: Hoare triple {1203#true} assume true; {1203#true} is VALID [2018-11-14 19:11:41,726 INFO L273 TraceCheckUtils]: 16: Hoare triple {1203#true} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {1203#true} is VALID [2018-11-14 19:11:41,726 INFO L273 TraceCheckUtils]: 17: Hoare triple {1203#true} assume true; {1203#true} is VALID [2018-11-14 19:11:41,726 INFO L273 TraceCheckUtils]: 18: Hoare triple {1203#true} ~marked~0 := 0; {1203#true} is VALID [2018-11-14 19:11:41,727 INFO L273 TraceCheckUtils]: 19: Hoare triple {1203#true} assume true; {1203#true} is VALID [2018-11-14 19:11:41,737 INFO L273 TraceCheckUtils]: 20: Hoare triple {1203#true} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset + 0, 4);#t~short8 := #t~mem5.base != 0 || #t~mem5.offset != 0; {1205#(or (not |main_#t~short8|) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} is VALID [2018-11-14 19:11:41,739 INFO L273 TraceCheckUtils]: 21: Hoare triple {1205#(or (not |main_#t~short8|) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} assume #t~short8;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset + 0, 4);call #t~mem7 := read~int(#t~mem6.base, #t~mem6.offset + 4, 4);#t~short8 := #t~mem7 == 0; {1206#(or (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} is VALID [2018-11-14 19:11:41,739 INFO L273 TraceCheckUtils]: 22: Hoare triple {1206#(or (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} assume !#t~short8;havoc #t~mem7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~short8; {1206#(or (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} is VALID [2018-11-14 19:11:41,741 INFO L273 TraceCheckUtils]: 23: Hoare triple {1206#(or (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} assume true; {1206#(or (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} is VALID [2018-11-14 19:11:41,742 INFO L273 TraceCheckUtils]: 24: Hoare triple {1206#(or (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0)))} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~x~0.base, ~x~0.offset + 0, 4);#t~short12 := #t~mem10.base != 0 || #t~mem10.offset != 0; {1207#|main_#t~short12|} is VALID [2018-11-14 19:11:41,743 INFO L273 TraceCheckUtils]: 25: Hoare triple {1207#|main_#t~short12|} assume !#t~short12; {1204#false} is VALID [2018-11-14 19:11:41,743 INFO L273 TraceCheckUtils]: 26: Hoare triple {1204#false} assume !!#t~short12;havoc #t~mem10.base, #t~mem10.offset;havoc #t~nondet11;havoc #t~short12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~x~0.base, ~x~0.offset + 0, 4);~x~0.base, ~x~0.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset; {1204#false} is VALID [2018-11-14 19:11:41,744 INFO L273 TraceCheckUtils]: 27: Hoare triple {1204#false} assume true;call #t~mem14 := read~int(~x~0.base, ~x~0.offset + 4, 4); {1204#false} is VALID [2018-11-14 19:11:41,744 INFO L273 TraceCheckUtils]: 28: Hoare triple {1204#false} assume !(#t~mem14 == 1);havoc #t~mem14; {1204#false} is VALID [2018-11-14 19:11:41,745 INFO L273 TraceCheckUtils]: 29: Hoare triple {1204#false} assume !false; {1204#false} is VALID [2018-11-14 19:11:41,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 19:11:41,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:11:41,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 19:11:41,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-14 19:11:41,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:11:41,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:11:41,789 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:11:41,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:11:41,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:11:41,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:11:41,790 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand 5 states. [2018-11-14 19:11:42,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:42,252 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2018-11-14 19:11:42,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:11:42,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-14 19:11:42,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:11:42,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:11:42,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2018-11-14 19:11:42,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:11:42,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2018-11-14 19:11:42,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 124 transitions. [2018-11-14 19:11:42,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:11:42,390 INFO L225 Difference]: With dead ends: 111 [2018-11-14 19:11:42,391 INFO L226 Difference]: Without dead ends: 71 [2018-11-14 19:11:42,391 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:11:42,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-14 19:11:42,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-11-14 19:11:42,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:11:42,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 69 states. [2018-11-14 19:11:42,436 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 69 states. [2018-11-14 19:11:42,437 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 69 states. [2018-11-14 19:11:42,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:42,440 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2018-11-14 19:11:42,440 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2018-11-14 19:11:42,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:11:42,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:11:42,441 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 71 states. [2018-11-14 19:11:42,441 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 71 states. [2018-11-14 19:11:42,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:11:42,444 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2018-11-14 19:11:42,444 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2018-11-14 19:11:42,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:11:42,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:11:42,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:11:42,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:11:42,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-14 19:11:42,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2018-11-14 19:11:42,449 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 30 [2018-11-14 19:11:42,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:11:42,449 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2018-11-14 19:11:42,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:11:42,449 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2018-11-14 19:11:42,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 19:11:42,450 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:11:42,450 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] [2018-11-14 19:11:42,451 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:11:42,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:11:42,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1744657761, now seen corresponding path program 1 times [2018-11-14 19:11:42,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:11:42,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:11:42,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:42,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:11:42,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:11:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:11:43,049 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:128) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-14 19:11:43,053 INFO L168 Benchmark]: Toolchain (without parser) took 7640.89 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.9 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -367.5 MB). Peak memory consumption was 374.3 MB. Max. memory is 7.1 GB. [2018-11-14 19:11:43,055 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:11:43,056 INFO L168 Benchmark]: CACSL2BoogieTranslator took 728.91 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -789.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 7.1 GB. [2018-11-14 19:11:43,057 INFO L168 Benchmark]: Boogie Preprocessor took 103.68 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:11:43,058 INFO L168 Benchmark]: RCFGBuilder took 1511.34 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: 81.7 MB). Peak memory consumption was 81.7 MB. Max. memory is 7.1 GB. [2018-11-14 19:11:43,059 INFO L168 Benchmark]: TraceAbstraction took 5290.66 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 340.5 MB). Peak memory consumption was 340.5 MB. Max. memory is 7.1 GB. [2018-11-14 19:11:43,063 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 728.91 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -789.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 103.68 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1511.34 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: 81.7 MB). Peak memory consumption was 81.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5290.66 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 340.5 MB). Peak memory consumption was 340.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...