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_Bitvector.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-token_false-unreach-call_false-valid-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 21:51:39,637 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 21:51:39,639 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 21:51:39,655 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 21:51:39,656 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 21:51:39,657 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 21:51:39,659 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 21:51:39,662 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 21:51:39,663 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 21:51:39,664 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 21:51:39,665 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 21:51:39,665 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 21:51:39,666 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 21:51:39,667 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 21:51:39,668 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 21:51:39,669 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 21:51:39,670 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 21:51:39,672 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 21:51:39,674 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 21:51:39,676 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 21:51:39,677 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 21:51:39,678 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 21:51:39,681 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 21:51:39,681 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 21:51:39,681 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 21:51:39,682 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 21:51:39,683 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 21:51:39,684 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 21:51:39,685 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 21:51:39,686 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 21:51:39,686 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 21:51:39,687 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 21:51:39,687 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 21:51:39,687 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 21:51:39,688 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 21:51:39,689 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 21:51:39,689 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-18 21:51:39,715 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 21:51:39,715 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 21:51:39,717 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 21:51:39,717 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 21:51:39,720 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 21:51:39,720 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 21:51:39,721 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 21:51:39,722 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 21:51:39,722 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 21:51:39,722 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 21:51:39,722 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 21:51:39,722 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 21:51:39,722 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 21:51:39,723 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 21:51:39,723 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 21:51:39,723 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 21:51:39,723 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 21:51:39,723 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 21:51:39,724 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 21:51:39,724 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 21:51:39,725 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 21:51:39,725 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 21:51:39,725 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 21:51:39,725 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 21:51:39,725 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 21:51:39,726 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 21:51:39,726 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 21:51:39,726 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 21:51:39,726 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 21:51:39,726 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 21:51:39,727 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 21:51:39,727 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 21:51:39,727 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 21:51:39,795 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 21:51:39,809 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 21:51:39,812 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 21:51:39,814 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 21:51:39,814 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 21:51:39,815 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-token_false-unreach-call_false-valid-memcleanup.i [2018-11-18 21:51:39,878 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a9c2062a/9f9f56b4e1af40c6b3bd7f42042d7b37/FLAG3b4840d1f [2018-11-18 21:51:40,387 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 21:51:40,387 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-token_false-unreach-call_false-valid-memcleanup.i [2018-11-18 21:51:40,399 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a9c2062a/9f9f56b4e1af40c6b3bd7f42042d7b37/FLAG3b4840d1f [2018-11-18 21:51:40,659 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a9c2062a/9f9f56b4e1af40c6b3bd7f42042d7b37 [2018-11-18 21:51:40,669 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 21:51:40,670 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 21:51:40,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 21:51:40,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 21:51:40,675 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 21:51:40,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:51:40" (1/1) ... [2018-11-18 21:51:40,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1012dd6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:40, skipping insertion in model container [2018-11-18 21:51:40,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:51:40" (1/1) ... [2018-11-18 21:51:40,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 21:51:40,761 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 21:51:41,157 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 21:51:41,173 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 21:51:41,247 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 21:51:41,395 INFO L195 MainTranslator]: Completed translation [2018-11-18 21:51:41,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:41 WrapperNode [2018-11-18 21:51:41,395 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 21:51:41,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 21:51:41,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 21:51:41,397 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 21:51:41,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:41" (1/1) ... [2018-11-18 21:51:41,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:41" (1/1) ... [2018-11-18 21:51:41,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:41" (1/1) ... [2018-11-18 21:51:41,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:41" (1/1) ... [2018-11-18 21:51:41,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:41" (1/1) ... [2018-11-18 21:51:41,492 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:41" (1/1) ... [2018-11-18 21:51:41,496 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:41" (1/1) ... [2018-11-18 21:51:41,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 21:51:41,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 21:51:41,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 21:51:41,505 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 21:51:41,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:41" (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 21:51:41,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 21:51:41,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 21:51:41,558 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 21:51:41,559 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-18 21:51:41,559 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-18 21:51:41,559 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-18 21:51:41,559 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-18 21:51:41,559 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-18 21:51:41,560 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-18 21:51:41,560 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-18 21:51:41,560 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-18 21:51:41,560 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-18 21:51:41,560 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-18 21:51:41,560 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-18 21:51:41,561 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-18 21:51:41,561 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-18 21:51:41,561 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-18 21:51:41,561 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-18 21:51:41,561 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-18 21:51:41,561 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-18 21:51:41,562 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-18 21:51:41,562 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-18 21:51:41,562 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-18 21:51:41,562 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-18 21:51:41,562 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-18 21:51:41,562 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-18 21:51:41,563 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-18 21:51:41,563 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-18 21:51:41,563 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-18 21:51:41,563 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-18 21:51:41,563 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-18 21:51:41,563 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-18 21:51:41,564 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-18 21:51:41,564 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-18 21:51:41,564 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-18 21:51:41,564 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-18 21:51:41,564 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-18 21:51:41,564 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-18 21:51:41,565 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-18 21:51:41,565 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-18 21:51:41,565 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-18 21:51:41,565 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-18 21:51:41,565 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-18 21:51:41,565 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-18 21:51:41,566 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-18 21:51:41,566 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-18 21:51:41,566 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-18 21:51:41,566 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-18 21:51:41,566 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-18 21:51:41,567 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-18 21:51:41,567 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-18 21:51:41,567 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-18 21:51:41,567 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-18 21:51:41,567 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 21:51:41,567 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-18 21:51:41,568 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-18 21:51:41,568 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-18 21:51:41,568 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-18 21:51:41,568 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-18 21:51:41,568 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-18 21:51:41,569 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-18 21:51:41,569 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-18 21:51:41,569 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-18 21:51:41,569 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-18 21:51:41,569 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-18 21:51:41,569 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-18 21:51:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 21:51:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-18 21:51:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-18 21:51:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-18 21:51:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-18 21:51:41,571 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-18 21:51:41,571 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-18 21:51:41,571 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-18 21:51:41,571 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-18 21:51:41,571 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-18 21:51:41,571 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-18 21:51:41,572 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-18 21:51:41,572 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-18 21:51:41,572 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-18 21:51:41,572 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-18 21:51:41,572 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-18 21:51:41,573 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-18 21:51:41,573 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-18 21:51:41,573 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-18 21:51:41,573 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-18 21:51:41,573 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-18 21:51:41,573 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-18 21:51:41,574 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-18 21:51:41,574 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-18 21:51:41,574 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-18 21:51:41,574 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-18 21:51:41,574 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-18 21:51:41,574 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-18 21:51:41,575 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-18 21:51:41,575 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-18 21:51:41,575 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-18 21:51:41,575 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-18 21:51:41,575 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-18 21:51:41,575 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-18 21:51:41,575 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-18 21:51:41,576 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-18 21:51:41,576 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-18 21:51:41,576 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-18 21:51:41,576 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-18 21:51:41,576 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-18 21:51:41,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 21:51:41,577 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 21:51:41,577 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 21:51:41,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 21:51:41,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 21:51:41,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 21:51:41,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 21:51:41,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 21:51:41,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 21:51:41,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 21:51:41,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 21:51:41,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 21:51:42,765 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 21:51:42,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:51:42 BoogieIcfgContainer [2018-11-18 21:51:42,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 21:51:42,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 21:51:42,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 21:51:42,771 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 21:51:42,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:51:40" (1/3) ... [2018-11-18 21:51:42,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f1a13be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:51:42, skipping insertion in model container [2018-11-18 21:51:42,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:51:41" (2/3) ... [2018-11-18 21:51:42,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f1a13be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:51:42, skipping insertion in model container [2018-11-18 21:51:42,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:51:42" (3/3) ... [2018-11-18 21:51:42,775 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-token_false-unreach-call_false-valid-memcleanup.i [2018-11-18 21:51:42,785 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 21:51:42,795 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-11-18 21:51:42,814 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-11-18 21:51:42,858 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 21:51:42,859 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 21:51:42,859 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 21:51:42,859 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 21:51:42,859 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 21:51:42,861 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 21:51:42,861 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 21:51:42,861 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 21:51:42,861 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 21:51:42,880 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-11-18 21:51:42,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 21:51:42,888 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:51:42,889 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:51:42,892 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:51:42,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:51:42,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1866947184, now seen corresponding path program 1 times [2018-11-18 21:51:42,904 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:51:42,905 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:51:42,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:51:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:51:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:51:43,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:51:43,192 INFO L256 TraceCheckUtils]: 0: Hoare triple {56#true} call ULTIMATE.init(); {56#true} is VALID [2018-11-18 21:51:43,196 INFO L273 TraceCheckUtils]: 1: Hoare triple {56#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {56#true} is VALID [2018-11-18 21:51:43,197 INFO L273 TraceCheckUtils]: 2: Hoare triple {56#true} assume true; {56#true} is VALID [2018-11-18 21:51:43,198 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {56#true} {56#true} #171#return; {56#true} is VALID [2018-11-18 21:51:43,198 INFO L256 TraceCheckUtils]: 4: Hoare triple {56#true} call #t~ret18 := main(); {56#true} is VALID [2018-11-18 21:51:43,198 INFO L273 TraceCheckUtils]: 5: Hoare triple {56#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {56#true} is VALID [2018-11-18 21:51:43,200 INFO L273 TraceCheckUtils]: 6: Hoare triple {56#true} assume !true; {57#false} is VALID [2018-11-18 21:51:43,201 INFO L273 TraceCheckUtils]: 7: Hoare triple {57#false} call write~intINTTYPE4(1bv32, ~x~0.base, ~bvadd32(8bv32, ~x~0.offset), 4bv32);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(12bv32);call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset), 4bv32);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);call write~intINTTYPE4(2bv32, #t~mem7.base, ~bvadd32(8bv32, #t~mem7.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {57#false} is VALID [2018-11-18 21:51:43,201 INFO L273 TraceCheckUtils]: 8: Hoare triple {57#false} assume true; {57#false} is VALID [2018-11-18 21:51:43,201 INFO L273 TraceCheckUtils]: 9: Hoare triple {57#false} assume !(0bv32 != ~x~0.base || 0bv32 != ~x~0.offset); {57#false} is VALID [2018-11-18 21:51:43,202 INFO L273 TraceCheckUtils]: 10: Hoare triple {57#false} assume !false; {57#false} is VALID [2018-11-18 21:51:43,205 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 21:51:43,205 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:51:43,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:51:43,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 21:51:43,214 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-18 21:51:43,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:51:43,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 21:51:43,297 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-18 21:51:43,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 21:51:43,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 21:51:43,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 21:51:43,309 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 2 states. [2018-11-18 21:51:44,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:51:44,203 INFO L93 Difference]: Finished difference Result 100 states and 146 transitions. [2018-11-18 21:51:44,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 21:51:44,203 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-18 21:51:44,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:51:44,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 21:51:44,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 146 transitions. [2018-11-18 21:51:44,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 21:51:44,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 146 transitions. [2018-11-18 21:51:44,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 146 transitions. [2018-11-18 21:51:44,768 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:51:44,783 INFO L225 Difference]: With dead ends: 100 [2018-11-18 21:51:44,783 INFO L226 Difference]: Without dead ends: 47 [2018-11-18 21:51:44,787 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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 21:51:44,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-18 21:51:44,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-18 21:51:44,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:51:44,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2018-11-18 21:51:44,856 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-18 21:51:44,856 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-18 21:51:44,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:51:44,862 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-11-18 21:51:44,862 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-18 21:51:44,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:51:44,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:51:44,863 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-18 21:51:44,863 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-18 21:51:44,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:51:44,869 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-11-18 21:51:44,869 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-18 21:51:44,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:51:44,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:51:44,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:51:44,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:51:44,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 21:51:44,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-11-18 21:51:44,876 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 11 [2018-11-18 21:51:44,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:51:44,876 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-11-18 21:51:44,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 21:51:44,877 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-18 21:51:44,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 21:51:44,877 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:51:44,877 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:51:44,878 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:51:44,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:51:44,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1840349780, now seen corresponding path program 1 times [2018-11-18 21:51:44,879 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:51:44,879 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:51:44,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:51:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:51:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:51:44,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:51:45,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 21:51:45,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 21:51:45,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:51:45,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 21:51:45,068 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:51:45,288 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:51:45,292 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:51:45,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 21:51:45,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 21:51:45,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-11-18 21:51:45,490 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 12 [2018-11-18 21:51:45,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 21:51:45,514 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 21:51:45,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 21:51:45,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 21:51:45,549 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 21:51:45,551 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:51:45,555 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:51:45,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:51:45,582 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:48, output treesize:4 [2018-11-18 21:51:45,593 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:51:45,603 INFO L256 TraceCheckUtils]: 0: Hoare triple {357#true} call ULTIMATE.init(); {357#true} is VALID [2018-11-18 21:51:45,604 INFO L273 TraceCheckUtils]: 1: Hoare triple {357#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {357#true} is VALID [2018-11-18 21:51:45,604 INFO L273 TraceCheckUtils]: 2: Hoare triple {357#true} assume true; {357#true} is VALID [2018-11-18 21:51:45,605 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {357#true} {357#true} #171#return; {357#true} is VALID [2018-11-18 21:51:45,605 INFO L256 TraceCheckUtils]: 4: Hoare triple {357#true} call #t~ret18 := main(); {357#true} is VALID [2018-11-18 21:51:45,608 INFO L273 TraceCheckUtils]: 5: Hoare triple {357#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {377#(= (_ bv1 1) (select |#valid| main_~x~0.base))} is VALID [2018-11-18 21:51:45,609 INFO L273 TraceCheckUtils]: 6: Hoare triple {377#(= (_ bv1 1) (select |#valid| main_~x~0.base))} assume true; {377#(= (_ bv1 1) (select |#valid| main_~x~0.base))} is VALID [2018-11-18 21:51:45,613 INFO L273 TraceCheckUtils]: 7: Hoare triple {377#(= (_ bv1 1) (select |#valid| main_~x~0.base))} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem3.base, ~bvadd32(4bv32, #t~mem3.offset), 4bv32);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~intINTTYPE4(0bv32, ~x~0.base, ~bvadd32(8bv32, ~x~0.offset), 4bv32); {384#(not (= (_ bv0 32) main_~x~0.base))} is VALID [2018-11-18 21:51:45,633 INFO L273 TraceCheckUtils]: 8: Hoare triple {384#(not (= (_ bv0 32) main_~x~0.base))} assume true; {384#(not (= (_ bv0 32) main_~x~0.base))} is VALID [2018-11-18 21:51:45,648 INFO L273 TraceCheckUtils]: 9: Hoare triple {384#(not (= (_ bv0 32) main_~x~0.base))} assume !(0bv32 != ~x~0.base || 0bv32 != ~x~0.offset); {358#false} is VALID [2018-11-18 21:51:45,648 INFO L273 TraceCheckUtils]: 10: Hoare triple {358#false} assume !false; {358#false} is VALID [2018-11-18 21:51:45,649 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 21:51:45,649 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:51:45,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:51:45,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 21:51:45,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-18 21:51:45,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:51:45,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 21:51:45,685 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-18 21:51:45,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 21:51:45,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 21:51:45,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 21:51:45,686 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 4 states. [2018-11-18 21:51:47,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:51:47,457 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-11-18 21:51:47,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 21:51:47,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-18 21:51:47,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:51:47,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 21:51:47,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2018-11-18 21:51:47,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 21:51:47,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2018-11-18 21:51:47,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 49 transitions. [2018-11-18 21:51:47,530 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:51:47,534 INFO L225 Difference]: With dead ends: 47 [2018-11-18 21:51:47,534 INFO L226 Difference]: Without dead ends: 45 [2018-11-18 21:51:47,535 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-18 21:51:47,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-18 21:51:47,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-18 21:51:47,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:51:47,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 45 states. [2018-11-18 21:51:47,563 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-18 21:51:47,563 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-18 21:51:47,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:51:47,566 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-11-18 21:51:47,567 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-11-18 21:51:47,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:51:47,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:51:47,568 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-18 21:51:47,568 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-18 21:51:47,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:51:47,571 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-11-18 21:51:47,572 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-11-18 21:51:47,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:51:47,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:51:47,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:51:47,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:51:47,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-18 21:51:47,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-11-18 21:51:47,576 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 11 [2018-11-18 21:51:47,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:51:47,576 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-11-18 21:51:47,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 21:51:47,576 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-11-18 21:51:47,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-18 21:51:47,577 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:51:47,577 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:51:47,578 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:51:47,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:51:47,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1215038048, now seen corresponding path program 1 times [2018-11-18 21:51:47,579 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:51:47,579 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:51:47,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:51:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:51:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:51:47,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:51:47,709 INFO L256 TraceCheckUtils]: 0: Hoare triple {597#true} call ULTIMATE.init(); {597#true} is VALID [2018-11-18 21:51:47,709 INFO L273 TraceCheckUtils]: 1: Hoare triple {597#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {597#true} is VALID [2018-11-18 21:51:47,709 INFO L273 TraceCheckUtils]: 2: Hoare triple {597#true} assume true; {597#true} is VALID [2018-11-18 21:51:47,709 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {597#true} {597#true} #171#return; {597#true} is VALID [2018-11-18 21:51:47,710 INFO L256 TraceCheckUtils]: 4: Hoare triple {597#true} call #t~ret18 := main(); {597#true} is VALID [2018-11-18 21:51:47,711 INFO L273 TraceCheckUtils]: 5: Hoare triple {597#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {617#(not (= (_ bv0 32) main_~head~0.base))} is VALID [2018-11-18 21:51:47,712 INFO L273 TraceCheckUtils]: 6: Hoare triple {617#(not (= (_ bv0 32) main_~head~0.base))} assume true; {617#(not (= (_ bv0 32) main_~head~0.base))} is VALID [2018-11-18 21:51:47,713 INFO L273 TraceCheckUtils]: 7: Hoare triple {617#(not (= (_ bv0 32) main_~head~0.base))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {617#(not (= (_ bv0 32) main_~head~0.base))} is VALID [2018-11-18 21:51:47,714 INFO L273 TraceCheckUtils]: 8: Hoare triple {617#(not (= (_ bv0 32) main_~head~0.base))} call write~intINTTYPE4(1bv32, ~x~0.base, ~bvadd32(8bv32, ~x~0.offset), 4bv32);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(12bv32);call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset), 4bv32);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);call write~intINTTYPE4(2bv32, #t~mem7.base, ~bvadd32(8bv32, #t~mem7.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {627#(not (= (_ bv0 32) main_~x~0.base))} is VALID [2018-11-18 21:51:47,714 INFO L273 TraceCheckUtils]: 9: Hoare triple {627#(not (= (_ bv0 32) main_~x~0.base))} assume true; {627#(not (= (_ bv0 32) main_~x~0.base))} is VALID [2018-11-18 21:51:47,715 INFO L273 TraceCheckUtils]: 10: Hoare triple {627#(not (= (_ bv0 32) main_~x~0.base))} assume !(0bv32 != ~x~0.base || 0bv32 != ~x~0.offset); {598#false} is VALID [2018-11-18 21:51:47,715 INFO L273 TraceCheckUtils]: 11: Hoare triple {598#false} assume !false; {598#false} is VALID [2018-11-18 21:51:47,717 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 21:51:47,717 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:51:47,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:51:47,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 21:51:47,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-18 21:51:47,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:51:47,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 21:51:47,759 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:51:47,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 21:51:47,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 21:51:47,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 21:51:47,760 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 4 states. [2018-11-18 21:51:48,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:51:48,278 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-11-18 21:51:48,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 21:51:48,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-18 21:51:48,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:51:48,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 21:51:48,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2018-11-18 21:51:48,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 21:51:48,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2018-11-18 21:51:48,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 77 transitions. [2018-11-18 21:51:48,393 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:51:48,397 INFO L225 Difference]: With dead ends: 74 [2018-11-18 21:51:48,397 INFO L226 Difference]: Without dead ends: 72 [2018-11-18 21:51:48,398 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 21:51:48,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-18 21:51:48,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 43. [2018-11-18 21:51:48,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:51:48,432 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 43 states. [2018-11-18 21:51:48,432 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 43 states. [2018-11-18 21:51:48,433 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 43 states. [2018-11-18 21:51:48,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:51:48,437 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-11-18 21:51:48,437 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2018-11-18 21:51:48,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:51:48,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:51:48,439 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 72 states. [2018-11-18 21:51:48,439 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 72 states. [2018-11-18 21:51:48,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:51:48,443 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-11-18 21:51:48,443 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2018-11-18 21:51:48,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:51:48,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:51:48,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:51:48,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:51:48,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 21:51:48,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-11-18 21:51:48,447 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 12 [2018-11-18 21:51:48,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:51:48,447 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-11-18 21:51:48,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 21:51:48,447 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-18 21:51:48,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 21:51:48,448 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:51:48,448 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:51:48,449 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:51:48,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:51:48,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1680937955, now seen corresponding path program 1 times [2018-11-18 21:51:48,450 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:51:48,450 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:51:48,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:51:48,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:51:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:51:48,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:51:48,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-18 21:51:48,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-18 21:51:48,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:51:48,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:51:48,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:51:48,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-18 21:51:48,700 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:51:48,726 INFO L256 TraceCheckUtils]: 0: Hoare triple {922#true} call ULTIMATE.init(); {922#true} is VALID [2018-11-18 21:51:48,727 INFO L273 TraceCheckUtils]: 1: Hoare triple {922#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {922#true} is VALID [2018-11-18 21:51:48,727 INFO L273 TraceCheckUtils]: 2: Hoare triple {922#true} assume true; {922#true} is VALID [2018-11-18 21:51:48,727 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {922#true} {922#true} #171#return; {922#true} is VALID [2018-11-18 21:51:48,728 INFO L256 TraceCheckUtils]: 4: Hoare triple {922#true} call #t~ret18 := main(); {922#true} is VALID [2018-11-18 21:51:48,728 INFO L273 TraceCheckUtils]: 5: Hoare triple {922#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {922#true} is VALID [2018-11-18 21:51:48,728 INFO L273 TraceCheckUtils]: 6: Hoare triple {922#true} assume true; {922#true} is VALID [2018-11-18 21:51:48,728 INFO L273 TraceCheckUtils]: 7: Hoare triple {922#true} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {922#true} is VALID [2018-11-18 21:51:48,729 INFO L273 TraceCheckUtils]: 8: Hoare triple {922#true} call write~intINTTYPE4(1bv32, ~x~0.base, ~bvadd32(8bv32, ~x~0.offset), 4bv32);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(12bv32);call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset), 4bv32);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);call write~intINTTYPE4(2bv32, #t~mem7.base, ~bvadd32(8bv32, #t~mem7.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {922#true} is VALID [2018-11-18 21:51:48,729 INFO L273 TraceCheckUtils]: 9: Hoare triple {922#true} assume true; {922#true} is VALID [2018-11-18 21:51:48,729 INFO L273 TraceCheckUtils]: 10: Hoare triple {922#true} assume !!(0bv32 != ~x~0.base || 0bv32 != ~x~0.offset); {922#true} is VALID [2018-11-18 21:51:48,729 INFO L273 TraceCheckUtils]: 11: Hoare triple {922#true} assume true; {922#true} is VALID [2018-11-18 21:51:48,730 INFO L273 TraceCheckUtils]: 12: Hoare triple {922#true} assume true; {922#true} is VALID [2018-11-18 21:51:48,731 INFO L273 TraceCheckUtils]: 13: Hoare triple {922#true} call #t~mem8 := read~intINTTYPE4(~x~0.base, ~bvadd32(8bv32, ~x~0.offset), 4bv32); {966#(= |main_#t~mem8| (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv8 32))))} is VALID [2018-11-18 21:51:48,731 INFO L273 TraceCheckUtils]: 14: Hoare triple {966#(= |main_#t~mem8| (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv8 32))))} assume !(1bv32 != #t~mem8);havoc #t~mem8; {970#(= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv8 32))))} is VALID [2018-11-18 21:51:48,732 INFO L273 TraceCheckUtils]: 15: Hoare triple {970#(= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv8 32))))} assume true;call #t~mem11 := read~intINTTYPE4(~x~0.base, ~bvadd32(8bv32, ~x~0.offset), 4bv32); {974#(= (bvadd |main_#t~mem11| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:51:48,733 INFO L273 TraceCheckUtils]: 16: Hoare triple {974#(= (bvadd |main_#t~mem11| (_ bv4294967295 32)) (_ bv0 32))} assume !(1bv32 == #t~mem11);havoc #t~mem11; {923#false} is VALID [2018-11-18 21:51:48,733 INFO L273 TraceCheckUtils]: 17: Hoare triple {923#false} assume !false; {923#false} is VALID [2018-11-18 21:51:48,735 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 21:51:48,735 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:51:48,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:51:48,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 21:51:48,738 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-18 21:51:48,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:51:48,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 21:51:48,777 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:51:48,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 21:51:48,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 21:51:48,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 21:51:48,778 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 5 states. [2018-11-18 21:51:49,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:51:49,606 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-18 21:51:49,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 21:51:49,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-18 21:51:49,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:51:49,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 21:51:49,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2018-11-18 21:51:49,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 21:51:49,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2018-11-18 21:51:49,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2018-11-18 21:51:49,750 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:51:49,752 INFO L225 Difference]: With dead ends: 43 [2018-11-18 21:51:49,753 INFO L226 Difference]: Without dead ends: 41 [2018-11-18 21:51:49,753 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 21:51:49,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-18 21:51:49,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-18 21:51:49,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:51:49,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2018-11-18 21:51:49,778 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-18 21:51:49,778 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-18 21:51:49,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:51:49,781 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-11-18 21:51:49,781 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-11-18 21:51:49,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:51:49,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:51:49,782 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-18 21:51:49,782 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-18 21:51:49,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:51:49,785 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-11-18 21:51:49,785 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-11-18 21:51:49,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:51:49,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:51:49,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:51:49,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:51:49,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 21:51:49,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-11-18 21:51:49,789 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 18 [2018-11-18 21:51:49,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:51:49,789 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-11-18 21:51:49,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 21:51:49,789 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-11-18 21:51:49,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 21:51:49,790 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:51:49,790 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:51:49,791 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:51:49,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:51:49,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1680974698, now seen corresponding path program 1 times [2018-11-18 21:51:49,792 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:51:49,792 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:51:49,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:51:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:51:49,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:51:49,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:51:49,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 21:51:49,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 21:51:49,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:51:49,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-11-18 21:51:49,967 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:51:50,054 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:51:50,060 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:51:50,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 21:51:50,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 21:51:50,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 95 [2018-11-18 21:51:50,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 93 [2018-11-18 21:51:50,150 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 21:51:50,163 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 21:51:50,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 70 [2018-11-18 21:51:50,357 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 25 [2018-11-18 21:51:50,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 21:51:50,382 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 21:51:50,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2018-11-18 21:51:50,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2018-11-18 21:51:50,435 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 21:51:50,447 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:51:50,462 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:51:50,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-18 21:51:50,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 21:51:50,538 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 21:51:50,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-18 21:51:50,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 21:51:50,585 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 21:51:50,601 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:51:50,612 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:51:50,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 21:51:50,635 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:111, output treesize:26 [2018-11-18 21:51:50,770 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:51:50,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-11-18 21:51:50,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 21:51:50,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:51:50,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 21:51:50,928 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 21:51:50,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:51:50,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:51:50,941 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2018-11-18 21:51:50,946 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:51:50,957 INFO L256 TraceCheckUtils]: 0: Hoare triple {1168#true} call ULTIMATE.init(); {1168#true} is VALID [2018-11-18 21:51:50,958 INFO L273 TraceCheckUtils]: 1: Hoare triple {1168#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1168#true} is VALID [2018-11-18 21:51:50,958 INFO L273 TraceCheckUtils]: 2: Hoare triple {1168#true} assume true; {1168#true} is VALID [2018-11-18 21:51:50,959 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1168#true} {1168#true} #171#return; {1168#true} is VALID [2018-11-18 21:51:50,959 INFO L256 TraceCheckUtils]: 4: Hoare triple {1168#true} call #t~ret18 := main(); {1168#true} is VALID [2018-11-18 21:51:50,962 INFO L273 TraceCheckUtils]: 5: Hoare triple {1168#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1188#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-18 21:51:50,964 INFO L273 TraceCheckUtils]: 6: Hoare triple {1188#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} assume true; {1188#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-18 21:51:50,965 INFO L273 TraceCheckUtils]: 7: Hoare triple {1188#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {1188#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-18 21:51:50,970 INFO L273 TraceCheckUtils]: 8: Hoare triple {1188#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} call write~intINTTYPE4(1bv32, ~x~0.base, ~bvadd32(8bv32, ~x~0.offset), 4bv32);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(12bv32);call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset), 4bv32);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);call write~intINTTYPE4(2bv32, #t~mem7.base, ~bvadd32(8bv32, #t~mem7.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1198#(and (exists ((v_arrayElimCell_5 (_ BitVec 32)) (|main_#t~malloc5.base| (_ BitVec 32))) (and (not (= |main_#t~malloc5.base| main_~x~0.base)) (= (_ bv2 32) (select (select |#memory_int| |main_#t~malloc5.base|) (bvadd v_arrayElimCell_5 (_ bv8 32)))))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv8 32)))))} is VALID [2018-11-18 21:51:50,972 INFO L273 TraceCheckUtils]: 9: Hoare triple {1198#(and (exists ((v_arrayElimCell_5 (_ BitVec 32)) (|main_#t~malloc5.base| (_ BitVec 32))) (and (not (= |main_#t~malloc5.base| main_~x~0.base)) (= (_ bv2 32) (select (select |#memory_int| |main_#t~malloc5.base|) (bvadd v_arrayElimCell_5 (_ bv8 32)))))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv8 32)))))} assume true; {1198#(and (exists ((v_arrayElimCell_5 (_ BitVec 32)) (|main_#t~malloc5.base| (_ BitVec 32))) (and (not (= |main_#t~malloc5.base| main_~x~0.base)) (= (_ bv2 32) (select (select |#memory_int| |main_#t~malloc5.base|) (bvadd v_arrayElimCell_5 (_ bv8 32)))))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv8 32)))))} is VALID [2018-11-18 21:51:50,976 INFO L273 TraceCheckUtils]: 10: Hoare triple {1198#(and (exists ((v_arrayElimCell_5 (_ BitVec 32)) (|main_#t~malloc5.base| (_ BitVec 32))) (and (not (= |main_#t~malloc5.base| main_~x~0.base)) (= (_ bv2 32) (select (select |#memory_int| |main_#t~malloc5.base|) (bvadd v_arrayElimCell_5 (_ bv8 32)))))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv8 32)))))} assume !!(0bv32 != ~x~0.base || 0bv32 != ~x~0.offset); {1198#(and (exists ((v_arrayElimCell_5 (_ BitVec 32)) (|main_#t~malloc5.base| (_ BitVec 32))) (and (not (= |main_#t~malloc5.base| main_~x~0.base)) (= (_ bv2 32) (select (select |#memory_int| |main_#t~malloc5.base|) (bvadd v_arrayElimCell_5 (_ bv8 32)))))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv8 32)))))} is VALID [2018-11-18 21:51:50,978 INFO L273 TraceCheckUtils]: 11: Hoare triple {1198#(and (exists ((v_arrayElimCell_5 (_ BitVec 32)) (|main_#t~malloc5.base| (_ BitVec 32))) (and (not (= |main_#t~malloc5.base| main_~x~0.base)) (= (_ bv2 32) (select (select |#memory_int| |main_#t~malloc5.base|) (bvadd v_arrayElimCell_5 (_ bv8 32)))))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv8 32)))))} assume true; {1198#(and (exists ((v_arrayElimCell_5 (_ BitVec 32)) (|main_#t~malloc5.base| (_ BitVec 32))) (and (not (= |main_#t~malloc5.base| main_~x~0.base)) (= (_ bv2 32) (select (select |#memory_int| |main_#t~malloc5.base|) (bvadd v_arrayElimCell_5 (_ bv8 32)))))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv8 32)))))} is VALID [2018-11-18 21:51:50,979 INFO L273 TraceCheckUtils]: 12: Hoare triple {1198#(and (exists ((v_arrayElimCell_5 (_ BitVec 32)) (|main_#t~malloc5.base| (_ BitVec 32))) (and (not (= |main_#t~malloc5.base| main_~x~0.base)) (= (_ bv2 32) (select (select |#memory_int| |main_#t~malloc5.base|) (bvadd v_arrayElimCell_5 (_ bv8 32)))))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv8 32)))))} assume true; {1198#(and (exists ((v_arrayElimCell_5 (_ BitVec 32)) (|main_#t~malloc5.base| (_ BitVec 32))) (and (not (= |main_#t~malloc5.base| main_~x~0.base)) (= (_ bv2 32) (select (select |#memory_int| |main_#t~malloc5.base|) (bvadd v_arrayElimCell_5 (_ bv8 32)))))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv8 32)))))} is VALID [2018-11-18 21:51:50,980 INFO L273 TraceCheckUtils]: 13: Hoare triple {1198#(and (exists ((v_arrayElimCell_5 (_ BitVec 32)) (|main_#t~malloc5.base| (_ BitVec 32))) (and (not (= |main_#t~malloc5.base| main_~x~0.base)) (= (_ bv2 32) (select (select |#memory_int| |main_#t~malloc5.base|) (bvadd v_arrayElimCell_5 (_ bv8 32)))))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv8 32)))))} call #t~mem8 := read~intINTTYPE4(~x~0.base, ~bvadd32(8bv32, ~x~0.offset), 4bv32); {1214#(= (_ bv1 32) |main_#t~mem8|)} is VALID [2018-11-18 21:51:50,981 INFO L273 TraceCheckUtils]: 14: Hoare triple {1214#(= (_ bv1 32) |main_#t~mem8|)} assume !!(1bv32 != #t~mem8);havoc #t~mem8; {1169#false} is VALID [2018-11-18 21:51:50,981 INFO L273 TraceCheckUtils]: 15: Hoare triple {1169#false} assume true;call #t~mem9 := read~intINTTYPE4(~x~0.base, ~bvadd32(8bv32, ~x~0.offset), 4bv32); {1169#false} is VALID [2018-11-18 21:51:50,981 INFO L273 TraceCheckUtils]: 16: Hoare triple {1169#false} assume !(0bv32 == #t~mem9);havoc #t~mem9; {1169#false} is VALID [2018-11-18 21:51:50,982 INFO L273 TraceCheckUtils]: 17: Hoare triple {1169#false} assume !false; {1169#false} is VALID [2018-11-18 21:51:50,985 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 21:51:50,985 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:51:50,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:51:50,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 21:51:50,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-18 21:51:50,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:51:50,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 21:51:51,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:51:51,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 21:51:51,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 21:51:51,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 21:51:51,046 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 5 states. [2018-11-18 21:51:53,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:51:53,206 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-11-18 21:51:53,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 21:51:53,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-18 21:51:53,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:51:53,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 21:51:53,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2018-11-18 21:51:53,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 21:51:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2018-11-18 21:51:53,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 85 transitions. [2018-11-18 21:51:53,332 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:51:53,334 INFO L225 Difference]: With dead ends: 80 [2018-11-18 21:51:53,334 INFO L226 Difference]: Without dead ends: 54 [2018-11-18 21:51:53,335 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 21:51:53,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-18 21:51:53,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-11-18 21:51:53,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:51:53,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 50 states. [2018-11-18 21:51:53,402 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 50 states. [2018-11-18 21:51:53,403 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 50 states. [2018-11-18 21:51:53,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:51:53,405 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-11-18 21:51:53,406 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-11-18 21:51:53,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:51:53,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:51:53,407 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 54 states. [2018-11-18 21:51:53,407 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 54 states. [2018-11-18 21:51:53,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:51:53,409 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-11-18 21:51:53,410 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-11-18 21:51:53,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:51:53,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:51:53,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:51:53,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:51:53,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-18 21:51:53,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-11-18 21:51:53,413 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 18 [2018-11-18 21:51:53,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:51:53,413 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-11-18 21:51:53,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 21:51:53,414 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-11-18 21:51:53,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 21:51:53,414 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:51:53,414 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] [2018-11-18 21:51:53,415 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:51:53,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:51:53,415 INFO L82 PathProgramCache]: Analyzing trace with hash 56110283, now seen corresponding path program 1 times [2018-11-18 21:51:53,416 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:51:53,416 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:51:53,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:51:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 21:51:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 21:51:53,599 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 21:51:53,651 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-18 21:51:53,652 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-18 21:51:53,652 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-18 21:51:53,652 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-18 21:51:53,652 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-18 21:51:53,652 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-18 21:51:53,653 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-18 21:51:53,653 WARN L170 areAnnotationChecker]: L1008-7 has no Hoare annotation [2018-11-18 21:51:53,653 WARN L170 areAnnotationChecker]: L1008-7 has no Hoare annotation [2018-11-18 21:51:53,653 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 21:51:53,653 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 21:51:53,654 WARN L170 areAnnotationChecker]: L1001-1 has no Hoare annotation [2018-11-18 21:51:53,654 WARN L170 areAnnotationChecker]: L1001-1 has no Hoare annotation [2018-11-18 21:51:53,654 WARN L170 areAnnotationChecker]: L1001-3 has no Hoare annotation [2018-11-18 21:51:53,654 WARN L170 areAnnotationChecker]: L1008-6 has no Hoare annotation [2018-11-18 21:51:53,654 WARN L170 areAnnotationChecker]: L1008-6 has no Hoare annotation [2018-11-18 21:51:53,655 WARN L170 areAnnotationChecker]: L1017-6 has no Hoare annotation [2018-11-18 21:51:53,655 WARN L170 areAnnotationChecker]: L1017-6 has no Hoare annotation [2018-11-18 21:51:53,655 WARN L170 areAnnotationChecker]: L1008-1 has no Hoare annotation [2018-11-18 21:51:53,655 WARN L170 areAnnotationChecker]: L1008-1 has no Hoare annotation [2018-11-18 21:51:53,655 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2018-11-18 21:51:53,656 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2018-11-18 21:51:53,656 WARN L170 areAnnotationChecker]: L1019-3 has no Hoare annotation [2018-11-18 21:51:53,656 WARN L170 areAnnotationChecker]: L1019-3 has no Hoare annotation [2018-11-18 21:51:53,656 WARN L170 areAnnotationChecker]: L1008-2 has no Hoare annotation [2018-11-18 21:51:53,656 WARN L170 areAnnotationChecker]: L1008-2 has no Hoare annotation [2018-11-18 21:51:53,656 WARN L170 areAnnotationChecker]: L1008-4 has no Hoare annotation [2018-11-18 21:51:53,657 WARN L170 areAnnotationChecker]: L1008-4 has no Hoare annotation [2018-11-18 21:51:53,657 WARN L170 areAnnotationChecker]: L1017-2 has no Hoare annotation [2018-11-18 21:51:53,657 WARN L170 areAnnotationChecker]: L1017-2 has no Hoare annotation [2018-11-18 21:51:53,657 WARN L170 areAnnotationChecker]: L1017-4 has no Hoare annotation [2018-11-18 21:51:53,657 WARN L170 areAnnotationChecker]: L1017-4 has no Hoare annotation [2018-11-18 21:51:53,658 WARN L170 areAnnotationChecker]: L1019 has no Hoare annotation [2018-11-18 21:51:53,658 WARN L170 areAnnotationChecker]: L1024-5 has no Hoare annotation [2018-11-18 21:51:53,658 WARN L170 areAnnotationChecker]: L1024-5 has no Hoare annotation [2018-11-18 21:51:53,658 WARN L170 areAnnotationChecker]: L1019-1 has no Hoare annotation [2018-11-18 21:51:53,658 WARN L170 areAnnotationChecker]: L1019-1 has no Hoare annotation [2018-11-18 21:51:53,659 WARN L170 areAnnotationChecker]: L1024 has no Hoare annotation [2018-11-18 21:51:53,659 WARN L170 areAnnotationChecker]: L1024 has no Hoare annotation [2018-11-18 21:51:53,659 WARN L170 areAnnotationChecker]: L1024-6 has no Hoare annotation [2018-11-18 21:51:53,659 WARN L170 areAnnotationChecker]: L1021-6 has no Hoare annotation [2018-11-18 21:51:53,659 WARN L170 areAnnotationChecker]: L1021-6 has no Hoare annotation [2018-11-18 21:51:53,660 WARN L170 areAnnotationChecker]: L1024-1 has no Hoare annotation [2018-11-18 21:51:53,660 WARN L170 areAnnotationChecker]: L1024-1 has no Hoare annotation [2018-11-18 21:51:53,660 WARN L170 areAnnotationChecker]: L1024-3 has no Hoare annotation [2018-11-18 21:51:53,660 WARN L170 areAnnotationChecker]: L1024-3 has no Hoare annotation [2018-11-18 21:51:53,660 WARN L170 areAnnotationChecker]: L1026-6 has no Hoare annotation [2018-11-18 21:51:53,660 WARN L170 areAnnotationChecker]: L1026-6 has no Hoare annotation [2018-11-18 21:51:53,661 WARN L170 areAnnotationChecker]: L1021-1 has no Hoare annotation [2018-11-18 21:51:53,661 WARN L170 areAnnotationChecker]: L1021-1 has no Hoare annotation [2018-11-18 21:51:53,661 WARN L170 areAnnotationChecker]: L1021-7 has no Hoare annotation [2018-11-18 21:51:53,661 WARN L170 areAnnotationChecker]: L1026-1 has no Hoare annotation [2018-11-18 21:51:53,661 WARN L170 areAnnotationChecker]: L1026-1 has no Hoare annotation [2018-11-18 21:51:53,662 WARN L170 areAnnotationChecker]: L1026-7 has no Hoare annotation [2018-11-18 21:51:53,662 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2018-11-18 21:51:53,662 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2018-11-18 21:51:53,662 WARN L170 areAnnotationChecker]: L1021-4 has no Hoare annotation [2018-11-18 21:51:53,662 WARN L170 areAnnotationChecker]: L1021-4 has no Hoare annotation [2018-11-18 21:51:53,663 WARN L170 areAnnotationChecker]: L1026-2 has no Hoare annotation [2018-11-18 21:51:53,663 WARN L170 areAnnotationChecker]: L1026-2 has no Hoare annotation [2018-11-18 21:51:53,663 WARN L170 areAnnotationChecker]: L1026-4 has no Hoare annotation [2018-11-18 21:51:53,663 WARN L170 areAnnotationChecker]: L1026-4 has no Hoare annotation [2018-11-18 21:51:53,663 WARN L170 areAnnotationChecker]: L1030-4 has no Hoare annotation [2018-11-18 21:51:53,664 WARN L170 areAnnotationChecker]: L1030-4 has no Hoare annotation [2018-11-18 21:51:53,664 WARN L170 areAnnotationChecker]: L1030-1 has no Hoare annotation [2018-11-18 21:51:53,664 WARN L170 areAnnotationChecker]: L1036-5 has no Hoare annotation [2018-11-18 21:51:53,664 WARN L170 areAnnotationChecker]: L1036-5 has no Hoare annotation [2018-11-18 21:51:53,664 WARN L170 areAnnotationChecker]: L1030-2 has no Hoare annotation [2018-11-18 21:51:53,665 WARN L170 areAnnotationChecker]: L1030-2 has no Hoare annotation [2018-11-18 21:51:53,665 WARN L170 areAnnotationChecker]: L1036 has no Hoare annotation [2018-11-18 21:51:53,665 WARN L170 areAnnotationChecker]: L1036 has no Hoare annotation [2018-11-18 21:51:53,665 WARN L170 areAnnotationChecker]: L1036-6 has no Hoare annotation [2018-11-18 21:51:53,665 WARN L170 areAnnotationChecker]: L1036-1 has no Hoare annotation [2018-11-18 21:51:53,665 WARN L170 areAnnotationChecker]: L1036-1 has no Hoare annotation [2018-11-18 21:51:53,666 WARN L170 areAnnotationChecker]: L1036-3 has no Hoare annotation [2018-11-18 21:51:53,666 WARN L170 areAnnotationChecker]: L1036-3 has no Hoare annotation [2018-11-18 21:51:53,666 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 21:51:53,666 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-18 21:51:53,666 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-18 21:51:53,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:51:53 BoogieIcfgContainer [2018-11-18 21:51:53,670 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 21:51:53,672 INFO L168 Benchmark]: Toolchain (without parser) took 13002.36 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.5 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -218.4 MB). Peak memory consumption was 527.1 MB. Max. memory is 7.1 GB. [2018-11-18 21:51:53,673 INFO L168 Benchmark]: CDTParser took 0.26 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 21:51:53,673 INFO L168 Benchmark]: CACSL2BoogieTranslator took 724.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -804.7 MB). Peak memory consumption was 38.9 MB. Max. memory is 7.1 GB. [2018-11-18 21:51:53,674 INFO L168 Benchmark]: Boogie Preprocessor took 108.36 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-11-18 21:51:53,675 INFO L168 Benchmark]: RCFGBuilder took 1261.15 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 63.6 MB). Peak memory consumption was 63.6 MB. Max. memory is 7.1 GB. [2018-11-18 21:51:53,676 INFO L168 Benchmark]: TraceAbstraction took 10902.79 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 509.5 MB). Peak memory consumption was 509.5 MB. Max. memory is 7.1 GB. [2018-11-18 21:51:53,688 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.26 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 724.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -804.7 MB). Peak memory consumption was 38.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 108.36 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1261.15 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 63.6 MB). Peak memory consumption was 63.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10902.79 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 509.5 MB). Peak memory consumption was 509.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1026]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] SLL* head = malloc(sizeof(SLL)); [L994] FCALL head->next = ((void*)0) [L995] FCALL head->prev = ((void*)0) [L996] FCALL head->data = 0 [L998] SLL* x = head; VAL [head={4:0}, malloc(sizeof(SLL))={4:0}, x={4:0}] [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] FCALL x->data = 1 [L1011] EXPR, FCALL malloc(sizeof(SLL)) [L1011] FCALL x->next = malloc(sizeof(SLL)) [L1012] EXPR, FCALL x->next [L1012] FCALL x->next->prev = x [L1013] EXPR, FCALL x->next [L1013] FCALL x->next->data = 2 [L1015] x = head VAL [head={4:0}, malloc(sizeof(SLL))={4:0}, malloc(sizeof(SLL))={131076:0}, x={4:0}] [L1017] COND FALSE !(!(((void*)0) != x)) VAL [head={4:0}, malloc(sizeof(SLL))={4:0}, malloc(sizeof(SLL))={131076:0}, x={4:0}] [L1017] COND FALSE !(0) VAL [head={4:0}, malloc(sizeof(SLL))={4:0}, malloc(sizeof(SLL))={131076:0}, x={4:0}] [L1019] EXPR, FCALL x->data VAL [head={4:0}, malloc(sizeof(SLL))={4:0}, malloc(sizeof(SLL))={131076:0}, x={4:0}, x->data=1] [L1019] COND FALSE !(1 != x->data) [L1024] EXPR, FCALL x->data VAL [head={4:0}, malloc(sizeof(SLL))={4:0}, malloc(sizeof(SLL))={131076:0}, x={4:0}, x->data=1] [L1024] COND FALSE !(!(1 == x->data)) [L1024] COND FALSE !(0) VAL [head={4:0}, malloc(sizeof(SLL))={4:0}, malloc(sizeof(SLL))={131076:0}, x={4:0}] [L1025] EXPR, FCALL x->next [L1025] x = x->next [L1026] EXPR, FCALL x->data VAL [head={4:0}, malloc(sizeof(SLL))={4:0}, malloc(sizeof(SLL))={131076:0}, x={131076:0}, x->data=2] [L1026] COND TRUE !(2 != x->data) [L1026] __VERIFIER_error() VAL [head={4:0}, malloc(sizeof(SLL))={4:0}, malloc(sizeof(SLL))={131076:0}, x={131076:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 53 locations, 6 error locations. UNSAFE Result, 10.8s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 7.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 205 SDtfs, 103 SDslu, 265 SDs, 0 SdLazy, 139 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 33 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 65 ConstructedInterpolants, 5 QuantifiedInterpolants, 4587 SizeOfPredicates, 21 NumberOfNonLiveVariables, 274 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...