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-Const.epf -i ../../../trunk/examples/svcomp/list-simple/dll2n_prepend_unequal_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:20:57,731 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:20:57,734 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:20:57,746 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:20:57,746 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:20:57,747 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:20:57,749 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:20:57,751 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:20:57,752 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:20:57,753 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:20:57,754 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:20:57,754 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:20:57,755 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:20:57,756 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:20:57,757 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:20:57,758 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:20:57,759 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:20:57,761 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:20:57,763 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:20:57,764 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:20:57,766 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:20:57,767 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:20:57,769 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:20:57,770 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:20:57,770 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:20:57,771 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:20:57,772 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:20:57,772 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:20:57,773 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:20:57,774 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:20:57,775 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:20:57,775 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:20:57,775 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:20:57,776 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:20:57,777 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:20:57,777 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:20:57,778 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 18:20:57,793 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:20:57,793 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:20:57,794 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:20:57,794 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:20:57,795 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:20:57,795 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:20:57,795 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:20:57,796 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:20:57,796 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:20:57,796 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:20:57,796 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:20:57,796 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:20:57,797 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:20:57,797 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:20:57,797 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:20:57,797 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:20:57,797 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:20:57,798 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:20:57,798 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:20:57,798 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:20:57,798 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:20:57,798 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:20:57,799 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:20:57,799 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:20:57,799 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:20:57,799 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:20:57,799 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:20:57,800 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:20:57,800 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:20:57,800 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:20:57,800 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:20:57,800 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:20:57,801 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:20:57,847 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:20:57,860 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:20:57,864 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:20:57,866 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:20:57,866 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:20:57,867 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_prepend_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-14 18:20:57,929 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3259e4944/9cb9a7ca475544c8bfcf4a0dc343bab2/FLAGacb28b533 [2018-11-14 18:20:58,497 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:20:58,498 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_prepend_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-14 18:20:58,512 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3259e4944/9cb9a7ca475544c8bfcf4a0dc343bab2/FLAGacb28b533 [2018-11-14 18:20:58,527 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3259e4944/9cb9a7ca475544c8bfcf4a0dc343bab2 [2018-11-14 18:20:58,538 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:20:58,540 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:20:58,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:20:58,543 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:20:58,546 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:20:58,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:20:58" (1/1) ... [2018-11-14 18:20:58,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71945eb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:20:58, skipping insertion in model container [2018-11-14 18:20:58,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:20:58" (1/1) ... [2018-11-14 18:20:58,561 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:20:58,614 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:20:59,071 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:20:59,089 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:20:59,154 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:20:59,299 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:20:59,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:20:59 WrapperNode [2018-11-14 18:20:59,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:20:59,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:20:59,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:20:59,301 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:20:59,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:20:59" (1/1) ... [2018-11-14 18:20:59,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:20:59" (1/1) ... [2018-11-14 18:20:59,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:20:59" (1/1) ... [2018-11-14 18:20:59,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:20:59" (1/1) ... [2018-11-14 18:20:59,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:20:59" (1/1) ... [2018-11-14 18:20:59,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:20:59" (1/1) ... [2018-11-14 18:20:59,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:20:59" (1/1) ... [2018-11-14 18:20:59,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:20:59,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:20:59,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:20:59,460 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:20:59,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:20:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:20:59,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:20:59,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:20:59,530 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 18:20:59,530 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 18:20:59,530 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-14 18:20:59,530 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-14 18:20:59,530 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-11-14 18:20:59,531 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-11-14 18:20:59,531 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_prepend [2018-11-14 18:20:59,531 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:20:59,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:20:59,531 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 18:20:59,531 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 18:20:59,532 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 18:20:59,532 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 18:20:59,532 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 18:20:59,532 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 18:20:59,532 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 18:20:59,532 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 18:20:59,533 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 18:20:59,533 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 18:20:59,533 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 18:20:59,533 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 18:20:59,533 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 18:20:59,533 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 18:20:59,534 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 18:20:59,534 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 18:20:59,534 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 18:20:59,534 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 18:20:59,534 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 18:20:59,534 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 18:20:59,535 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 18:20:59,535 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 18:20:59,535 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 18:20:59,535 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 18:20:59,535 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 18:20:59,535 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 18:20:59,535 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 18:20:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 18:20:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 18:20:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 18:20:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 18:20:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 18:20:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 18:20:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 18:20:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 18:20:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 18:20:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 18:20:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 18:20:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 18:20:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 18:20:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 18:20:59,538 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 18:20:59,538 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 18:20:59,538 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 18:20:59,538 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 18:20:59,538 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 18:20:59,538 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 18:20:59,538 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 18:20:59,539 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 18:20:59,539 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 18:20:59,539 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 18:20:59,539 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 18:20:59,539 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 18:20:59,539 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 18:20:59,539 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 18:20:59,540 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 18:20:59,540 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 18:20:59,540 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 18:20:59,540 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 18:20:59,540 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 18:20:59,540 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 18:20:59,541 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 18:20:59,541 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 18:20:59,541 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 18:20:59,541 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 18:20:59,541 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 18:20:59,541 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 18:20:59,541 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 18:20:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 18:20:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 18:20:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 18:20:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 18:20:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 18:20:59,544 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 18:20:59,545 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 18:20:59,545 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 18:20:59,545 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 18:20:59,545 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 18:20:59,545 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 18:20:59,545 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 18:20:59,545 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 18:20:59,546 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 18:20:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 18:20:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 18:20:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 18:20:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 18:20:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 18:20:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 18:20:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 18:20:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 18:20:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 18:20:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 18:20:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 18:20:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 18:20:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 18:20:59,549 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 18:20:59,549 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 18:20:59,549 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 18:20:59,549 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 18:20:59,549 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 18:20:59,549 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 18:20:59,549 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 18:20:59,549 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 18:20:59,551 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 18:20:59,551 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 18:20:59,551 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-14 18:20:59,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:20:59,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 18:20:59,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 18:20:59,551 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-11-14 18:20:59,552 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-11-14 18:20:59,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 18:20:59,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:20:59,552 INFO L130 BoogieDeclarations]: Found specification of procedure dll_prepend [2018-11-14 18:20:59,552 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:20:59,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 18:20:59,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:20:59,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:20:59,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 18:21:00,966 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:21:00,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:21:00 BoogieIcfgContainer [2018-11-14 18:21:00,967 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:21:00,968 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:21:00,968 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:21:00,972 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:21:00,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:20:58" (1/3) ... [2018-11-14 18:21:00,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a85306d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:21:00, skipping insertion in model container [2018-11-14 18:21:00,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:20:59" (2/3) ... [2018-11-14 18:21:00,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a85306d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:21:00, skipping insertion in model container [2018-11-14 18:21:00,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:21:00" (3/3) ... [2018-11-14 18:21:00,975 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-14 18:21:00,986 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:21:00,994 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:21:01,011 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:21:01,044 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:21:01,045 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:21:01,045 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:21:01,045 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:21:01,046 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:21:01,046 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:21:01,046 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:21:01,046 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:21:01,046 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:21:01,066 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-11-14 18:21:01,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 18:21:01,074 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:21:01,075 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:21:01,078 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:21:01,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:21:01,085 INFO L82 PathProgramCache]: Analyzing trace with hash -990460302, now seen corresponding path program 1 times [2018-11-14 18:21:01,090 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:21:01,091 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-14 18:21:01,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:21:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:21:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:21:01,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:21:01,365 INFO L256 TraceCheckUtils]: 0: Hoare triple {57#true} call ULTIMATE.init(); {57#true} is VALID [2018-11-14 18:21:01,369 INFO L273 TraceCheckUtils]: 1: Hoare triple {57#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {57#true} is VALID [2018-11-14 18:21:01,369 INFO L273 TraceCheckUtils]: 2: Hoare triple {57#true} assume true; {57#true} is VALID [2018-11-14 18:21:01,370 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {57#true} {57#true} #131#return; {57#true} is VALID [2018-11-14 18:21:01,371 INFO L256 TraceCheckUtils]: 4: Hoare triple {57#true} call #t~ret18 := main(); {57#true} is VALID [2018-11-14 18:21:01,371 INFO L273 TraceCheckUtils]: 5: Hoare triple {57#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {57#true} is VALID [2018-11-14 18:21:01,371 INFO L256 TraceCheckUtils]: 6: Hoare triple {57#true} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {57#true} is VALID [2018-11-14 18:21:01,372 INFO L273 TraceCheckUtils]: 7: Hoare triple {57#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {57#true} is VALID [2018-11-14 18:21:01,380 INFO L273 TraceCheckUtils]: 8: Hoare triple {57#true} assume !true; {58#false} is VALID [2018-11-14 18:21:01,380 INFO L273 TraceCheckUtils]: 9: Hoare triple {58#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {58#false} is VALID [2018-11-14 18:21:01,381 INFO L273 TraceCheckUtils]: 10: Hoare triple {58#false} assume true; {58#false} is VALID [2018-11-14 18:21:01,381 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {58#false} {57#true} #121#return; {58#false} is VALID [2018-11-14 18:21:01,381 INFO L273 TraceCheckUtils]: 12: Hoare triple {58#false} call write~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5bv32; {58#false} is VALID [2018-11-14 18:21:01,382 INFO L256 TraceCheckUtils]: 13: Hoare triple {58#false} call dll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {58#false} is VALID [2018-11-14 18:21:01,382 INFO L273 TraceCheckUtils]: 14: Hoare triple {58#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {58#false} is VALID [2018-11-14 18:21:01,382 INFO L256 TraceCheckUtils]: 15: Hoare triple {58#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {58#false} is VALID [2018-11-14 18:21:01,382 INFO L273 TraceCheckUtils]: 16: Hoare triple {58#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {58#false} is VALID [2018-11-14 18:21:01,383 INFO L273 TraceCheckUtils]: 17: Hoare triple {58#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {58#false} is VALID [2018-11-14 18:21:01,383 INFO L273 TraceCheckUtils]: 18: Hoare triple {58#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {58#false} is VALID [2018-11-14 18:21:01,383 INFO L273 TraceCheckUtils]: 19: Hoare triple {58#false} assume true; {58#false} is VALID [2018-11-14 18:21:01,384 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {58#false} {58#false} #129#return; {58#false} is VALID [2018-11-14 18:21:01,384 INFO L273 TraceCheckUtils]: 21: Hoare triple {58#false} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {58#false} is VALID [2018-11-14 18:21:01,384 INFO L273 TraceCheckUtils]: 22: Hoare triple {58#false} assume #t~mem8.base != 0bv32 || #t~mem8.offset != 0bv32;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, ~bvadd32(8bv32, #t~mem9.offset), 4bv32);havoc #t~mem9.base, #t~mem9.offset; {58#false} is VALID [2018-11-14 18:21:01,385 INFO L273 TraceCheckUtils]: 23: Hoare triple {58#false} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {58#false} is VALID [2018-11-14 18:21:01,385 INFO L273 TraceCheckUtils]: 24: Hoare triple {58#false} assume true; {58#false} is VALID [2018-11-14 18:21:01,385 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {58#false} {58#false} #123#return; {58#false} is VALID [2018-11-14 18:21:01,385 INFO L273 TraceCheckUtils]: 26: Hoare triple {58#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12 := read~intINTTYPE4(~ptr~0.base, ~ptr~0.offset, 4bv32); {58#false} is VALID [2018-11-14 18:21:01,386 INFO L273 TraceCheckUtils]: 27: Hoare triple {58#false} assume ~uneq~0 != #t~mem12;havoc #t~mem12; {58#false} is VALID [2018-11-14 18:21:01,386 INFO L273 TraceCheckUtils]: 28: Hoare triple {58#false} assume !false; {58#false} is VALID [2018-11-14 18:21:01,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:21:01,393 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:21:01,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:21:01,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:21:01,406 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-11-14 18:21:01,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:21:01,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:21:01,649 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:21:01,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:21:01,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:21:01,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:21:01,664 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-11-14 18:21:02,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:21:02,786 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2018-11-14 18:21:02,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:21:02,787 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-11-14 18:21:02,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:21:02,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:21:02,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2018-11-14 18:21:02,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:21:02,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2018-11-14 18:21:02,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 112 transitions. [2018-11-14 18:21:03,227 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:21:03,240 INFO L225 Difference]: With dead ends: 93 [2018-11-14 18:21:03,241 INFO L226 Difference]: Without dead ends: 39 [2018-11-14 18:21:03,245 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:21:03,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-14 18:21:03,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-14 18:21:03,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:21:03,308 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2018-11-14 18:21:03,309 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-14 18:21:03,309 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-14 18:21:03,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:21:03,314 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-14 18:21:03,315 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-14 18:21:03,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:21:03,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:21:03,316 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-14 18:21:03,316 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-14 18:21:03,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:21:03,321 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-14 18:21:03,321 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-14 18:21:03,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:21:03,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:21:03,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:21:03,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:21:03,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-14 18:21:03,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-14 18:21:03,328 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 29 [2018-11-14 18:21:03,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:21:03,329 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-14 18:21:03,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:21:03,329 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-14 18:21:03,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 18:21:03,331 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:21:03,331 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:21:03,331 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:21:03,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:21:03,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1702614640, now seen corresponding path program 1 times [2018-11-14 18:21:03,332 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:21:03,333 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-14 18:21:03,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:21:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:21:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:21:03,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:21:03,683 INFO L256 TraceCheckUtils]: 0: Hoare triple {398#true} call ULTIMATE.init(); {398#true} is VALID [2018-11-14 18:21:03,684 INFO L273 TraceCheckUtils]: 1: Hoare triple {398#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {398#true} is VALID [2018-11-14 18:21:03,684 INFO L273 TraceCheckUtils]: 2: Hoare triple {398#true} assume true; {398#true} is VALID [2018-11-14 18:21:03,684 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {398#true} {398#true} #131#return; {398#true} is VALID [2018-11-14 18:21:03,685 INFO L256 TraceCheckUtils]: 4: Hoare triple {398#true} call #t~ret18 := main(); {398#true} is VALID [2018-11-14 18:21:03,690 INFO L273 TraceCheckUtils]: 5: Hoare triple {398#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {418#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:21:03,690 INFO L256 TraceCheckUtils]: 6: Hoare triple {418#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {398#true} is VALID [2018-11-14 18:21:03,691 INFO L273 TraceCheckUtils]: 7: Hoare triple {398#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {425#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-14 18:21:03,693 INFO L273 TraceCheckUtils]: 8: Hoare triple {425#(= dll_create_~len |dll_create_#in~len|)} assume true; {425#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-14 18:21:03,693 INFO L273 TraceCheckUtils]: 9: Hoare triple {425#(= dll_create_~len |dll_create_#in~len|)} assume !~bvsgt32(~len, 0bv32); {432#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 18:21:03,695 INFO L273 TraceCheckUtils]: 10: Hoare triple {432#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {432#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 18:21:03,697 INFO L273 TraceCheckUtils]: 11: Hoare triple {432#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} assume true; {432#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 18:21:03,705 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {432#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} {418#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #121#return; {399#false} is VALID [2018-11-14 18:21:03,705 INFO L273 TraceCheckUtils]: 13: Hoare triple {399#false} call write~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5bv32; {399#false} is VALID [2018-11-14 18:21:03,706 INFO L256 TraceCheckUtils]: 14: Hoare triple {399#false} call dll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {399#false} is VALID [2018-11-14 18:21:03,706 INFO L273 TraceCheckUtils]: 15: Hoare triple {399#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {399#false} is VALID [2018-11-14 18:21:03,706 INFO L256 TraceCheckUtils]: 16: Hoare triple {399#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {399#false} is VALID [2018-11-14 18:21:03,707 INFO L273 TraceCheckUtils]: 17: Hoare triple {399#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {399#false} is VALID [2018-11-14 18:21:03,707 INFO L273 TraceCheckUtils]: 18: Hoare triple {399#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {399#false} is VALID [2018-11-14 18:21:03,707 INFO L273 TraceCheckUtils]: 19: Hoare triple {399#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {399#false} is VALID [2018-11-14 18:21:03,708 INFO L273 TraceCheckUtils]: 20: Hoare triple {399#false} assume true; {399#false} is VALID [2018-11-14 18:21:03,708 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {399#false} {399#false} #129#return; {399#false} is VALID [2018-11-14 18:21:03,708 INFO L273 TraceCheckUtils]: 22: Hoare triple {399#false} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {399#false} is VALID [2018-11-14 18:21:03,709 INFO L273 TraceCheckUtils]: 23: Hoare triple {399#false} assume #t~mem8.base != 0bv32 || #t~mem8.offset != 0bv32;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, ~bvadd32(8bv32, #t~mem9.offset), 4bv32);havoc #t~mem9.base, #t~mem9.offset; {399#false} is VALID [2018-11-14 18:21:03,709 INFO L273 TraceCheckUtils]: 24: Hoare triple {399#false} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {399#false} is VALID [2018-11-14 18:21:03,710 INFO L273 TraceCheckUtils]: 25: Hoare triple {399#false} assume true; {399#false} is VALID [2018-11-14 18:21:03,710 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {399#false} {399#false} #123#return; {399#false} is VALID [2018-11-14 18:21:03,710 INFO L273 TraceCheckUtils]: 27: Hoare triple {399#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12 := read~intINTTYPE4(~ptr~0.base, ~ptr~0.offset, 4bv32); {399#false} is VALID [2018-11-14 18:21:03,711 INFO L273 TraceCheckUtils]: 28: Hoare triple {399#false} assume ~uneq~0 != #t~mem12;havoc #t~mem12; {399#false} is VALID [2018-11-14 18:21:03,711 INFO L273 TraceCheckUtils]: 29: Hoare triple {399#false} assume !false; {399#false} is VALID [2018-11-14 18:21:03,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:21:03,715 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:21:03,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:21:03,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 18:21:03,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-14 18:21:03,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:21:03,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:21:03,773 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:21:03,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:21:03,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:21:03,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:21:03,774 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 5 states. [2018-11-14 18:21:04,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:21:04,296 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-11-14 18:21:04,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:21:04,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-14 18:21:04,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:21:04,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:21:04,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2018-11-14 18:21:04,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:21:04,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2018-11-14 18:21:04,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 80 transitions. [2018-11-14 18:21:04,514 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:21:04,518 INFO L225 Difference]: With dead ends: 70 [2018-11-14 18:21:04,518 INFO L226 Difference]: Without dead ends: 45 [2018-11-14 18:21:04,519 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:21:04,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-14 18:21:04,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-11-14 18:21:04,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:21:04,549 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 41 states. [2018-11-14 18:21:04,550 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 41 states. [2018-11-14 18:21:04,550 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 41 states. [2018-11-14 18:21:04,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:21:04,554 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-14 18:21:04,554 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-14 18:21:04,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:21:04,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:21:04,555 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 45 states. [2018-11-14 18:21:04,555 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 45 states. [2018-11-14 18:21:04,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:21:04,559 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-14 18:21:04,559 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-14 18:21:04,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:21:04,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:21:04,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:21:04,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:21:04,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 18:21:04,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-11-14 18:21:04,564 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 30 [2018-11-14 18:21:04,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:21:04,564 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-14 18:21:04,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:21:04,564 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-14 18:21:04,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 18:21:04,566 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:21:04,566 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:21:04,566 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:21:04,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:21:04,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1826631930, now seen corresponding path program 1 times [2018-11-14 18:21:04,568 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:21:04,568 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-14 18:21:04,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:21:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:21:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:21:04,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:21:04,809 INFO L256 TraceCheckUtils]: 0: Hoare triple {729#true} call ULTIMATE.init(); {729#true} is VALID [2018-11-14 18:21:04,810 INFO L273 TraceCheckUtils]: 1: Hoare triple {729#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {729#true} is VALID [2018-11-14 18:21:04,810 INFO L273 TraceCheckUtils]: 2: Hoare triple {729#true} assume true; {729#true} is VALID [2018-11-14 18:21:04,810 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {729#true} {729#true} #131#return; {729#true} is VALID [2018-11-14 18:21:04,811 INFO L256 TraceCheckUtils]: 4: Hoare triple {729#true} call #t~ret18 := main(); {729#true} is VALID [2018-11-14 18:21:04,813 INFO L273 TraceCheckUtils]: 5: Hoare triple {729#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {749#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:21:04,813 INFO L256 TraceCheckUtils]: 6: Hoare triple {749#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {729#true} is VALID [2018-11-14 18:21:04,814 INFO L273 TraceCheckUtils]: 7: Hoare triple {729#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {756#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-14 18:21:04,815 INFO L273 TraceCheckUtils]: 8: Hoare triple {756#(= dll_create_~len |dll_create_#in~len|)} assume true; {756#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-14 18:21:04,815 INFO L273 TraceCheckUtils]: 9: Hoare triple {756#(= dll_create_~len |dll_create_#in~len|)} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {756#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-14 18:21:04,816 INFO L273 TraceCheckUtils]: 10: Hoare triple {756#(= dll_create_~len |dll_create_#in~len|)} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {756#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-14 18:21:04,826 INFO L273 TraceCheckUtils]: 11: Hoare triple {756#(= dll_create_~len |dll_create_#in~len|)} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {756#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-14 18:21:04,827 INFO L273 TraceCheckUtils]: 12: Hoare triple {756#(= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {756#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-14 18:21:04,828 INFO L273 TraceCheckUtils]: 13: Hoare triple {756#(= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {775#(= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|)} is VALID [2018-11-14 18:21:04,828 INFO L273 TraceCheckUtils]: 14: Hoare triple {775#(= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|)} assume true; {775#(= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|)} is VALID [2018-11-14 18:21:04,829 INFO L273 TraceCheckUtils]: 15: Hoare triple {775#(= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|)} assume !~bvsgt32(~len, 0bv32); {782#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:21:04,831 INFO L273 TraceCheckUtils]: 16: Hoare triple {782#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {782#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:21:04,833 INFO L273 TraceCheckUtils]: 17: Hoare triple {782#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {782#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:21:04,838 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {782#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {749#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #121#return; {730#false} is VALID [2018-11-14 18:21:04,838 INFO L273 TraceCheckUtils]: 19: Hoare triple {730#false} call write~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5bv32; {730#false} is VALID [2018-11-14 18:21:04,839 INFO L256 TraceCheckUtils]: 20: Hoare triple {730#false} call dll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {730#false} is VALID [2018-11-14 18:21:04,839 INFO L273 TraceCheckUtils]: 21: Hoare triple {730#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {730#false} is VALID [2018-11-14 18:21:04,839 INFO L256 TraceCheckUtils]: 22: Hoare triple {730#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {730#false} is VALID [2018-11-14 18:21:04,839 INFO L273 TraceCheckUtils]: 23: Hoare triple {730#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {730#false} is VALID [2018-11-14 18:21:04,840 INFO L273 TraceCheckUtils]: 24: Hoare triple {730#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {730#false} is VALID [2018-11-14 18:21:04,840 INFO L273 TraceCheckUtils]: 25: Hoare triple {730#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {730#false} is VALID [2018-11-14 18:21:04,840 INFO L273 TraceCheckUtils]: 26: Hoare triple {730#false} assume true; {730#false} is VALID [2018-11-14 18:21:04,840 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {730#false} {730#false} #129#return; {730#false} is VALID [2018-11-14 18:21:04,840 INFO L273 TraceCheckUtils]: 28: Hoare triple {730#false} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {730#false} is VALID [2018-11-14 18:21:04,841 INFO L273 TraceCheckUtils]: 29: Hoare triple {730#false} assume #t~mem8.base != 0bv32 || #t~mem8.offset != 0bv32;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, ~bvadd32(8bv32, #t~mem9.offset), 4bv32);havoc #t~mem9.base, #t~mem9.offset; {730#false} is VALID [2018-11-14 18:21:04,841 INFO L273 TraceCheckUtils]: 30: Hoare triple {730#false} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {730#false} is VALID [2018-11-14 18:21:04,841 INFO L273 TraceCheckUtils]: 31: Hoare triple {730#false} assume true; {730#false} is VALID [2018-11-14 18:21:04,842 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {730#false} {730#false} #123#return; {730#false} is VALID [2018-11-14 18:21:04,842 INFO L273 TraceCheckUtils]: 33: Hoare triple {730#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12 := read~intINTTYPE4(~ptr~0.base, ~ptr~0.offset, 4bv32); {730#false} is VALID [2018-11-14 18:21:04,842 INFO L273 TraceCheckUtils]: 34: Hoare triple {730#false} assume ~uneq~0 != #t~mem12;havoc #t~mem12; {730#false} is VALID [2018-11-14 18:21:04,843 INFO L273 TraceCheckUtils]: 35: Hoare triple {730#false} assume !false; {730#false} is VALID [2018-11-14 18:21:04,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:21:04,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:21:05,263 INFO L273 TraceCheckUtils]: 35: Hoare triple {730#false} assume !false; {730#false} is VALID [2018-11-14 18:21:05,264 INFO L273 TraceCheckUtils]: 34: Hoare triple {730#false} assume ~uneq~0 != #t~mem12;havoc #t~mem12; {730#false} is VALID [2018-11-14 18:21:05,264 INFO L273 TraceCheckUtils]: 33: Hoare triple {730#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12 := read~intINTTYPE4(~ptr~0.base, ~ptr~0.offset, 4bv32); {730#false} is VALID [2018-11-14 18:21:05,264 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {729#true} {730#false} #123#return; {730#false} is VALID [2018-11-14 18:21:05,264 INFO L273 TraceCheckUtils]: 31: Hoare triple {729#true} assume true; {729#true} is VALID [2018-11-14 18:21:05,265 INFO L273 TraceCheckUtils]: 30: Hoare triple {729#true} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {729#true} is VALID [2018-11-14 18:21:05,265 INFO L273 TraceCheckUtils]: 29: Hoare triple {729#true} assume #t~mem8.base != 0bv32 || #t~mem8.offset != 0bv32;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, ~bvadd32(8bv32, #t~mem9.offset), 4bv32);havoc #t~mem9.base, #t~mem9.offset; {729#true} is VALID [2018-11-14 18:21:05,265 INFO L273 TraceCheckUtils]: 28: Hoare triple {729#true} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {729#true} is VALID [2018-11-14 18:21:05,266 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {729#true} {729#true} #129#return; {729#true} is VALID [2018-11-14 18:21:05,266 INFO L273 TraceCheckUtils]: 26: Hoare triple {729#true} assume true; {729#true} is VALID [2018-11-14 18:21:05,266 INFO L273 TraceCheckUtils]: 25: Hoare triple {729#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {729#true} is VALID [2018-11-14 18:21:05,267 INFO L273 TraceCheckUtils]: 24: Hoare triple {729#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {729#true} is VALID [2018-11-14 18:21:05,267 INFO L273 TraceCheckUtils]: 23: Hoare triple {729#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {729#true} is VALID [2018-11-14 18:21:05,267 INFO L256 TraceCheckUtils]: 22: Hoare triple {729#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {729#true} is VALID [2018-11-14 18:21:05,267 INFO L273 TraceCheckUtils]: 21: Hoare triple {729#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {729#true} is VALID [2018-11-14 18:21:05,268 INFO L256 TraceCheckUtils]: 20: Hoare triple {730#false} call dll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {729#true} is VALID [2018-11-14 18:21:05,268 INFO L273 TraceCheckUtils]: 19: Hoare triple {730#false} call write~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5bv32; {730#false} is VALID [2018-11-14 18:21:05,270 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {782#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {894#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} #121#return; {730#false} is VALID [2018-11-14 18:21:05,274 INFO L273 TraceCheckUtils]: 17: Hoare triple {782#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {782#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:21:05,274 INFO L273 TraceCheckUtils]: 16: Hoare triple {782#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {782#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:21:05,276 INFO L273 TraceCheckUtils]: 15: Hoare triple {907#(or (bvsgt dll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !~bvsgt32(~len, 0bv32); {782#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:21:05,276 INFO L273 TraceCheckUtils]: 14: Hoare triple {907#(or (bvsgt dll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume true; {907#(or (bvsgt dll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-14 18:21:05,279 INFO L273 TraceCheckUtils]: 13: Hoare triple {914#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {907#(or (bvsgt dll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-14 18:21:05,281 INFO L273 TraceCheckUtils]: 12: Hoare triple {914#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {914#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-14 18:21:05,281 INFO L273 TraceCheckUtils]: 11: Hoare triple {914#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {914#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-14 18:21:05,283 INFO L273 TraceCheckUtils]: 10: Hoare triple {914#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {914#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-14 18:21:05,298 INFO L273 TraceCheckUtils]: 9: Hoare triple {914#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {914#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-14 18:21:05,299 INFO L273 TraceCheckUtils]: 8: Hoare triple {914#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume true; {914#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-14 18:21:05,300 INFO L273 TraceCheckUtils]: 7: Hoare triple {729#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {914#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-14 18:21:05,300 INFO L256 TraceCheckUtils]: 6: Hoare triple {894#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {729#true} is VALID [2018-11-14 18:21:05,307 INFO L273 TraceCheckUtils]: 5: Hoare triple {729#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {894#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:21:05,308 INFO L256 TraceCheckUtils]: 4: Hoare triple {729#true} call #t~ret18 := main(); {729#true} is VALID [2018-11-14 18:21:05,308 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {729#true} {729#true} #131#return; {729#true} is VALID [2018-11-14 18:21:05,308 INFO L273 TraceCheckUtils]: 2: Hoare triple {729#true} assume true; {729#true} is VALID [2018-11-14 18:21:05,308 INFO L273 TraceCheckUtils]: 1: Hoare triple {729#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {729#true} is VALID [2018-11-14 18:21:05,309 INFO L256 TraceCheckUtils]: 0: Hoare triple {729#true} call ULTIMATE.init(); {729#true} is VALID [2018-11-14 18:21:05,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:21:05,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:21:05,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-14 18:21:05,316 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-11-14 18:21:05,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:21:05,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 18:21:05,467 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:21:05,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 18:21:05,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 18:21:05,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:21:05,468 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 9 states. [2018-11-14 18:21:06,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:21:06,629 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-11-14 18:21:06,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 18:21:06,629 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-11-14 18:21:06,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:21:06,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:21:06,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2018-11-14 18:21:06,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:21:06,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2018-11-14 18:21:06,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 87 transitions. [2018-11-14 18:21:06,862 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:21:06,865 INFO L225 Difference]: With dead ends: 76 [2018-11-14 18:21:06,866 INFO L226 Difference]: Without dead ends: 51 [2018-11-14 18:21:06,866 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:21:06,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-14 18:21:06,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-11-14 18:21:06,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:21:06,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 47 states. [2018-11-14 18:21:06,910 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 47 states. [2018-11-14 18:21:06,910 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 47 states. [2018-11-14 18:21:06,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:21:06,915 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-11-14 18:21:06,915 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-14 18:21:06,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:21:06,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:21:06,916 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 51 states. [2018-11-14 18:21:06,916 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 51 states. [2018-11-14 18:21:06,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:21:06,919 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-11-14 18:21:06,919 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-14 18:21:06,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:21:06,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:21:06,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:21:06,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:21:06,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 18:21:06,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-11-14 18:21:06,923 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 36 [2018-11-14 18:21:06,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:21:06,924 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-11-14 18:21:06,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 18:21:06,924 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-14 18:21:06,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-14 18:21:06,926 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:21:06,926 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:21:06,926 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:21:06,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:21:06,927 INFO L82 PathProgramCache]: Analyzing trace with hash -835388412, now seen corresponding path program 2 times [2018-11-14 18:21:06,927 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:21:06,927 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-14 18:21:06,958 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 18:21:07,040 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 18:21:07,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:21:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:21:07,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:21:07,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 18:21:07,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:21:07,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:21:07,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:21:07,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:21:07,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-14 18:21:07,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 18:21:07,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:21:07,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:21:07,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:21:07,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 18:21:07,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:21:07,537 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:21:07,541 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:21:07,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:21:07,556 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-11-14 18:21:07,601 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:21:07,756 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 27 treesize of output 15 [2018-11-14 18:21:07,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 18:21:07,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:21:07,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:21:07,787 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 7 treesize of output 5 [2018-11-14 18:21:07,790 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:21:07,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:21:07,802 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:39, output treesize:9 [2018-11-14 18:21:07,807 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:21:07,841 INFO L256 TraceCheckUtils]: 0: Hoare triple {1218#true} call ULTIMATE.init(); {1218#true} is VALID [2018-11-14 18:21:07,842 INFO L273 TraceCheckUtils]: 1: Hoare triple {1218#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1218#true} is VALID [2018-11-14 18:21:07,842 INFO L273 TraceCheckUtils]: 2: Hoare triple {1218#true} assume true; {1218#true} is VALID [2018-11-14 18:21:07,843 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1218#true} {1218#true} #131#return; {1218#true} is VALID [2018-11-14 18:21:07,843 INFO L256 TraceCheckUtils]: 4: Hoare triple {1218#true} call #t~ret18 := main(); {1218#true} is VALID [2018-11-14 18:21:07,845 INFO L273 TraceCheckUtils]: 5: Hoare triple {1218#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1238#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:21:07,845 INFO L256 TraceCheckUtils]: 6: Hoare triple {1238#(= |main_~#s~0.offset| (_ bv0 32))} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {1218#true} is VALID [2018-11-14 18:21:07,845 INFO L273 TraceCheckUtils]: 7: Hoare triple {1218#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1218#true} is VALID [2018-11-14 18:21:07,845 INFO L273 TraceCheckUtils]: 8: Hoare triple {1218#true} assume true; {1218#true} is VALID [2018-11-14 18:21:07,846 INFO L273 TraceCheckUtils]: 9: Hoare triple {1218#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1218#true} is VALID [2018-11-14 18:21:07,846 INFO L273 TraceCheckUtils]: 10: Hoare triple {1218#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1218#true} is VALID [2018-11-14 18:21:07,846 INFO L273 TraceCheckUtils]: 11: Hoare triple {1218#true} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1218#true} is VALID [2018-11-14 18:21:07,846 INFO L273 TraceCheckUtils]: 12: Hoare triple {1218#true} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1218#true} is VALID [2018-11-14 18:21:07,847 INFO L273 TraceCheckUtils]: 13: Hoare triple {1218#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1218#true} is VALID [2018-11-14 18:21:07,847 INFO L273 TraceCheckUtils]: 14: Hoare triple {1218#true} assume true; {1218#true} is VALID [2018-11-14 18:21:07,847 INFO L273 TraceCheckUtils]: 15: Hoare triple {1218#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1218#true} is VALID [2018-11-14 18:21:07,847 INFO L273 TraceCheckUtils]: 16: Hoare triple {1218#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1218#true} is VALID [2018-11-14 18:21:07,848 INFO L273 TraceCheckUtils]: 17: Hoare triple {1218#true} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1218#true} is VALID [2018-11-14 18:21:07,848 INFO L273 TraceCheckUtils]: 18: Hoare triple {1218#true} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1218#true} is VALID [2018-11-14 18:21:07,848 INFO L273 TraceCheckUtils]: 19: Hoare triple {1218#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1218#true} is VALID [2018-11-14 18:21:07,848 INFO L273 TraceCheckUtils]: 20: Hoare triple {1218#true} assume true; {1218#true} is VALID [2018-11-14 18:21:07,849 INFO L273 TraceCheckUtils]: 21: Hoare triple {1218#true} assume !~bvsgt32(~len, 0bv32); {1218#true} is VALID [2018-11-14 18:21:07,849 INFO L273 TraceCheckUtils]: 22: Hoare triple {1218#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1218#true} is VALID [2018-11-14 18:21:07,849 INFO L273 TraceCheckUtils]: 23: Hoare triple {1218#true} assume true; {1218#true} is VALID [2018-11-14 18:21:07,851 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1218#true} {1238#(= |main_~#s~0.offset| (_ bv0 32))} #121#return; {1238#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:21:07,851 INFO L273 TraceCheckUtils]: 25: Hoare triple {1238#(= |main_~#s~0.offset| (_ bv0 32))} call write~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5bv32; {1299#(and (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:21:07,852 INFO L256 TraceCheckUtils]: 26: Hoare triple {1299#(and (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)))} call dll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {1218#true} is VALID [2018-11-14 18:21:07,852 INFO L273 TraceCheckUtils]: 27: Hoare triple {1218#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1306#(and (= dll_prepend_~data |dll_prepend_#in~data|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} is VALID [2018-11-14 18:21:07,852 INFO L256 TraceCheckUtils]: 28: Hoare triple {1306#(and (= dll_prepend_~data |dll_prepend_#in~data|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1218#true} is VALID [2018-11-14 18:21:07,869 INFO L273 TraceCheckUtils]: 29: Hoare triple {1218#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1313#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:21:07,878 INFO L273 TraceCheckUtils]: 30: Hoare triple {1313#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1313#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:21:07,893 INFO L273 TraceCheckUtils]: 31: Hoare triple {1313#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1320#(and (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-14 18:21:07,909 INFO L273 TraceCheckUtils]: 32: Hoare triple {1320#(and (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {1320#(and (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-14 18:21:07,913 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1320#(and (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} {1306#(and (= dll_prepend_~data |dll_prepend_#in~data|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} #129#return; {1327#(and (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= (select (select |#memory_int| |dll_prepend_#t~ret6.base|) |dll_prepend_#t~ret6.offset|) |dll_prepend_#in~data|) (= |dll_prepend_#t~ret6.offset| (_ bv0 32)) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} is VALID [2018-11-14 18:21:07,921 INFO L273 TraceCheckUtils]: 34: Hoare triple {1327#(and (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= (select (select |#memory_int| |dll_prepend_#t~ret6.base|) |dll_prepend_#t~ret6.offset|) |dll_prepend_#in~data|) (= |dll_prepend_#t~ret6.offset| (_ bv0 32)) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1331#(and (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= (_ bv0 32) dll_prepend_~new_head~1.offset) (= (select (select |#memory_int| dll_prepend_~new_head~1.base) dll_prepend_~new_head~1.offset) |dll_prepend_#in~data|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} is VALID [2018-11-14 18:21:07,922 INFO L273 TraceCheckUtils]: 35: Hoare triple {1331#(and (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= (_ bv0 32) dll_prepend_~new_head~1.offset) (= (select (select |#memory_int| dll_prepend_~new_head~1.base) dll_prepend_~new_head~1.offset) |dll_prepend_#in~data|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} assume #t~mem8.base != 0bv32 || #t~mem8.offset != 0bv32;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, ~bvadd32(8bv32, #t~mem9.offset), 4bv32);havoc #t~mem9.base, #t~mem9.offset; {1331#(and (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= (_ bv0 32) dll_prepend_~new_head~1.offset) (= (select (select |#memory_int| dll_prepend_~new_head~1.base) dll_prepend_~new_head~1.offset) |dll_prepend_#in~data|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} is VALID [2018-11-14 18:21:07,923 INFO L273 TraceCheckUtils]: 36: Hoare triple {1331#(and (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= (_ bv0 32) dll_prepend_~new_head~1.offset) (= (select (select |#memory_int| dll_prepend_~new_head~1.base) dll_prepend_~new_head~1.offset) |dll_prepend_#in~data|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base))} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {1338#(and (= |dll_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)))} is VALID [2018-11-14 18:21:07,924 INFO L273 TraceCheckUtils]: 37: Hoare triple {1338#(and (= |dll_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)))} assume true; {1338#(and (= |dll_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)))} is VALID [2018-11-14 18:21:07,929 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1338#(and (= |dll_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)))} {1299#(and (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)))} #123#return; {1345#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) main_~uneq~0) (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:21:07,930 INFO L273 TraceCheckUtils]: 39: Hoare triple {1345#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) main_~uneq~0) (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12 := read~intINTTYPE4(~ptr~0.base, ~ptr~0.offset, 4bv32); {1349#(and (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= |main_#t~mem12| main_~uneq~0))} is VALID [2018-11-14 18:21:07,931 INFO L273 TraceCheckUtils]: 40: Hoare triple {1349#(and (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= |main_#t~mem12| main_~uneq~0))} assume ~uneq~0 != #t~mem12;havoc #t~mem12; {1219#false} is VALID [2018-11-14 18:21:07,931 INFO L273 TraceCheckUtils]: 41: Hoare triple {1219#false} assume !false; {1219#false} is VALID [2018-11-14 18:21:07,936 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-14 18:21:07,936 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:21:07,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:21:07,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-14 18:21:07,941 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-11-14 18:21:07,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:21:07,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 18:21:08,022 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:21:08,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 18:21:08,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 18:21:08,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:21:08,023 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 12 states. [2018-11-14 18:21:10,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:21:10,705 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-14 18:21:10,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 18:21:10,705 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-11-14 18:21:10,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:21:10,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:21:10,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 45 transitions. [2018-11-14 18:21:10,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:21:10,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 45 transitions. [2018-11-14 18:21:10,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 45 transitions. [2018-11-14 18:21:10,787 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-14 18:21:10,791 INFO L225 Difference]: With dead ends: 49 [2018-11-14 18:21:10,791 INFO L226 Difference]: Without dead ends: 47 [2018-11-14 18:21:10,791 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-11-14 18:21:10,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-14 18:21:10,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-14 18:21:10,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:21:10,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2018-11-14 18:21:10,842 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-14 18:21:10,842 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-14 18:21:10,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:21:10,845 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-11-14 18:21:10,845 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-11-14 18:21:10,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:21:10,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:21:10,846 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-14 18:21:10,846 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-14 18:21:10,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:21:10,849 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-11-14 18:21:10,849 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-11-14 18:21:10,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:21:10,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:21:10,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:21:10,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:21:10,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 18:21:10,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-11-14 18:21:10,853 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 42 [2018-11-14 18:21:10,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:21:10,853 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-11-14 18:21:10,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 18:21:10,853 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-11-14 18:21:10,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 18:21:10,854 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:21:10,855 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:21:10,855 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:21:10,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:21:10,855 INFO L82 PathProgramCache]: Analyzing trace with hash -2014427157, now seen corresponding path program 1 times [2018-11-14 18:21:10,856 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:21:10,856 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-14 18:21:10,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:21:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:21:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:21:10,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:21:11,091 INFO L256 TraceCheckUtils]: 0: Hoare triple {1586#true} call ULTIMATE.init(); {1586#true} is VALID [2018-11-14 18:21:11,091 INFO L273 TraceCheckUtils]: 1: Hoare triple {1586#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1586#true} is VALID [2018-11-14 18:21:11,092 INFO L273 TraceCheckUtils]: 2: Hoare triple {1586#true} assume true; {1586#true} is VALID [2018-11-14 18:21:11,092 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1586#true} {1586#true} #131#return; {1586#true} is VALID [2018-11-14 18:21:11,092 INFO L256 TraceCheckUtils]: 4: Hoare triple {1586#true} call #t~ret18 := main(); {1586#true} is VALID [2018-11-14 18:21:11,092 INFO L273 TraceCheckUtils]: 5: Hoare triple {1586#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1586#true} is VALID [2018-11-14 18:21:11,092 INFO L256 TraceCheckUtils]: 6: Hoare triple {1586#true} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {1586#true} is VALID [2018-11-14 18:21:11,092 INFO L273 TraceCheckUtils]: 7: Hoare triple {1586#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1586#true} is VALID [2018-11-14 18:21:11,093 INFO L273 TraceCheckUtils]: 8: Hoare triple {1586#true} assume true; {1586#true} is VALID [2018-11-14 18:21:11,093 INFO L273 TraceCheckUtils]: 9: Hoare triple {1586#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1618#(not (= dll_create_~new_head~0.base (_ bv0 32)))} is VALID [2018-11-14 18:21:11,094 INFO L273 TraceCheckUtils]: 10: Hoare triple {1618#(not (= dll_create_~new_head~0.base (_ bv0 32)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1618#(not (= dll_create_~new_head~0.base (_ bv0 32)))} is VALID [2018-11-14 18:21:11,095 INFO L273 TraceCheckUtils]: 11: Hoare triple {1618#(not (= dll_create_~new_head~0.base (_ bv0 32)))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1618#(not (= dll_create_~new_head~0.base (_ bv0 32)))} is VALID [2018-11-14 18:21:11,095 INFO L273 TraceCheckUtils]: 12: Hoare triple {1618#(not (= dll_create_~new_head~0.base (_ bv0 32)))} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1618#(not (= dll_create_~new_head~0.base (_ bv0 32)))} is VALID [2018-11-14 18:21:11,096 INFO L273 TraceCheckUtils]: 13: Hoare triple {1618#(not (= dll_create_~new_head~0.base (_ bv0 32)))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1631#(not (= (_ bv0 32) dll_create_~head~0.base))} is VALID [2018-11-14 18:21:11,096 INFO L273 TraceCheckUtils]: 14: Hoare triple {1631#(not (= (_ bv0 32) dll_create_~head~0.base))} assume true; {1631#(not (= (_ bv0 32) dll_create_~head~0.base))} is VALID [2018-11-14 18:21:11,116 INFO L273 TraceCheckUtils]: 15: Hoare triple {1631#(not (= (_ bv0 32) dll_create_~head~0.base))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1631#(not (= (_ bv0 32) dll_create_~head~0.base))} is VALID [2018-11-14 18:21:11,118 INFO L273 TraceCheckUtils]: 16: Hoare triple {1631#(not (= (_ bv0 32) dll_create_~head~0.base))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1631#(not (= (_ bv0 32) dll_create_~head~0.base))} is VALID [2018-11-14 18:21:11,121 INFO L273 TraceCheckUtils]: 17: Hoare triple {1631#(not (= (_ bv0 32) dll_create_~head~0.base))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1631#(not (= (_ bv0 32) dll_create_~head~0.base))} is VALID [2018-11-14 18:21:11,122 INFO L273 TraceCheckUtils]: 18: Hoare triple {1631#(not (= (_ bv0 32) dll_create_~head~0.base))} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1587#false} is VALID [2018-11-14 18:21:11,122 INFO L273 TraceCheckUtils]: 19: Hoare triple {1587#false} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1587#false} is VALID [2018-11-14 18:21:11,122 INFO L273 TraceCheckUtils]: 20: Hoare triple {1587#false} assume true; {1587#false} is VALID [2018-11-14 18:21:11,122 INFO L273 TraceCheckUtils]: 21: Hoare triple {1587#false} assume !~bvsgt32(~len, 0bv32); {1587#false} is VALID [2018-11-14 18:21:11,123 INFO L273 TraceCheckUtils]: 22: Hoare triple {1587#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1587#false} is VALID [2018-11-14 18:21:11,123 INFO L273 TraceCheckUtils]: 23: Hoare triple {1587#false} assume true; {1587#false} is VALID [2018-11-14 18:21:11,123 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1587#false} {1586#true} #121#return; {1587#false} is VALID [2018-11-14 18:21:11,123 INFO L273 TraceCheckUtils]: 25: Hoare triple {1587#false} call write~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5bv32; {1587#false} is VALID [2018-11-14 18:21:11,123 INFO L256 TraceCheckUtils]: 26: Hoare triple {1587#false} call dll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {1587#false} is VALID [2018-11-14 18:21:11,123 INFO L273 TraceCheckUtils]: 27: Hoare triple {1587#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1587#false} is VALID [2018-11-14 18:21:11,124 INFO L256 TraceCheckUtils]: 28: Hoare triple {1587#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1587#false} is VALID [2018-11-14 18:21:11,124 INFO L273 TraceCheckUtils]: 29: Hoare triple {1587#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1587#false} is VALID [2018-11-14 18:21:11,124 INFO L273 TraceCheckUtils]: 30: Hoare triple {1587#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1587#false} is VALID [2018-11-14 18:21:11,124 INFO L273 TraceCheckUtils]: 31: Hoare triple {1587#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1587#false} is VALID [2018-11-14 18:21:11,125 INFO L273 TraceCheckUtils]: 32: Hoare triple {1587#false} assume true; {1587#false} is VALID [2018-11-14 18:21:11,125 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1587#false} {1587#false} #129#return; {1587#false} is VALID [2018-11-14 18:21:11,125 INFO L273 TraceCheckUtils]: 34: Hoare triple {1587#false} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1587#false} is VALID [2018-11-14 18:21:11,125 INFO L273 TraceCheckUtils]: 35: Hoare triple {1587#false} assume #t~mem8.base != 0bv32 || #t~mem8.offset != 0bv32;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, ~bvadd32(8bv32, #t~mem9.offset), 4bv32);havoc #t~mem9.base, #t~mem9.offset; {1587#false} is VALID [2018-11-14 18:21:11,126 INFO L273 TraceCheckUtils]: 36: Hoare triple {1587#false} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {1587#false} is VALID [2018-11-14 18:21:11,126 INFO L273 TraceCheckUtils]: 37: Hoare triple {1587#false} assume true; {1587#false} is VALID [2018-11-14 18:21:11,126 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1587#false} {1587#false} #123#return; {1587#false} is VALID [2018-11-14 18:21:11,126 INFO L273 TraceCheckUtils]: 39: Hoare triple {1587#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12 := read~intINTTYPE4(~ptr~0.base, ~ptr~0.offset, 4bv32); {1587#false} is VALID [2018-11-14 18:21:11,126 INFO L273 TraceCheckUtils]: 40: Hoare triple {1587#false} assume !(~uneq~0 != #t~mem12);havoc #t~mem12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset;~count~0 := 1bv32; {1587#false} is VALID [2018-11-14 18:21:11,127 INFO L273 TraceCheckUtils]: 41: Hoare triple {1587#false} assume true; {1587#false} is VALID [2018-11-14 18:21:11,127 INFO L273 TraceCheckUtils]: 42: Hoare triple {1587#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {1587#false} is VALID [2018-11-14 18:21:11,127 INFO L273 TraceCheckUtils]: 43: Hoare triple {1587#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {1587#false} is VALID [2018-11-14 18:21:11,127 INFO L273 TraceCheckUtils]: 44: Hoare triple {1587#false} assume !false; {1587#false} is VALID [2018-11-14 18:21:11,129 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:21:11,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:21:11,221 INFO L273 TraceCheckUtils]: 44: Hoare triple {1587#false} assume !false; {1587#false} is VALID [2018-11-14 18:21:11,221 INFO L273 TraceCheckUtils]: 43: Hoare triple {1587#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {1587#false} is VALID [2018-11-14 18:21:11,221 INFO L273 TraceCheckUtils]: 42: Hoare triple {1587#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {1587#false} is VALID [2018-11-14 18:21:11,222 INFO L273 TraceCheckUtils]: 41: Hoare triple {1587#false} assume true; {1587#false} is VALID [2018-11-14 18:21:11,222 INFO L273 TraceCheckUtils]: 40: Hoare triple {1587#false} assume !(~uneq~0 != #t~mem12);havoc #t~mem12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset;~count~0 := 1bv32; {1587#false} is VALID [2018-11-14 18:21:11,222 INFO L273 TraceCheckUtils]: 39: Hoare triple {1587#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12 := read~intINTTYPE4(~ptr~0.base, ~ptr~0.offset, 4bv32); {1587#false} is VALID [2018-11-14 18:21:11,222 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1586#true} {1587#false} #123#return; {1587#false} is VALID [2018-11-14 18:21:11,222 INFO L273 TraceCheckUtils]: 37: Hoare triple {1586#true} assume true; {1586#true} is VALID [2018-11-14 18:21:11,222 INFO L273 TraceCheckUtils]: 36: Hoare triple {1586#true} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {1586#true} is VALID [2018-11-14 18:21:11,223 INFO L273 TraceCheckUtils]: 35: Hoare triple {1586#true} assume #t~mem8.base != 0bv32 || #t~mem8.offset != 0bv32;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, ~bvadd32(8bv32, #t~mem9.offset), 4bv32);havoc #t~mem9.base, #t~mem9.offset; {1586#true} is VALID [2018-11-14 18:21:11,223 INFO L273 TraceCheckUtils]: 34: Hoare triple {1586#true} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1586#true} is VALID [2018-11-14 18:21:11,223 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1586#true} {1586#true} #129#return; {1586#true} is VALID [2018-11-14 18:21:11,223 INFO L273 TraceCheckUtils]: 32: Hoare triple {1586#true} assume true; {1586#true} is VALID [2018-11-14 18:21:11,223 INFO L273 TraceCheckUtils]: 31: Hoare triple {1586#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1586#true} is VALID [2018-11-14 18:21:11,224 INFO L273 TraceCheckUtils]: 30: Hoare triple {1586#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1586#true} is VALID [2018-11-14 18:21:11,224 INFO L273 TraceCheckUtils]: 29: Hoare triple {1586#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1586#true} is VALID [2018-11-14 18:21:11,224 INFO L256 TraceCheckUtils]: 28: Hoare triple {1586#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1586#true} is VALID [2018-11-14 18:21:11,224 INFO L273 TraceCheckUtils]: 27: Hoare triple {1586#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1586#true} is VALID [2018-11-14 18:21:11,224 INFO L256 TraceCheckUtils]: 26: Hoare triple {1587#false} call dll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {1586#true} is VALID [2018-11-14 18:21:11,224 INFO L273 TraceCheckUtils]: 25: Hoare triple {1587#false} call write~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5bv32; {1587#false} is VALID [2018-11-14 18:21:11,225 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1587#false} {1586#true} #121#return; {1587#false} is VALID [2018-11-14 18:21:11,225 INFO L273 TraceCheckUtils]: 23: Hoare triple {1587#false} assume true; {1587#false} is VALID [2018-11-14 18:21:11,225 INFO L273 TraceCheckUtils]: 22: Hoare triple {1587#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1587#false} is VALID [2018-11-14 18:21:11,225 INFO L273 TraceCheckUtils]: 21: Hoare triple {1587#false} assume !~bvsgt32(~len, 0bv32); {1587#false} is VALID [2018-11-14 18:21:11,225 INFO L273 TraceCheckUtils]: 20: Hoare triple {1587#false} assume true; {1587#false} is VALID [2018-11-14 18:21:11,225 INFO L273 TraceCheckUtils]: 19: Hoare triple {1587#false} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1587#false} is VALID [2018-11-14 18:21:11,226 INFO L273 TraceCheckUtils]: 18: Hoare triple {1631#(not (= (_ bv0 32) dll_create_~head~0.base))} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1587#false} is VALID [2018-11-14 18:21:11,226 INFO L273 TraceCheckUtils]: 17: Hoare triple {1631#(not (= (_ bv0 32) dll_create_~head~0.base))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1631#(not (= (_ bv0 32) dll_create_~head~0.base))} is VALID [2018-11-14 18:21:11,226 INFO L273 TraceCheckUtils]: 16: Hoare triple {1631#(not (= (_ bv0 32) dll_create_~head~0.base))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1631#(not (= (_ bv0 32) dll_create_~head~0.base))} is VALID [2018-11-14 18:21:11,227 INFO L273 TraceCheckUtils]: 15: Hoare triple {1631#(not (= (_ bv0 32) dll_create_~head~0.base))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1631#(not (= (_ bv0 32) dll_create_~head~0.base))} is VALID [2018-11-14 18:21:11,227 INFO L273 TraceCheckUtils]: 14: Hoare triple {1631#(not (= (_ bv0 32) dll_create_~head~0.base))} assume true; {1631#(not (= (_ bv0 32) dll_create_~head~0.base))} is VALID [2018-11-14 18:21:11,230 INFO L273 TraceCheckUtils]: 13: Hoare triple {1618#(not (= dll_create_~new_head~0.base (_ bv0 32)))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1631#(not (= (_ bv0 32) dll_create_~head~0.base))} is VALID [2018-11-14 18:21:11,230 INFO L273 TraceCheckUtils]: 12: Hoare triple {1618#(not (= dll_create_~new_head~0.base (_ bv0 32)))} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1618#(not (= dll_create_~new_head~0.base (_ bv0 32)))} is VALID [2018-11-14 18:21:11,232 INFO L273 TraceCheckUtils]: 11: Hoare triple {1618#(not (= dll_create_~new_head~0.base (_ bv0 32)))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1618#(not (= dll_create_~new_head~0.base (_ bv0 32)))} is VALID [2018-11-14 18:21:11,232 INFO L273 TraceCheckUtils]: 10: Hoare triple {1618#(not (= dll_create_~new_head~0.base (_ bv0 32)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1618#(not (= dll_create_~new_head~0.base (_ bv0 32)))} is VALID [2018-11-14 18:21:11,234 INFO L273 TraceCheckUtils]: 9: Hoare triple {1586#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1618#(not (= dll_create_~new_head~0.base (_ bv0 32)))} is VALID [2018-11-14 18:21:11,234 INFO L273 TraceCheckUtils]: 8: Hoare triple {1586#true} assume true; {1586#true} is VALID [2018-11-14 18:21:11,234 INFO L273 TraceCheckUtils]: 7: Hoare triple {1586#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1586#true} is VALID [2018-11-14 18:21:11,234 INFO L256 TraceCheckUtils]: 6: Hoare triple {1586#true} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {1586#true} is VALID [2018-11-14 18:21:11,235 INFO L273 TraceCheckUtils]: 5: Hoare triple {1586#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1586#true} is VALID [2018-11-14 18:21:11,235 INFO L256 TraceCheckUtils]: 4: Hoare triple {1586#true} call #t~ret18 := main(); {1586#true} is VALID [2018-11-14 18:21:11,235 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1586#true} {1586#true} #131#return; {1586#true} is VALID [2018-11-14 18:21:11,235 INFO L273 TraceCheckUtils]: 2: Hoare triple {1586#true} assume true; {1586#true} is VALID [2018-11-14 18:21:11,236 INFO L273 TraceCheckUtils]: 1: Hoare triple {1586#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1586#true} is VALID [2018-11-14 18:21:11,236 INFO L256 TraceCheckUtils]: 0: Hoare triple {1586#true} call ULTIMATE.init(); {1586#true} is VALID [2018-11-14 18:21:11,237 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (6)] Exception during sending of exit command (exit): Broken pipe [2018-11-14 18:21:11,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:21:11,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-14 18:21:11,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-11-14 18:21:11,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:21:11,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:21:11,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:21:11,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:21:11,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:21:11,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:21:11,359 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 4 states. [2018-11-14 18:21:11,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:21:11,762 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2018-11-14 18:21:11,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:21:11,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-11-14 18:21:11,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:21:11,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:21:11,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2018-11-14 18:21:11,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:21:11,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2018-11-14 18:21:11,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 85 transitions. [2018-11-14 18:21:11,878 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-14 18:21:11,880 INFO L225 Difference]: With dead ends: 78 [2018-11-14 18:21:11,881 INFO L226 Difference]: Without dead ends: 47 [2018-11-14 18:21:11,881 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:21:11,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-14 18:21:11,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-14 18:21:11,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:21:11,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2018-11-14 18:21:11,920 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-14 18:21:11,920 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-14 18:21:11,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:21:11,922 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-11-14 18:21:11,922 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-14 18:21:11,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:21:11,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:21:11,923 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-14 18:21:11,923 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-14 18:21:11,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:21:11,925 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-11-14 18:21:11,925 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-14 18:21:11,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:21:11,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:21:11,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:21:11,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:21:11,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 18:21:11,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-14 18:21:11,928 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 45 [2018-11-14 18:21:11,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:21:11,928 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-14 18:21:11,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:21:11,929 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-14 18:21:11,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 18:21:11,930 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:21:11,930 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:21:11,930 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:21:11,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:21:11,930 INFO L82 PathProgramCache]: Analyzing trace with hash 357312105, now seen corresponding path program 1 times [2018-11-14 18:21:11,931 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:21:11,931 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-14 18:21:11,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:21:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:21:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:21:12,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:21:12,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-14 18:21:12,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:21:12,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:21:12,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-14 18:21:12,197 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:21:14,260 WARN L854 $PredicateComparison]: unable to prove that (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |c_old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))) is different from true [2018-11-14 18:21:16,233 WARN L179 SmtUtils]: Spent 1.76 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-14 18:21:21,197 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-14 18:21:22,996 WARN L179 SmtUtils]: Spent 1.43 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-14 18:21:23,029 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:21:23,031 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:21:23,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-11-14 18:21:23,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 25 treesize of output 20 [2018-11-14 18:21:23,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:21:23,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:21:23,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:21:23,084 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2018-11-14 18:21:25,102 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:21:25,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 18:21:25,199 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-14 18:21:25,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:21:25,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:21:25,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:21:25,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:37 [2018-11-14 18:21:25,245 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:21:31,690 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 149 treesize of output 147 [2018-11-14 18:21:31,714 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 147 treesize of output 145 [2018-11-14 18:21:31,725 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:21:31,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:21:31,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:21:31,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:164, output treesize:160 [2018-11-14 18:21:32,838 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:21:37,577 WARN L179 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 37 [2018-11-14 18:21:37,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 18:21:37,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:21:37,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:21:37,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:21:37,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 18:21:37,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:296, output treesize:292 [2018-11-14 18:21:41,732 WARN L179 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 38 [2018-11-14 18:21:45,894 WARN L179 SmtUtils]: Spent 3.90 s on a formula simplification. DAG size of input: 119 DAG size of output: 54 [2018-11-14 18:21:46,005 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:21:46,025 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:21:46,039 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:21:46,060 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:21:46,061 INFO L303 Elim1Store]: Index analysis took 159 ms [2018-11-14 18:21:46,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-11-14 18:21:46,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:21:46,320 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:21:46,588 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:21:46,598 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:21:46,599 INFO L303 Elim1Store]: Index analysis took 300 ms [2018-11-14 18:21:46,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 167 [2018-11-14 18:21:47,356 WARN L179 SmtUtils]: Spent 733.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2018-11-14 18:21:47,379 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 67 [2018-11-14 18:21:47,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 67 treesize of output 64 [2018-11-14 18:21:47,396 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:21:47,533 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:21:47,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2018-11-14 18:21:47,979 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:21:47,980 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:21:47,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 50 [2018-11-14 18:21:47,983 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:21:48,058 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 9 treesize of output 1 [2018-11-14 18:21:48,059 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 18:21:48,101 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:21:48,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-11-14 18:21:48,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 34 treesize of output 30 [2018-11-14 18:21:48,416 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:21:48,468 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:21:48,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2018-11-14 18:21:48,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 41 treesize of output 35 [2018-11-14 18:21:48,519 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:21:48,561 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:21:49,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 88 [2018-11-14 18:21:49,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 78 [2018-11-14 18:21:49,178 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-14 18:21:49,439 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:21:49,493 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:21:49,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 99 [2018-11-14 18:21:49,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 81 [2018-11-14 18:21:49,710 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-11-14 18:21:50,071 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:21:50,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2018-11-14 18:21:50,078 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-14 18:21:50,266 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-14 18:21:50,566 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-14 18:21:50,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 79 [2018-11-14 18:21:50,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 70 treesize of output 67 [2018-11-14 18:21:50,748 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-14 18:21:51,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 63 [2018-11-14 18:21:51,559 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-11-14 18:21:52,439 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:21:52,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 86 [2018-11-14 18:21:52,665 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:21:52,667 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 74 [2018-11-14 18:21:52,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 46 [2018-11-14 18:21:52,718 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-14 18:21:52,760 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:21:52,886 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:21:53,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-11-14 18:21:53,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 17 [2018-11-14 18:21:53,296 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-14 18:21:53,328 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:21:53,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 69 [2018-11-14 18:21:53,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 49 [2018-11-14 18:21:53,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-11-14 18:21:53,949 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-14 18:21:54,122 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:21:54,209 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:21:54,287 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:21:54,554 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-14 18:21:54,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-11-14 18:21:54,897 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 5 variables, input treesize:328, output treesize:354 [2018-11-14 18:21:55,413 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN.