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-ext3-properties/sll_of_sll_nondet_append_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:25:31,083 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:25:31,086 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:25:31,099 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:25:31,100 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:25:31,101 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:25:31,102 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:25:31,104 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:25:31,106 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:25:31,107 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:25:31,108 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:25:31,108 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:25:31,110 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:25:31,111 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:25:31,112 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:25:31,113 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:25:31,114 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:25:31,116 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:25:31,118 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:25:31,120 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:25:31,121 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:25:31,122 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:25:31,125 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:25:31,125 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:25:31,125 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:25:31,126 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:25:31,127 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:25:31,128 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:25:31,129 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:25:31,130 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:25:31,131 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:25:31,132 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:25:31,132 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:25:31,132 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:25:31,133 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:25:31,134 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:25:31,134 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:25:31,150 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:25:31,150 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:25:31,151 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:25:31,151 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:25:31,152 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:25:31,152 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:25:31,153 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:25:31,153 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:25:31,153 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:25:31,153 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:25:31,153 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:25:31,154 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:25:31,154 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:25:31,154 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:25:31,154 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:25:31,154 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:25:31,154 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:25:31,155 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:25:31,155 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:25:31,155 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:25:31,155 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:25:31,155 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:25:31,156 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:25:31,156 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:25:31,156 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:25:31,156 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:25:31,156 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:25:31,157 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:25:31,157 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:25:31,157 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:25:31,157 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:25:31,157 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:25:31,158 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:25:31,203 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:25:31,221 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:25:31,225 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:25:31,227 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:25:31,227 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:25:31,228 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/sll_of_sll_nondet_append_true-unreach-call_true-valid-memsafety.i [2018-11-14 18:25:31,288 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adee5eb9e/9142ef4e8bb84e28a352013582ad213e/FLAGf27c08283 [2018-11-14 18:25:31,800 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:25:31,801 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_of_sll_nondet_append_true-unreach-call_true-valid-memsafety.i [2018-11-14 18:25:31,815 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adee5eb9e/9142ef4e8bb84e28a352013582ad213e/FLAGf27c08283 [2018-11-14 18:25:31,830 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adee5eb9e/9142ef4e8bb84e28a352013582ad213e [2018-11-14 18:25:31,840 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:25:31,841 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:25:31,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:25:31,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:25:31,851 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:25:31,852 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:25:31" (1/1) ... [2018-11-14 18:25:31,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2426c5e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:25:31, skipping insertion in model container [2018-11-14 18:25:31,856 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:25:31" (1/1) ... [2018-11-14 18:25:31,868 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:25:31,939 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:25:32,389 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:25:32,401 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:25:32,499 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:25:32,648 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:25:32,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:25:32 WrapperNode [2018-11-14 18:25:32,649 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:25:32,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:25:32,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:25:32,650 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:25:32,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:25:32" (1/1) ... [2018-11-14 18:25:32,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:25:32" (1/1) ... [2018-11-14 18:25:32,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:25:32" (1/1) ... [2018-11-14 18:25:32,688 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:25:32" (1/1) ... [2018-11-14 18:25:32,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:25:32" (1/1) ... [2018-11-14 18:25:32,756 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:25:32" (1/1) ... [2018-11-14 18:25:32,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:25:32" (1/1) ... [2018-11-14 18:25:32,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:25:32,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:25:32,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:25:32,781 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:25:32,785 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:25:32" (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:25:32,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:25:32,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:25:32,848 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 18:25:32,848 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 18:25:32,848 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-14 18:25:32,848 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-14 18:25:32,849 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create_with_sublist [2018-11-14 18:25:32,849 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_length [2018-11-14 18:25:32,849 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2018-11-14 18:25:32,849 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_hierarchical_destroy [2018-11-14 18:25:32,849 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:25:32,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:25:32,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:25:32,850 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 18:25:32,850 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 18:25:32,850 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 18:25:32,850 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 18:25:32,851 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 18:25:32,851 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 18:25:32,851 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 18:25:32,851 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 18:25:32,851 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 18:25:32,851 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 18:25:32,851 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 18:25:32,852 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 18:25:32,852 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 18:25:32,852 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 18:25:32,852 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 18:25:32,852 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 18:25:32,852 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 18:25:32,853 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 18:25:32,853 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 18:25:32,853 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 18:25:32,853 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 18:25:32,853 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 18:25:32,853 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 18:25:32,854 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 18:25:32,854 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 18:25:32,854 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 18:25:32,854 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 18:25:32,854 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 18:25:32,854 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 18:25:32,854 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 18:25:32,855 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 18:25:32,855 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 18:25:32,855 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 18:25:32,855 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 18:25:32,855 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 18:25:32,855 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 18:25:32,856 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 18:25:32,856 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 18:25:32,856 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 18:25:32,856 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 18:25:32,856 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 18:25:32,856 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 18:25:32,856 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 18:25:32,857 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 18:25:32,857 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 18:25:32,857 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 18:25:32,857 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 18:25:32,857 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 18:25:32,857 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 18:25:32,857 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 18:25:32,857 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 18:25:32,858 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 18:25:32,858 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 18:25:32,858 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 18:25:32,858 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 18:25:32,858 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 18:25:32,858 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 18:25:32,859 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 18:25:32,859 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 18:25:32,859 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 18:25:32,859 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 18:25:32,859 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 18:25:32,859 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 18:25:32,859 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 18:25:32,860 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 18:25:32,860 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 18:25:32,860 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 18:25:32,860 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 18:25:32,860 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 18:25:32,860 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 18:25:32,861 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 18:25:32,861 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 18:25:32,861 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 18:25:32,861 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 18:25:32,861 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 18:25:32,861 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 18:25:32,861 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 18:25:32,862 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 18:25:32,862 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 18:25:32,862 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 18:25:32,862 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 18:25:32,863 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 18:25:32,863 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 18:25:32,863 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 18:25:32,863 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 18:25:32,863 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 18:25:32,863 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 18:25:32,863 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 18:25:32,864 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 18:25:32,864 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 18:25:32,864 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 18:25:32,864 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 18:25:32,864 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 18:25:32,864 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 18:25:32,865 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 18:25:32,865 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 18:25:32,865 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 18:25:32,865 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 18:25:32,865 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 18:25:32,865 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 18:25:32,865 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 18:25:32,865 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 18:25:32,866 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 18:25:32,866 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 18:25:32,866 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 18:25:32,866 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-14 18:25:32,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:25:32,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 18:25:32,867 INFO L130 BoogieDeclarations]: Found specification of procedure node_create_with_sublist [2018-11-14 18:25:32,867 INFO L130 BoogieDeclarations]: Found specification of procedure sll_length [2018-11-14 18:25:32,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 18:25:32,867 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2018-11-14 18:25:32,867 INFO L130 BoogieDeclarations]: Found specification of procedure sll_hierarchical_destroy [2018-11-14 18:25:32,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:25:32,867 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:25:32,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:25:32,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:25:34,422 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:25:34,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:25:34 BoogieIcfgContainer [2018-11-14 18:25:34,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:25:34,424 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:25:34,424 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:25:34,427 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:25:34,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:25:31" (1/3) ... [2018-11-14 18:25:34,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ff7fee6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:25:34, skipping insertion in model container [2018-11-14 18:25:34,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:25:32" (2/3) ... [2018-11-14 18:25:34,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ff7fee6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:25:34, skipping insertion in model container [2018-11-14 18:25:34,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:25:34" (3/3) ... [2018-11-14 18:25:34,432 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append_true-unreach-call_true-valid-memsafety.i [2018-11-14 18:25:34,442 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:25:34,451 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:25:34,469 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:25:34,504 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:25:34,505 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:25:34,506 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:25:34,506 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:25:34,506 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:25:34,506 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:25:34,507 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:25:34,507 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:25:34,507 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:25:34,529 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-11-14 18:25:34,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 18:25:34,537 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:25:34,538 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:25:34,540 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:25:34,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:25:34,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1747652114, now seen corresponding path program 1 times [2018-11-14 18:25:34,552 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:25:34,553 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:25:34,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:25:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:25:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:25:34,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:25:34,731 INFO L256 TraceCheckUtils]: 0: Hoare triple {79#true} call ULTIMATE.init(); {79#true} is VALID [2018-11-14 18:25:34,735 INFO L273 TraceCheckUtils]: 1: Hoare triple {79#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {79#true} is VALID [2018-11-14 18:25:34,735 INFO L273 TraceCheckUtils]: 2: Hoare triple {79#true} assume true; {79#true} is VALID [2018-11-14 18:25:34,736 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {79#true} {79#true} #218#return; {79#true} is VALID [2018-11-14 18:25:34,736 INFO L256 TraceCheckUtils]: 4: Hoare triple {79#true} call #t~ret25 := main(); {79#true} is VALID [2018-11-14 18:25:34,736 INFO L273 TraceCheckUtils]: 5: Hoare triple {79#true} ~min~0 := 3bv32;~max~0 := 5bv32;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);~i~0 := ~min~0; {79#true} is VALID [2018-11-14 18:25:34,737 INFO L273 TraceCheckUtils]: 6: Hoare triple {79#true} assume !true; {80#false} is VALID [2018-11-14 18:25:34,737 INFO L273 TraceCheckUtils]: 7: Hoare triple {80#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~i~0 := ~min~0; {80#false} is VALID [2018-11-14 18:25:34,738 INFO L273 TraceCheckUtils]: 8: Hoare triple {80#false} assume true; {80#false} is VALID [2018-11-14 18:25:34,738 INFO L273 TraceCheckUtils]: 9: Hoare triple {80#false} assume !!(0bv32 != ~ptr~0.base || 0bv32 != ~ptr~0.offset); {80#false} is VALID [2018-11-14 18:25:34,739 INFO L273 TraceCheckUtils]: 10: Hoare triple {80#false} assume ~bvsgt32(~i~0, ~max~0); {80#false} is VALID [2018-11-14 18:25:34,739 INFO L273 TraceCheckUtils]: 11: Hoare triple {80#false} assume !false; {80#false} is VALID [2018-11-14 18:25:34,743 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:25:34,743 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:25:34,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:25:34,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:25:34,754 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-14 18:25:34,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:25:34,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:25:34,839 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:25:34,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:25:34,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:25:34,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:25:34,851 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-11-14 18:25:35,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:35,482 INFO L93 Difference]: Finished difference Result 146 states and 197 transitions. [2018-11-14 18:25:35,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:25:35,483 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-14 18:25:35,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:25:35,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:25:35,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 197 transitions. [2018-11-14 18:25:35,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:25:35,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 197 transitions. [2018-11-14 18:25:35,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 197 transitions. [2018-11-14 18:25:36,107 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:25:36,122 INFO L225 Difference]: With dead ends: 146 [2018-11-14 18:25:36,122 INFO L226 Difference]: Without dead ends: 57 [2018-11-14 18:25:36,127 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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:25:36,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-14 18:25:36,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-14 18:25:36,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:25:36,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 57 states. [2018-11-14 18:25:36,189 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-14 18:25:36,189 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-14 18:25:36,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:36,197 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2018-11-14 18:25:36,197 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2018-11-14 18:25:36,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:25:36,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:25:36,198 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-14 18:25:36,199 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-14 18:25:36,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:36,205 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2018-11-14 18:25:36,205 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2018-11-14 18:25:36,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:25:36,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:25:36,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:25:36,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:25:36,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-14 18:25:36,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2018-11-14 18:25:36,212 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 12 [2018-11-14 18:25:36,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:25:36,213 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2018-11-14 18:25:36,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:25:36,213 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2018-11-14 18:25:36,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 18:25:36,214 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:25:36,214 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:25:36,215 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:25:36,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:25:36,215 INFO L82 PathProgramCache]: Analyzing trace with hash 2085922786, now seen corresponding path program 1 times [2018-11-14 18:25:36,216 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:25:36,216 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:25:36,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:25:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:25:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:25:36,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:25:36,404 INFO L256 TraceCheckUtils]: 0: Hoare triple {503#true} call ULTIMATE.init(); {503#true} is VALID [2018-11-14 18:25:36,405 INFO L273 TraceCheckUtils]: 1: Hoare triple {503#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {503#true} is VALID [2018-11-14 18:25:36,405 INFO L273 TraceCheckUtils]: 2: Hoare triple {503#true} assume true; {503#true} is VALID [2018-11-14 18:25:36,405 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {503#true} {503#true} #218#return; {503#true} is VALID [2018-11-14 18:25:36,406 INFO L256 TraceCheckUtils]: 4: Hoare triple {503#true} call #t~ret25 := main(); {503#true} is VALID [2018-11-14 18:25:36,407 INFO L273 TraceCheckUtils]: 5: Hoare triple {503#true} ~min~0 := 3bv32;~max~0 := 5bv32;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);~i~0 := ~min~0; {523#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:36,407 INFO L273 TraceCheckUtils]: 6: Hoare triple {523#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {523#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:36,410 INFO L273 TraceCheckUtils]: 7: Hoare triple {523#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !~bvsle32(~i~0, ~max~0); {504#false} is VALID [2018-11-14 18:25:36,410 INFO L273 TraceCheckUtils]: 8: Hoare triple {504#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~i~0 := ~min~0; {504#false} is VALID [2018-11-14 18:25:36,411 INFO L273 TraceCheckUtils]: 9: Hoare triple {504#false} assume true; {504#false} is VALID [2018-11-14 18:25:36,411 INFO L273 TraceCheckUtils]: 10: Hoare triple {504#false} assume !!(0bv32 != ~ptr~0.base || 0bv32 != ~ptr~0.offset); {504#false} is VALID [2018-11-14 18:25:36,411 INFO L273 TraceCheckUtils]: 11: Hoare triple {504#false} assume ~bvsgt32(~i~0, ~max~0); {504#false} is VALID [2018-11-14 18:25:36,411 INFO L273 TraceCheckUtils]: 12: Hoare triple {504#false} assume !false; {504#false} is VALID [2018-11-14 18:25:36,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:25:36,413 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:25:36,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:25:36,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:25:36,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-14 18:25:36,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:25:36,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:25:36,437 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:25:36,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:25:36,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:25:36,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:25:36,439 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand 3 states. [2018-11-14 18:25:36,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:36,978 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2018-11-14 18:25:36,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:25:36,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-14 18:25:36,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:25:36,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:25:36,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2018-11-14 18:25:36,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:25:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2018-11-14 18:25:36,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 102 transitions. [2018-11-14 18:25:37,203 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:25:37,207 INFO L225 Difference]: With dead ends: 84 [2018-11-14 18:25:37,207 INFO L226 Difference]: Without dead ends: 64 [2018-11-14 18:25:37,208 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:25:37,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-14 18:25:37,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2018-11-14 18:25:37,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:25:37,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 59 states. [2018-11-14 18:25:37,250 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 59 states. [2018-11-14 18:25:37,250 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 59 states. [2018-11-14 18:25:37,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:37,256 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2018-11-14 18:25:37,256 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2018-11-14 18:25:37,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:25:37,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:25:37,258 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 64 states. [2018-11-14 18:25:37,258 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 64 states. [2018-11-14 18:25:37,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:37,263 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2018-11-14 18:25:37,263 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2018-11-14 18:25:37,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:25:37,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:25:37,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:25:37,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:25:37,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-14 18:25:37,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2018-11-14 18:25:37,268 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 13 [2018-11-14 18:25:37,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:25:37,269 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2018-11-14 18:25:37,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:25:37,269 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2018-11-14 18:25:37,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 18:25:37,270 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:25:37,270 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:25:37,270 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:25:37,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:25:37,271 INFO L82 PathProgramCache]: Analyzing trace with hash 985809845, now seen corresponding path program 1 times [2018-11-14 18:25:37,271 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:25:37,271 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:25:37,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:25:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:25:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:25:37,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:25:37,447 INFO L256 TraceCheckUtils]: 0: Hoare triple {865#true} call ULTIMATE.init(); {865#true} is VALID [2018-11-14 18:25:37,448 INFO L273 TraceCheckUtils]: 1: Hoare triple {865#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {865#true} is VALID [2018-11-14 18:25:37,448 INFO L273 TraceCheckUtils]: 2: Hoare triple {865#true} assume true; {865#true} is VALID [2018-11-14 18:25:37,448 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {865#true} {865#true} #218#return; {865#true} is VALID [2018-11-14 18:25:37,449 INFO L256 TraceCheckUtils]: 4: Hoare triple {865#true} call #t~ret25 := main(); {865#true} is VALID [2018-11-14 18:25:37,450 INFO L273 TraceCheckUtils]: 5: Hoare triple {865#true} ~min~0 := 3bv32;~max~0 := 5bv32;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);~i~0 := ~min~0; {885#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:37,451 INFO L273 TraceCheckUtils]: 6: Hoare triple {885#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {885#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:37,452 INFO L273 TraceCheckUtils]: 7: Hoare triple {885#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {885#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:37,452 INFO L273 TraceCheckUtils]: 8: Hoare triple {885#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {885#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:37,454 INFO L273 TraceCheckUtils]: 9: Hoare triple {885#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {885#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:37,455 INFO L273 TraceCheckUtils]: 10: Hoare triple {885#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {901#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv4 32) main_~i~0))} is VALID [2018-11-14 18:25:37,456 INFO L273 TraceCheckUtils]: 11: Hoare triple {901#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv4 32) main_~i~0))} assume true; {901#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv4 32) main_~i~0))} is VALID [2018-11-14 18:25:37,457 INFO L273 TraceCheckUtils]: 12: Hoare triple {901#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv4 32) main_~i~0))} assume !~bvsle32(~i~0, ~max~0); {866#false} is VALID [2018-11-14 18:25:37,457 INFO L273 TraceCheckUtils]: 13: Hoare triple {866#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~i~0 := ~min~0; {866#false} is VALID [2018-11-14 18:25:37,458 INFO L273 TraceCheckUtils]: 14: Hoare triple {866#false} assume true; {866#false} is VALID [2018-11-14 18:25:37,458 INFO L273 TraceCheckUtils]: 15: Hoare triple {866#false} assume !!(0bv32 != ~ptr~0.base || 0bv32 != ~ptr~0.offset); {866#false} is VALID [2018-11-14 18:25:37,459 INFO L273 TraceCheckUtils]: 16: Hoare triple {866#false} assume ~bvsgt32(~i~0, ~max~0); {866#false} is VALID [2018-11-14 18:25:37,459 INFO L273 TraceCheckUtils]: 17: Hoare triple {866#false} assume !false; {866#false} is VALID [2018-11-14 18:25:37,462 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:25:37,462 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:25:37,591 INFO L273 TraceCheckUtils]: 17: Hoare triple {866#false} assume !false; {866#false} is VALID [2018-11-14 18:25:37,591 INFO L273 TraceCheckUtils]: 16: Hoare triple {866#false} assume ~bvsgt32(~i~0, ~max~0); {866#false} is VALID [2018-11-14 18:25:37,592 INFO L273 TraceCheckUtils]: 15: Hoare triple {866#false} assume !!(0bv32 != ~ptr~0.base || 0bv32 != ~ptr~0.offset); {866#false} is VALID [2018-11-14 18:25:37,592 INFO L273 TraceCheckUtils]: 14: Hoare triple {866#false} assume true; {866#false} is VALID [2018-11-14 18:25:37,592 INFO L273 TraceCheckUtils]: 13: Hoare triple {866#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~i~0 := ~min~0; {866#false} is VALID [2018-11-14 18:25:37,601 INFO L273 TraceCheckUtils]: 12: Hoare triple {938#(bvsle main_~i~0 main_~max~0)} assume !~bvsle32(~i~0, ~max~0); {866#false} is VALID [2018-11-14 18:25:37,602 INFO L273 TraceCheckUtils]: 11: Hoare triple {938#(bvsle main_~i~0 main_~max~0)} assume true; {938#(bvsle main_~i~0 main_~max~0)} is VALID [2018-11-14 18:25:37,605 INFO L273 TraceCheckUtils]: 10: Hoare triple {945#(bvsle (bvadd main_~i~0 (_ bv1 32)) main_~max~0)} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {938#(bvsle main_~i~0 main_~max~0)} is VALID [2018-11-14 18:25:37,610 INFO L273 TraceCheckUtils]: 9: Hoare triple {945#(bvsle (bvadd main_~i~0 (_ bv1 32)) main_~max~0)} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {945#(bvsle (bvadd main_~i~0 (_ bv1 32)) main_~max~0)} is VALID [2018-11-14 18:25:37,611 INFO L273 TraceCheckUtils]: 8: Hoare triple {945#(bvsle (bvadd main_~i~0 (_ bv1 32)) main_~max~0)} assume true; {945#(bvsle (bvadd main_~i~0 (_ bv1 32)) main_~max~0)} is VALID [2018-11-14 18:25:37,616 INFO L273 TraceCheckUtils]: 7: Hoare triple {945#(bvsle (bvadd main_~i~0 (_ bv1 32)) main_~max~0)} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {945#(bvsle (bvadd main_~i~0 (_ bv1 32)) main_~max~0)} is VALID [2018-11-14 18:25:37,618 INFO L273 TraceCheckUtils]: 6: Hoare triple {945#(bvsle (bvadd main_~i~0 (_ bv1 32)) main_~max~0)} assume true; {945#(bvsle (bvadd main_~i~0 (_ bv1 32)) main_~max~0)} is VALID [2018-11-14 18:25:37,619 INFO L273 TraceCheckUtils]: 5: Hoare triple {865#true} ~min~0 := 3bv32;~max~0 := 5bv32;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);~i~0 := ~min~0; {945#(bvsle (bvadd main_~i~0 (_ bv1 32)) main_~max~0)} is VALID [2018-11-14 18:25:37,620 INFO L256 TraceCheckUtils]: 4: Hoare triple {865#true} call #t~ret25 := main(); {865#true} is VALID [2018-11-14 18:25:37,620 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {865#true} {865#true} #218#return; {865#true} is VALID [2018-11-14 18:25:37,620 INFO L273 TraceCheckUtils]: 2: Hoare triple {865#true} assume true; {865#true} is VALID [2018-11-14 18:25:37,620 INFO L273 TraceCheckUtils]: 1: Hoare triple {865#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {865#true} is VALID [2018-11-14 18:25:37,621 INFO L256 TraceCheckUtils]: 0: Hoare triple {865#true} call ULTIMATE.init(); {865#true} is VALID [2018-11-14 18:25:37,622 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:25:37,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:25:37,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 18:25:37,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-14 18:25:37,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:25:37,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:25:37,672 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:25:37,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:25:37,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:25:37,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:25:37,674 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand 6 states. [2018-11-14 18:25:38,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:38,539 INFO L93 Difference]: Finished difference Result 100 states and 121 transitions. [2018-11-14 18:25:38,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:25:38,539 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-14 18:25:38,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:25:38,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:25:38,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2018-11-14 18:25:38,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:25:38,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2018-11-14 18:25:38,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 121 transitions. [2018-11-14 18:25:38,808 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:25:38,811 INFO L225 Difference]: With dead ends: 100 [2018-11-14 18:25:38,811 INFO L226 Difference]: Without dead ends: 80 [2018-11-14 18:25:38,812 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:25:38,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-14 18:25:38,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-11-14 18:25:38,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:25:38,875 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 77 states. [2018-11-14 18:25:38,875 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 77 states. [2018-11-14 18:25:38,875 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 77 states. [2018-11-14 18:25:38,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:38,880 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2018-11-14 18:25:38,881 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2018-11-14 18:25:38,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:25:38,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:25:38,882 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 80 states. [2018-11-14 18:25:38,882 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 80 states. [2018-11-14 18:25:38,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:38,887 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2018-11-14 18:25:38,888 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2018-11-14 18:25:38,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:25:38,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:25:38,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:25:38,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:25:38,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-14 18:25:38,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 91 transitions. [2018-11-14 18:25:38,894 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 91 transitions. Word has length 18 [2018-11-14 18:25:38,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:25:38,894 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 91 transitions. [2018-11-14 18:25:38,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:25:38,895 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 91 transitions. [2018-11-14 18:25:38,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 18:25:38,896 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:25:38,896 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:25:38,897 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:25:38,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:25:38,897 INFO L82 PathProgramCache]: Analyzing trace with hash -359447595, now seen corresponding path program 2 times [2018-11-14 18:25:38,898 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:25:38,898 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:25:38,933 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 18:25:38,959 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 18:25:38,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:25:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:25:38,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:25:39,173 INFO L256 TraceCheckUtils]: 0: Hoare triple {1380#true} call ULTIMATE.init(); {1380#true} is VALID [2018-11-14 18:25:39,174 INFO L273 TraceCheckUtils]: 1: Hoare triple {1380#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1380#true} is VALID [2018-11-14 18:25:39,174 INFO L273 TraceCheckUtils]: 2: Hoare triple {1380#true} assume true; {1380#true} is VALID [2018-11-14 18:25:39,175 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1380#true} {1380#true} #218#return; {1380#true} is VALID [2018-11-14 18:25:39,175 INFO L256 TraceCheckUtils]: 4: Hoare triple {1380#true} call #t~ret25 := main(); {1380#true} is VALID [2018-11-14 18:25:39,176 INFO L273 TraceCheckUtils]: 5: Hoare triple {1380#true} ~min~0 := 3bv32;~max~0 := 5bv32;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);~i~0 := ~min~0; {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:39,177 INFO L273 TraceCheckUtils]: 6: Hoare triple {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:39,178 INFO L273 TraceCheckUtils]: 7: Hoare triple {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:39,178 INFO L273 TraceCheckUtils]: 8: Hoare triple {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:39,184 INFO L273 TraceCheckUtils]: 9: Hoare triple {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:39,185 INFO L273 TraceCheckUtils]: 10: Hoare triple {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:39,186 INFO L273 TraceCheckUtils]: 11: Hoare triple {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:39,186 INFO L273 TraceCheckUtils]: 12: Hoare triple {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:39,187 INFO L273 TraceCheckUtils]: 13: Hoare triple {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:39,188 INFO L273 TraceCheckUtils]: 14: Hoare triple {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:39,189 INFO L273 TraceCheckUtils]: 15: Hoare triple {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:39,190 INFO L273 TraceCheckUtils]: 16: Hoare triple {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:39,191 INFO L273 TraceCheckUtils]: 17: Hoare triple {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:39,192 INFO L273 TraceCheckUtils]: 18: Hoare triple {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:39,193 INFO L273 TraceCheckUtils]: 19: Hoare triple {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:39,194 INFO L273 TraceCheckUtils]: 20: Hoare triple {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:39,195 INFO L273 TraceCheckUtils]: 21: Hoare triple {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:39,196 INFO L273 TraceCheckUtils]: 22: Hoare triple {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !~bvsle32(~i~0, ~max~0); {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:39,197 INFO L273 TraceCheckUtils]: 23: Hoare triple {1400#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~i~0 := ~min~0; {1455#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:39,198 INFO L273 TraceCheckUtils]: 24: Hoare triple {1455#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {1455#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:39,199 INFO L273 TraceCheckUtils]: 25: Hoare triple {1455#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!(0bv32 != ~ptr~0.base || 0bv32 != ~ptr~0.offset); {1455#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:39,201 INFO L273 TraceCheckUtils]: 26: Hoare triple {1455#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume ~bvsgt32(~i~0, ~max~0); {1381#false} is VALID [2018-11-14 18:25:39,201 INFO L273 TraceCheckUtils]: 27: Hoare triple {1381#false} assume !false; {1381#false} is VALID [2018-11-14 18:25:39,207 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-14 18:25:39,207 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:25:39,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:25:39,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 18:25:39,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-14 18:25:39,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:25:39,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:25:39,259 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:25:39,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:25:39,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:25:39,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:25:39,261 INFO L87 Difference]: Start difference. First operand 77 states and 91 transitions. Second operand 4 states. [2018-11-14 18:25:39,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:39,920 INFO L93 Difference]: Finished difference Result 93 states and 111 transitions. [2018-11-14 18:25:39,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:25:39,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-14 18:25:39,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:25:39,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:25:39,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2018-11-14 18:25:39,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:25:39,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2018-11-14 18:25:39,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 95 transitions. [2018-11-14 18:25:40,135 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:25:40,138 INFO L225 Difference]: With dead ends: 93 [2018-11-14 18:25:40,138 INFO L226 Difference]: Without dead ends: 91 [2018-11-14 18:25:40,139 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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:25:40,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-14 18:25:40,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 77. [2018-11-14 18:25:40,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:25:40,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 77 states. [2018-11-14 18:25:40,201 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 77 states. [2018-11-14 18:25:40,201 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 77 states. [2018-11-14 18:25:40,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:40,206 INFO L93 Difference]: Finished difference Result 91 states and 109 transitions. [2018-11-14 18:25:40,206 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2018-11-14 18:25:40,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:25:40,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:25:40,208 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 91 states. [2018-11-14 18:25:40,208 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 91 states. [2018-11-14 18:25:40,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:40,217 INFO L93 Difference]: Finished difference Result 91 states and 109 transitions. [2018-11-14 18:25:40,217 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2018-11-14 18:25:40,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:25:40,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:25:40,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:25:40,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:25:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-14 18:25:40,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 91 transitions. [2018-11-14 18:25:40,226 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 91 transitions. Word has length 28 [2018-11-14 18:25:40,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:25:40,226 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 91 transitions. [2018-11-14 18:25:40,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:25:40,227 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 91 transitions. [2018-11-14 18:25:40,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 18:25:40,232 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:25:40,232 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:25:40,232 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:25:40,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:25:40,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1074794390, now seen corresponding path program 1 times [2018-11-14 18:25:40,233 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:25:40,234 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:25:40,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:25:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:25:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:25:40,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:25:40,382 INFO L256 TraceCheckUtils]: 0: Hoare triple {1882#true} call ULTIMATE.init(); {1882#true} is VALID [2018-11-14 18:25:40,383 INFO L273 TraceCheckUtils]: 1: Hoare triple {1882#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1882#true} is VALID [2018-11-14 18:25:40,383 INFO L273 TraceCheckUtils]: 2: Hoare triple {1882#true} assume true; {1882#true} is VALID [2018-11-14 18:25:40,383 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1882#true} {1882#true} #218#return; {1882#true} is VALID [2018-11-14 18:25:40,384 INFO L256 TraceCheckUtils]: 4: Hoare triple {1882#true} call #t~ret25 := main(); {1882#true} is VALID [2018-11-14 18:25:40,384 INFO L273 TraceCheckUtils]: 5: Hoare triple {1882#true} ~min~0 := 3bv32;~max~0 := 5bv32;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);~i~0 := ~min~0; {1882#true} is VALID [2018-11-14 18:25:40,384 INFO L273 TraceCheckUtils]: 6: Hoare triple {1882#true} assume true; {1882#true} is VALID [2018-11-14 18:25:40,384 INFO L273 TraceCheckUtils]: 7: Hoare triple {1882#true} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {1882#true} is VALID [2018-11-14 18:25:40,385 INFO L273 TraceCheckUtils]: 8: Hoare triple {1882#true} assume true; {1882#true} is VALID [2018-11-14 18:25:40,385 INFO L273 TraceCheckUtils]: 9: Hoare triple {1882#true} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {1882#true} is VALID [2018-11-14 18:25:40,385 INFO L273 TraceCheckUtils]: 10: Hoare triple {1882#true} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {1882#true} is VALID [2018-11-14 18:25:40,385 INFO L273 TraceCheckUtils]: 11: Hoare triple {1882#true} assume true; {1882#true} is VALID [2018-11-14 18:25:40,386 INFO L273 TraceCheckUtils]: 12: Hoare triple {1882#true} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {1882#true} is VALID [2018-11-14 18:25:40,386 INFO L273 TraceCheckUtils]: 13: Hoare triple {1882#true} assume true; {1882#true} is VALID [2018-11-14 18:25:40,386 INFO L273 TraceCheckUtils]: 14: Hoare triple {1882#true} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {1882#true} is VALID [2018-11-14 18:25:40,387 INFO L273 TraceCheckUtils]: 15: Hoare triple {1882#true} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {1882#true} is VALID [2018-11-14 18:25:40,387 INFO L273 TraceCheckUtils]: 16: Hoare triple {1882#true} assume true; {1882#true} is VALID [2018-11-14 18:25:40,387 INFO L273 TraceCheckUtils]: 17: Hoare triple {1882#true} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {1882#true} is VALID [2018-11-14 18:25:40,388 INFO L273 TraceCheckUtils]: 18: Hoare triple {1882#true} assume true; {1882#true} is VALID [2018-11-14 18:25:40,388 INFO L273 TraceCheckUtils]: 19: Hoare triple {1882#true} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {1882#true} is VALID [2018-11-14 18:25:40,388 INFO L273 TraceCheckUtils]: 20: Hoare triple {1882#true} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {1882#true} is VALID [2018-11-14 18:25:40,389 INFO L273 TraceCheckUtils]: 21: Hoare triple {1882#true} assume true; {1882#true} is VALID [2018-11-14 18:25:40,389 INFO L273 TraceCheckUtils]: 22: Hoare triple {1882#true} assume !~bvsle32(~i~0, ~max~0); {1882#true} is VALID [2018-11-14 18:25:40,389 INFO L273 TraceCheckUtils]: 23: Hoare triple {1882#true} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~i~0 := ~min~0; {1882#true} is VALID [2018-11-14 18:25:40,389 INFO L273 TraceCheckUtils]: 24: Hoare triple {1882#true} assume true; {1882#true} is VALID [2018-11-14 18:25:40,390 INFO L273 TraceCheckUtils]: 25: Hoare triple {1882#true} assume !!(0bv32 != ~ptr~0.base || 0bv32 != ~ptr~0.offset); {1962#(or (not (= (_ bv0 32) main_~ptr~0.base)) (not (= main_~ptr~0.offset (_ bv0 32))))} is VALID [2018-11-14 18:25:40,394 INFO L273 TraceCheckUtils]: 26: Hoare triple {1962#(or (not (= (_ bv0 32) main_~ptr~0.base)) (not (= main_~ptr~0.offset (_ bv0 32))))} assume !~bvsgt32(~i~0, ~max~0); {1962#(or (not (= (_ bv0 32) main_~ptr~0.base)) (not (= main_~ptr~0.offset (_ bv0 32))))} is VALID [2018-11-14 18:25:40,394 INFO L273 TraceCheckUtils]: 27: Hoare triple {1962#(or (not (= (_ bv0 32) main_~ptr~0.base)) (not (= main_~ptr~0.offset (_ bv0 32))))} assume true; {1962#(or (not (= (_ bv0 32) main_~ptr~0.base)) (not (= main_~ptr~0.offset (_ bv0 32))))} is VALID [2018-11-14 18:25:40,396 INFO L273 TraceCheckUtils]: 28: Hoare triple {1962#(or (not (= (_ bv0 32) main_~ptr~0.base)) (not (= main_~ptr~0.offset (_ bv0 32))))} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {1883#false} is VALID [2018-11-14 18:25:40,396 INFO L273 TraceCheckUtils]: 29: Hoare triple {1883#false} #t~post19 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post19);havoc #t~post19; {1883#false} is VALID [2018-11-14 18:25:40,396 INFO L273 TraceCheckUtils]: 30: Hoare triple {1883#false} assume true; {1883#false} is VALID [2018-11-14 18:25:40,396 INFO L273 TraceCheckUtils]: 31: Hoare triple {1883#false} assume !!(0bv32 != ~ptr~0.base || 0bv32 != ~ptr~0.offset); {1883#false} is VALID [2018-11-14 18:25:40,397 INFO L273 TraceCheckUtils]: 32: Hoare triple {1883#false} assume ~bvsgt32(~i~0, ~max~0); {1883#false} is VALID [2018-11-14 18:25:40,397 INFO L273 TraceCheckUtils]: 33: Hoare triple {1883#false} assume !false; {1883#false} is VALID [2018-11-14 18:25:40,400 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-14 18:25:40,400 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:25:40,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:25:40,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:25:40,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-14 18:25:40,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:25:40,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:25:40,443 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:25:40,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:25:40,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:25:40,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:25:40,445 INFO L87 Difference]: Start difference. First operand 77 states and 91 transitions. Second operand 3 states. [2018-11-14 18:25:40,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:40,811 INFO L93 Difference]: Finished difference Result 107 states and 127 transitions. [2018-11-14 18:25:40,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:25:40,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-14 18:25:40,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:25:40,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:25:40,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2018-11-14 18:25:40,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:25:40,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2018-11-14 18:25:40,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 97 transitions. [2018-11-14 18:25:40,966 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:25:40,968 INFO L225 Difference]: With dead ends: 107 [2018-11-14 18:25:40,969 INFO L226 Difference]: Without dead ends: 84 [2018-11-14 18:25:40,970 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:25:40,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-14 18:25:41,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2018-11-14 18:25:41,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:25:41,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 79 states. [2018-11-14 18:25:41,068 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 79 states. [2018-11-14 18:25:41,068 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 79 states. [2018-11-14 18:25:41,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:41,072 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2018-11-14 18:25:41,072 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2018-11-14 18:25:41,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:25:41,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:25:41,072 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 84 states. [2018-11-14 18:25:41,073 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 84 states. [2018-11-14 18:25:41,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:41,076 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2018-11-14 18:25:41,076 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2018-11-14 18:25:41,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:25:41,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:25:41,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:25:41,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:25:41,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-14 18:25:41,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2018-11-14 18:25:41,081 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 34 [2018-11-14 18:25:41,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:25:41,082 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2018-11-14 18:25:41,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:25:41,082 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2018-11-14 18:25:41,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-14 18:25:41,083 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:25:41,083 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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:25:41,084 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:25:41,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:25:41,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1090010691, now seen corresponding path program 1 times [2018-11-14 18:25:41,085 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:25:41,085 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:25:41,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:25:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:25:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:25:41,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:25:41,282 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:25:41,287 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:25:41,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:25:41,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:25:41,337 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:25:41,361 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:25:41,393 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:25:41,403 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:25:41,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:25:41,416 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-11-14 18:25:41,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 18:25:41,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 18:25:41,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:25:41,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:25:41,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 18:25:41,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 18:25:41,734 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:25:41,736 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:25:41,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:25:41,741 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-11-14 18:25:41,747 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:25:41,921 INFO L256 TraceCheckUtils]: 0: Hoare triple {2407#true} call ULTIMATE.init(); {2407#true} is VALID [2018-11-14 18:25:41,922 INFO L273 TraceCheckUtils]: 1: Hoare triple {2407#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2407#true} is VALID [2018-11-14 18:25:41,922 INFO L273 TraceCheckUtils]: 2: Hoare triple {2407#true} assume true; {2407#true} is VALID [2018-11-14 18:25:41,923 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2407#true} {2407#true} #218#return; {2407#true} is VALID [2018-11-14 18:25:41,923 INFO L256 TraceCheckUtils]: 4: Hoare triple {2407#true} call #t~ret25 := main(); {2407#true} is VALID [2018-11-14 18:25:41,929 INFO L273 TraceCheckUtils]: 5: Hoare triple {2407#true} ~min~0 := 3bv32;~max~0 := 5bv32;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);~i~0 := ~min~0; {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} is VALID [2018-11-14 18:25:41,930 INFO L273 TraceCheckUtils]: 6: Hoare triple {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} assume true; {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} is VALID [2018-11-14 18:25:41,930 INFO L273 TraceCheckUtils]: 7: Hoare triple {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} is VALID [2018-11-14 18:25:41,931 INFO L273 TraceCheckUtils]: 8: Hoare triple {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} assume true; {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} is VALID [2018-11-14 18:25:41,931 INFO L273 TraceCheckUtils]: 9: Hoare triple {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} is VALID [2018-11-14 18:25:41,932 INFO L273 TraceCheckUtils]: 10: Hoare triple {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} is VALID [2018-11-14 18:25:41,933 INFO L273 TraceCheckUtils]: 11: Hoare triple {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} assume true; {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} is VALID [2018-11-14 18:25:41,933 INFO L273 TraceCheckUtils]: 12: Hoare triple {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} is VALID [2018-11-14 18:25:41,938 INFO L273 TraceCheckUtils]: 13: Hoare triple {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} assume true; {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} is VALID [2018-11-14 18:25:41,939 INFO L273 TraceCheckUtils]: 14: Hoare triple {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} is VALID [2018-11-14 18:25:41,940 INFO L273 TraceCheckUtils]: 15: Hoare triple {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} is VALID [2018-11-14 18:25:41,940 INFO L273 TraceCheckUtils]: 16: Hoare triple {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} assume true; {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} is VALID [2018-11-14 18:25:41,941 INFO L273 TraceCheckUtils]: 17: Hoare triple {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} is VALID [2018-11-14 18:25:41,942 INFO L273 TraceCheckUtils]: 18: Hoare triple {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} assume true; {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} is VALID [2018-11-14 18:25:41,943 INFO L273 TraceCheckUtils]: 19: Hoare triple {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} is VALID [2018-11-14 18:25:41,943 INFO L273 TraceCheckUtils]: 20: Hoare triple {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} is VALID [2018-11-14 18:25:41,944 INFO L273 TraceCheckUtils]: 21: Hoare triple {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} assume true; {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} is VALID [2018-11-14 18:25:41,945 INFO L273 TraceCheckUtils]: 22: Hoare triple {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} assume !~bvsle32(~i~0, ~max~0); {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} is VALID [2018-11-14 18:25:41,946 INFO L273 TraceCheckUtils]: 23: Hoare triple {2427#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|) (_ bv0 32)))} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~i~0 := ~min~0; {2482#(and (= main_~ptr~0.offset (_ bv0 32)) (= (_ bv0 32) main_~ptr~0.base))} is VALID [2018-11-14 18:25:41,947 INFO L273 TraceCheckUtils]: 24: Hoare triple {2482#(and (= main_~ptr~0.offset (_ bv0 32)) (= (_ bv0 32) main_~ptr~0.base))} assume true; {2482#(and (= main_~ptr~0.offset (_ bv0 32)) (= (_ bv0 32) main_~ptr~0.base))} is VALID [2018-11-14 18:25:41,947 INFO L273 TraceCheckUtils]: 25: Hoare triple {2482#(and (= main_~ptr~0.offset (_ bv0 32)) (= (_ bv0 32) main_~ptr~0.base))} assume !!(0bv32 != ~ptr~0.base || 0bv32 != ~ptr~0.offset); {2408#false} is VALID [2018-11-14 18:25:41,948 INFO L273 TraceCheckUtils]: 26: Hoare triple {2408#false} assume !~bvsgt32(~i~0, ~max~0); {2408#false} is VALID [2018-11-14 18:25:41,948 INFO L273 TraceCheckUtils]: 27: Hoare triple {2408#false} assume true; {2408#false} is VALID [2018-11-14 18:25:41,948 INFO L273 TraceCheckUtils]: 28: Hoare triple {2408#false} assume !!(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32);call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {2408#false} is VALID [2018-11-14 18:25:41,948 INFO L256 TraceCheckUtils]: 29: Hoare triple {2408#false} call #t~ret21 := sll_length(#t~mem20.base, #t~mem20.offset); {2408#false} is VALID [2018-11-14 18:25:41,949 INFO L273 TraceCheckUtils]: 30: Hoare triple {2408#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {2408#false} is VALID [2018-11-14 18:25:41,949 INFO L273 TraceCheckUtils]: 31: Hoare triple {2408#false} assume true; {2408#false} is VALID [2018-11-14 18:25:41,949 INFO L273 TraceCheckUtils]: 32: Hoare triple {2408#false} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {2408#false} is VALID [2018-11-14 18:25:41,950 INFO L273 TraceCheckUtils]: 33: Hoare triple {2408#false} #res := ~len~0; {2408#false} is VALID [2018-11-14 18:25:41,950 INFO L273 TraceCheckUtils]: 34: Hoare triple {2408#false} assume true; {2408#false} is VALID [2018-11-14 18:25:41,950 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {2408#false} {2408#false} #212#return; {2408#false} is VALID [2018-11-14 18:25:41,951 INFO L273 TraceCheckUtils]: 36: Hoare triple {2408#false} ~count~0 := #t~ret21;havoc #t~ret21;havoc #t~mem20.base, #t~mem20.offset; {2408#false} is VALID [2018-11-14 18:25:41,951 INFO L273 TraceCheckUtils]: 37: Hoare triple {2408#false} assume !(~i~0 == ~count~0); {2408#false} is VALID [2018-11-14 18:25:41,951 INFO L273 TraceCheckUtils]: 38: Hoare triple {2408#false} assume !(3bv32 == ~i~0 && 5bv32 == ~count~0); {2408#false} is VALID [2018-11-14 18:25:41,951 INFO L273 TraceCheckUtils]: 39: Hoare triple {2408#false} assume !(~bvadd32(1bv32, ~i~0) == ~count~0 && ~bvslt32(~i~0, ~max~0)); {2408#false} is VALID [2018-11-14 18:25:41,951 INFO L273 TraceCheckUtils]: 40: Hoare triple {2408#false} assume !false; {2408#false} is VALID [2018-11-14 18:25:41,955 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-14 18:25:41,955 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:25:41,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:25:41,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 18:25:41,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-11-14 18:25:41,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:25:41,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:25:41,994 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:25:41,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:25:41,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:25:41,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:25:41,995 INFO L87 Difference]: Start difference. First operand 79 states and 93 transitions. Second operand 4 states. [2018-11-14 18:25:42,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:42,742 INFO L93 Difference]: Finished difference Result 128 states and 154 transitions. [2018-11-14 18:25:42,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:25:42,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-11-14 18:25:42,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:25:42,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:25:42,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2018-11-14 18:25:42,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:25:42,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2018-11-14 18:25:42,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 106 transitions. [2018-11-14 18:25:42,931 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:25:42,934 INFO L225 Difference]: With dead ends: 128 [2018-11-14 18:25:42,934 INFO L226 Difference]: Without dead ends: 97 [2018-11-14 18:25:42,935 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:25:42,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-14 18:25:43,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2018-11-14 18:25:43,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:25:43,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 89 states. [2018-11-14 18:25:43,033 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 89 states. [2018-11-14 18:25:43,033 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 89 states. [2018-11-14 18:25:43,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:43,039 INFO L93 Difference]: Finished difference Result 97 states and 116 transitions. [2018-11-14 18:25:43,039 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 116 transitions. [2018-11-14 18:25:43,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:25:43,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:25:43,040 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 97 states. [2018-11-14 18:25:43,040 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 97 states. [2018-11-14 18:25:43,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:43,045 INFO L93 Difference]: Finished difference Result 97 states and 116 transitions. [2018-11-14 18:25:43,046 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 116 transitions. [2018-11-14 18:25:43,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:25:43,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:25:43,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:25:43,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:25:43,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-14 18:25:43,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 105 transitions. [2018-11-14 18:25:43,051 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 105 transitions. Word has length 41 [2018-11-14 18:25:43,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:25:43,052 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 105 transitions. [2018-11-14 18:25:43,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:25:43,052 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2018-11-14 18:25:43,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-14 18:25:43,053 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:25:43,054 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:25:43,054 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:25:43,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:25:43,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1650484867, now seen corresponding path program 1 times [2018-11-14 18:25:43,055 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:25:43,055 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 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 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:25:43,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:25:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:25:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:25:43,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:25:43,394 INFO L256 TraceCheckUtils]: 0: Hoare triple {3027#true} call ULTIMATE.init(); {3027#true} is VALID [2018-11-14 18:25:43,395 INFO L273 TraceCheckUtils]: 1: Hoare triple {3027#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3027#true} is VALID [2018-11-14 18:25:43,395 INFO L273 TraceCheckUtils]: 2: Hoare triple {3027#true} assume true; {3027#true} is VALID [2018-11-14 18:25:43,395 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3027#true} {3027#true} #218#return; {3027#true} is VALID [2018-11-14 18:25:43,396 INFO L256 TraceCheckUtils]: 4: Hoare triple {3027#true} call #t~ret25 := main(); {3027#true} is VALID [2018-11-14 18:25:43,397 INFO L273 TraceCheckUtils]: 5: Hoare triple {3027#true} ~min~0 := 3bv32;~max~0 := 5bv32;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);~i~0 := ~min~0; {3047#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:43,397 INFO L273 TraceCheckUtils]: 6: Hoare triple {3047#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {3047#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:43,398 INFO L273 TraceCheckUtils]: 7: Hoare triple {3047#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {3047#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:43,398 INFO L273 TraceCheckUtils]: 8: Hoare triple {3047#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {3047#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:43,399 INFO L273 TraceCheckUtils]: 9: Hoare triple {3047#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {3047#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:43,400 INFO L273 TraceCheckUtils]: 10: Hoare triple {3047#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {3063#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 18:25:43,400 INFO L273 TraceCheckUtils]: 11: Hoare triple {3063#(= (_ bv4 32) main_~i~0)} assume true; {3063#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 18:25:43,401 INFO L273 TraceCheckUtils]: 12: Hoare triple {3063#(= (_ bv4 32) main_~i~0)} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {3063#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 18:25:43,402 INFO L273 TraceCheckUtils]: 13: Hoare triple {3063#(= (_ bv4 32) main_~i~0)} assume true; {3063#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 18:25:43,402 INFO L273 TraceCheckUtils]: 14: Hoare triple {3063#(= (_ bv4 32) main_~i~0)} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {3063#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 18:25:43,404 INFO L273 TraceCheckUtils]: 15: Hoare triple {3063#(= (_ bv4 32) main_~i~0)} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {3079#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:43,405 INFO L273 TraceCheckUtils]: 16: Hoare triple {3079#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {3079#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:43,405 INFO L273 TraceCheckUtils]: 17: Hoare triple {3079#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {3079#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:43,406 INFO L273 TraceCheckUtils]: 18: Hoare triple {3079#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {3079#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:43,406 INFO L273 TraceCheckUtils]: 19: Hoare triple {3079#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {3079#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:43,407 INFO L256 TraceCheckUtils]: 20: Hoare triple {3079#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} call sll_append(~#head~1.base, ~#head~1.offset, ~i~0); {3027#true} is VALID [2018-11-14 18:25:43,408 INFO L273 TraceCheckUtils]: 21: Hoare triple {3027#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {3098#(= |sll_append_#in~sublist_length| sll_append_~sublist_length)} is VALID [2018-11-14 18:25:43,408 INFO L256 TraceCheckUtils]: 22: Hoare triple {3098#(= |sll_append_#in~sublist_length| sll_append_~sublist_length)} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {3027#true} is VALID [2018-11-14 18:25:43,410 INFO L273 TraceCheckUtils]: 23: Hoare triple {3027#true} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {3105#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} is VALID [2018-11-14 18:25:43,410 INFO L273 TraceCheckUtils]: 24: Hoare triple {3105#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} assume !(0bv32 == ~new_node~0.base && 0bv32 == ~new_node~0.offset); {3105#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} is VALID [2018-11-14 18:25:43,411 INFO L256 TraceCheckUtils]: 25: Hoare triple {3105#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {3027#true} is VALID [2018-11-14 18:25:43,416 INFO L273 TraceCheckUtils]: 26: Hoare triple {3027#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {3115#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 18:25:43,416 INFO L273 TraceCheckUtils]: 27: Hoare triple {3115#(= |sll_create_#in~len| sll_create_~len)} assume true; {3115#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 18:25:43,420 INFO L273 TraceCheckUtils]: 28: Hoare triple {3115#(= |sll_create_#in~len| sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {3122#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 18:25:43,420 INFO L273 TraceCheckUtils]: 29: Hoare triple {3122#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {3122#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 18:25:43,421 INFO L273 TraceCheckUtils]: 30: Hoare triple {3122#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} assume true; {3122#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 18:25:43,422 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {3122#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} {3105#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} #208#return; {3132#(not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 18:25:43,422 INFO L273 TraceCheckUtils]: 32: Hoare triple {3132#(not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32)))} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0bv32, 0bv32, ~new_node~0.base, ~new_node~0.offset, 4bv32);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {3132#(not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 18:25:43,422 INFO L273 TraceCheckUtils]: 33: Hoare triple {3132#(not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32)))} assume true; {3132#(not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 18:25:43,424 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3132#(not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32)))} {3098#(= |sll_append_#in~sublist_length| sll_append_~sublist_length)} #216#return; {3142#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 18:25:43,424 INFO L273 TraceCheckUtils]: 35: Hoare triple {3142#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0bv32, 0bv32, ~new_last~0.base, ~new_last~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {3142#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 18:25:43,425 INFO L273 TraceCheckUtils]: 36: Hoare triple {3142#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} assume !(0bv32 != ~temp~0.base || 0bv32 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {3142#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 18:25:43,425 INFO L273 TraceCheckUtils]: 37: Hoare triple {3142#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} assume true; {3142#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 18:25:43,431 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {3142#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} {3079#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} #210#return; {3028#false} is VALID [2018-11-14 18:25:43,432 INFO L273 TraceCheckUtils]: 39: Hoare triple {3028#false} #t~post16 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {3028#false} is VALID [2018-11-14 18:25:43,432 INFO L273 TraceCheckUtils]: 40: Hoare triple {3028#false} assume true; {3028#false} is VALID [2018-11-14 18:25:43,432 INFO L273 TraceCheckUtils]: 41: Hoare triple {3028#false} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {3028#false} is VALID [2018-11-14 18:25:43,433 INFO L273 TraceCheckUtils]: 42: Hoare triple {3028#false} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {3028#false} is VALID [2018-11-14 18:25:43,433 INFO L273 TraceCheckUtils]: 43: Hoare triple {3028#false} assume true; {3028#false} is VALID [2018-11-14 18:25:43,433 INFO L273 TraceCheckUtils]: 44: Hoare triple {3028#false} assume !~bvsle32(~i~0, ~max~0); {3028#false} is VALID [2018-11-14 18:25:43,433 INFO L273 TraceCheckUtils]: 45: Hoare triple {3028#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~i~0 := ~min~0; {3028#false} is VALID [2018-11-14 18:25:43,434 INFO L273 TraceCheckUtils]: 46: Hoare triple {3028#false} assume true; {3028#false} is VALID [2018-11-14 18:25:43,434 INFO L273 TraceCheckUtils]: 47: Hoare triple {3028#false} assume !!(0bv32 != ~ptr~0.base || 0bv32 != ~ptr~0.offset); {3028#false} is VALID [2018-11-14 18:25:43,434 INFO L273 TraceCheckUtils]: 48: Hoare triple {3028#false} assume !~bvsgt32(~i~0, ~max~0); {3028#false} is VALID [2018-11-14 18:25:43,434 INFO L273 TraceCheckUtils]: 49: Hoare triple {3028#false} assume true; {3028#false} is VALID [2018-11-14 18:25:43,434 INFO L273 TraceCheckUtils]: 50: Hoare triple {3028#false} assume !!(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32);call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {3028#false} is VALID [2018-11-14 18:25:43,435 INFO L256 TraceCheckUtils]: 51: Hoare triple {3028#false} call #t~ret21 := sll_length(#t~mem20.base, #t~mem20.offset); {3028#false} is VALID [2018-11-14 18:25:43,435 INFO L273 TraceCheckUtils]: 52: Hoare triple {3028#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {3028#false} is VALID [2018-11-14 18:25:43,435 INFO L273 TraceCheckUtils]: 53: Hoare triple {3028#false} assume true; {3028#false} is VALID [2018-11-14 18:25:43,435 INFO L273 TraceCheckUtils]: 54: Hoare triple {3028#false} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {3028#false} is VALID [2018-11-14 18:25:43,435 INFO L273 TraceCheckUtils]: 55: Hoare triple {3028#false} #res := ~len~0; {3028#false} is VALID [2018-11-14 18:25:43,436 INFO L273 TraceCheckUtils]: 56: Hoare triple {3028#false} assume true; {3028#false} is VALID [2018-11-14 18:25:43,436 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {3028#false} {3028#false} #212#return; {3028#false} is VALID [2018-11-14 18:25:43,436 INFO L273 TraceCheckUtils]: 58: Hoare triple {3028#false} ~count~0 := #t~ret21;havoc #t~ret21;havoc #t~mem20.base, #t~mem20.offset; {3028#false} is VALID [2018-11-14 18:25:43,436 INFO L273 TraceCheckUtils]: 59: Hoare triple {3028#false} assume !(~i~0 == ~count~0); {3028#false} is VALID [2018-11-14 18:25:43,436 INFO L273 TraceCheckUtils]: 60: Hoare triple {3028#false} assume !(3bv32 == ~i~0 && 5bv32 == ~count~0); {3028#false} is VALID [2018-11-14 18:25:43,437 INFO L273 TraceCheckUtils]: 61: Hoare triple {3028#false} assume !(~bvadd32(1bv32, ~i~0) == ~count~0 && ~bvslt32(~i~0, ~max~0)); {3028#false} is VALID [2018-11-14 18:25:43,437 INFO L273 TraceCheckUtils]: 62: Hoare triple {3028#false} assume !false; {3028#false} is VALID [2018-11-14 18:25:43,441 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:25:43,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:25:44,214 INFO L273 TraceCheckUtils]: 62: Hoare triple {3028#false} assume !false; {3028#false} is VALID [2018-11-14 18:25:44,215 INFO L273 TraceCheckUtils]: 61: Hoare triple {3028#false} assume !(~bvadd32(1bv32, ~i~0) == ~count~0 && ~bvslt32(~i~0, ~max~0)); {3028#false} is VALID [2018-11-14 18:25:44,215 INFO L273 TraceCheckUtils]: 60: Hoare triple {3028#false} assume !(3bv32 == ~i~0 && 5bv32 == ~count~0); {3028#false} is VALID [2018-11-14 18:25:44,215 INFO L273 TraceCheckUtils]: 59: Hoare triple {3028#false} assume !(~i~0 == ~count~0); {3028#false} is VALID [2018-11-14 18:25:44,215 INFO L273 TraceCheckUtils]: 58: Hoare triple {3028#false} ~count~0 := #t~ret21;havoc #t~ret21;havoc #t~mem20.base, #t~mem20.offset; {3028#false} is VALID [2018-11-14 18:25:44,215 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {3027#true} {3028#false} #212#return; {3028#false} is VALID [2018-11-14 18:25:44,216 INFO L273 TraceCheckUtils]: 56: Hoare triple {3027#true} assume true; {3027#true} is VALID [2018-11-14 18:25:44,216 INFO L273 TraceCheckUtils]: 55: Hoare triple {3027#true} #res := ~len~0; {3027#true} is VALID [2018-11-14 18:25:44,216 INFO L273 TraceCheckUtils]: 54: Hoare triple {3027#true} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {3027#true} is VALID [2018-11-14 18:25:44,216 INFO L273 TraceCheckUtils]: 53: Hoare triple {3027#true} assume true; {3027#true} is VALID [2018-11-14 18:25:44,216 INFO L273 TraceCheckUtils]: 52: Hoare triple {3027#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {3027#true} is VALID [2018-11-14 18:25:44,216 INFO L256 TraceCheckUtils]: 51: Hoare triple {3028#false} call #t~ret21 := sll_length(#t~mem20.base, #t~mem20.offset); {3027#true} is VALID [2018-11-14 18:25:44,217 INFO L273 TraceCheckUtils]: 50: Hoare triple {3028#false} assume !!(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32);call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {3028#false} is VALID [2018-11-14 18:25:44,217 INFO L273 TraceCheckUtils]: 49: Hoare triple {3028#false} assume true; {3028#false} is VALID [2018-11-14 18:25:44,217 INFO L273 TraceCheckUtils]: 48: Hoare triple {3028#false} assume !~bvsgt32(~i~0, ~max~0); {3028#false} is VALID [2018-11-14 18:25:44,217 INFO L273 TraceCheckUtils]: 47: Hoare triple {3028#false} assume !!(0bv32 != ~ptr~0.base || 0bv32 != ~ptr~0.offset); {3028#false} is VALID [2018-11-14 18:25:44,218 INFO L273 TraceCheckUtils]: 46: Hoare triple {3028#false} assume true; {3028#false} is VALID [2018-11-14 18:25:44,218 INFO L273 TraceCheckUtils]: 45: Hoare triple {3028#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~i~0 := ~min~0; {3028#false} is VALID [2018-11-14 18:25:44,218 INFO L273 TraceCheckUtils]: 44: Hoare triple {3028#false} assume !~bvsle32(~i~0, ~max~0); {3028#false} is VALID [2018-11-14 18:25:44,218 INFO L273 TraceCheckUtils]: 43: Hoare triple {3028#false} assume true; {3028#false} is VALID [2018-11-14 18:25:44,218 INFO L273 TraceCheckUtils]: 42: Hoare triple {3028#false} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {3028#false} is VALID [2018-11-14 18:25:44,218 INFO L273 TraceCheckUtils]: 41: Hoare triple {3028#false} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {3028#false} is VALID [2018-11-14 18:25:44,219 INFO L273 TraceCheckUtils]: 40: Hoare triple {3028#false} assume true; {3028#false} is VALID [2018-11-14 18:25:44,219 INFO L273 TraceCheckUtils]: 39: Hoare triple {3028#false} #t~post16 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {3028#false} is VALID [2018-11-14 18:25:44,220 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {3142#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} {3299#(bvsgt main_~i~0 (_ bv0 32))} #210#return; {3028#false} is VALID [2018-11-14 18:25:44,221 INFO L273 TraceCheckUtils]: 37: Hoare triple {3142#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} assume true; {3142#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 18:25:44,222 INFO L273 TraceCheckUtils]: 36: Hoare triple {3142#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} assume !(0bv32 != ~temp~0.base || 0bv32 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {3142#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 18:25:44,224 INFO L273 TraceCheckUtils]: 35: Hoare triple {3142#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0bv32, 0bv32, ~new_last~0.base, ~new_last~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {3142#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 18:25:44,227 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3132#(not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32)))} {3315#(or (bvsgt sll_append_~sublist_length (_ bv0 32)) (not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32))))} #216#return; {3142#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 18:25:44,229 INFO L273 TraceCheckUtils]: 33: Hoare triple {3132#(not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32)))} assume true; {3132#(not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 18:25:44,229 INFO L273 TraceCheckUtils]: 32: Hoare triple {3132#(not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32)))} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0bv32, 0bv32, ~new_node~0.base, ~new_node~0.offset, 4bv32);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {3132#(not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 18:25:44,231 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {3122#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} {3328#(or (not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32))) (bvsgt node_create_with_sublist_~sublist_length (_ bv0 32)))} #208#return; {3132#(not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 18:25:44,233 INFO L273 TraceCheckUtils]: 30: Hoare triple {3122#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} assume true; {3122#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 18:25:44,233 INFO L273 TraceCheckUtils]: 29: Hoare triple {3122#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {3122#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 18:25:44,233 INFO L273 TraceCheckUtils]: 28: Hoare triple {3341#(or (not (bvsgt |sll_create_#in~len| (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume !~bvsgt32(~len, 0bv32); {3122#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 18:25:44,234 INFO L273 TraceCheckUtils]: 27: Hoare triple {3341#(or (not (bvsgt |sll_create_#in~len| (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume true; {3341#(or (not (bvsgt |sll_create_#in~len| (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-14 18:25:44,235 INFO L273 TraceCheckUtils]: 26: Hoare triple {3027#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {3341#(or (not (bvsgt |sll_create_#in~len| (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-14 18:25:44,235 INFO L256 TraceCheckUtils]: 25: Hoare triple {3328#(or (not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32))) (bvsgt node_create_with_sublist_~sublist_length (_ bv0 32)))} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {3027#true} is VALID [2018-11-14 18:25:44,235 INFO L273 TraceCheckUtils]: 24: Hoare triple {3328#(or (not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32))) (bvsgt node_create_with_sublist_~sublist_length (_ bv0 32)))} assume !(0bv32 == ~new_node~0.base && 0bv32 == ~new_node~0.offset); {3328#(or (not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32))) (bvsgt node_create_with_sublist_~sublist_length (_ bv0 32)))} is VALID [2018-11-14 18:25:44,249 INFO L273 TraceCheckUtils]: 23: Hoare triple {3027#true} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {3328#(or (not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32))) (bvsgt node_create_with_sublist_~sublist_length (_ bv0 32)))} is VALID [2018-11-14 18:25:44,249 INFO L256 TraceCheckUtils]: 22: Hoare triple {3315#(or (bvsgt sll_append_~sublist_length (_ bv0 32)) (not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32))))} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {3027#true} is VALID [2018-11-14 18:25:44,250 INFO L273 TraceCheckUtils]: 21: Hoare triple {3027#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {3315#(or (bvsgt sll_append_~sublist_length (_ bv0 32)) (not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32))))} is VALID [2018-11-14 18:25:44,250 INFO L256 TraceCheckUtils]: 20: Hoare triple {3299#(bvsgt main_~i~0 (_ bv0 32))} call sll_append(~#head~1.base, ~#head~1.offset, ~i~0); {3027#true} is VALID [2018-11-14 18:25:44,251 INFO L273 TraceCheckUtils]: 19: Hoare triple {3299#(bvsgt main_~i~0 (_ bv0 32))} assume !!(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {3299#(bvsgt main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:25:44,251 INFO L273 TraceCheckUtils]: 18: Hoare triple {3299#(bvsgt main_~i~0 (_ bv0 32))} assume true; {3299#(bvsgt main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:25:44,251 INFO L273 TraceCheckUtils]: 17: Hoare triple {3299#(bvsgt main_~i~0 (_ bv0 32))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {3299#(bvsgt main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:25:44,252 INFO L273 TraceCheckUtils]: 16: Hoare triple {3299#(bvsgt main_~i~0 (_ bv0 32))} assume true; {3299#(bvsgt main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:25:44,253 INFO L273 TraceCheckUtils]: 15: Hoare triple {3372#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {3299#(bvsgt main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:25:44,254 INFO L273 TraceCheckUtils]: 14: Hoare triple {3372#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {3372#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:44,254 INFO L273 TraceCheckUtils]: 13: Hoare triple {3372#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} assume true; {3372#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:44,255 INFO L273 TraceCheckUtils]: 12: Hoare triple {3372#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {3372#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:44,256 INFO L273 TraceCheckUtils]: 11: Hoare triple {3372#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} assume true; {3372#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:44,258 INFO L273 TraceCheckUtils]: 10: Hoare triple {3388#(bvsgt (bvadd main_~i~0 (_ bv2 32)) (_ bv0 32))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {3372#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:44,259 INFO L273 TraceCheckUtils]: 9: Hoare triple {3388#(bvsgt (bvadd main_~i~0 (_ bv2 32)) (_ bv0 32))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {3388#(bvsgt (bvadd main_~i~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:44,259 INFO L273 TraceCheckUtils]: 8: Hoare triple {3388#(bvsgt (bvadd main_~i~0 (_ bv2 32)) (_ bv0 32))} assume true; {3388#(bvsgt (bvadd main_~i~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:44,260 INFO L273 TraceCheckUtils]: 7: Hoare triple {3388#(bvsgt (bvadd main_~i~0 (_ bv2 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {3388#(bvsgt (bvadd main_~i~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:44,260 INFO L273 TraceCheckUtils]: 6: Hoare triple {3388#(bvsgt (bvadd main_~i~0 (_ bv2 32)) (_ bv0 32))} assume true; {3388#(bvsgt (bvadd main_~i~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:44,261 INFO L273 TraceCheckUtils]: 5: Hoare triple {3027#true} ~min~0 := 3bv32;~max~0 := 5bv32;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);~i~0 := ~min~0; {3388#(bvsgt (bvadd main_~i~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:44,261 INFO L256 TraceCheckUtils]: 4: Hoare triple {3027#true} call #t~ret25 := main(); {3027#true} is VALID [2018-11-14 18:25:44,261 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3027#true} {3027#true} #218#return; {3027#true} is VALID [2018-11-14 18:25:44,261 INFO L273 TraceCheckUtils]: 2: Hoare triple {3027#true} assume true; {3027#true} is VALID [2018-11-14 18:25:44,261 INFO L273 TraceCheckUtils]: 1: Hoare triple {3027#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3027#true} is VALID [2018-11-14 18:25:44,261 INFO L256 TraceCheckUtils]: 0: Hoare triple {3027#true} call ULTIMATE.init(); {3027#true} is VALID [2018-11-14 18:25:44,266 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:25:44,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:25:44,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2018-11-14 18:25:44,269 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 63 [2018-11-14 18:25:44,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:25:44,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 18:25:44,404 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:25:44,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 18:25:44,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 18:25:44,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-11-14 18:25:44,405 INFO L87 Difference]: Start difference. First operand 89 states and 105 transitions. Second operand 17 states. [2018-11-14 18:25:48,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:48,114 INFO L93 Difference]: Finished difference Result 274 states and 339 transitions. [2018-11-14 18:25:48,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-14 18:25:48,114 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 63 [2018-11-14 18:25:48,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:25:48,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 18:25:48,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 277 transitions. [2018-11-14 18:25:48,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 18:25:48,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 277 transitions. [2018-11-14 18:25:48,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 277 transitions. [2018-11-14 18:25:48,533 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:25:48,541 INFO L225 Difference]: With dead ends: 274 [2018-11-14 18:25:48,542 INFO L226 Difference]: Without dead ends: 205 [2018-11-14 18:25:48,543 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2018-11-14 18:25:48,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-11-14 18:25:48,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 156. [2018-11-14 18:25:48,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:25:48,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 205 states. Second operand 156 states. [2018-11-14 18:25:48,917 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand 156 states. [2018-11-14 18:25:48,918 INFO L87 Difference]: Start difference. First operand 205 states. Second operand 156 states. [2018-11-14 18:25:48,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:48,928 INFO L93 Difference]: Finished difference Result 205 states and 250 transitions. [2018-11-14 18:25:48,928 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 250 transitions. [2018-11-14 18:25:48,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:25:48,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:25:48,929 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 205 states. [2018-11-14 18:25:48,930 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 205 states. [2018-11-14 18:25:48,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:48,939 INFO L93 Difference]: Finished difference Result 205 states and 250 transitions. [2018-11-14 18:25:48,939 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 250 transitions. [2018-11-14 18:25:48,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:25:48,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:25:48,940 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:25:48,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:25:48,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-14 18:25:48,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 192 transitions. [2018-11-14 18:25:48,947 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 192 transitions. Word has length 63 [2018-11-14 18:25:48,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:25:48,948 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 192 transitions. [2018-11-14 18:25:48,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 18:25:48,948 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 192 transitions. [2018-11-14 18:25:48,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-14 18:25:48,950 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:25:48,950 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:25:48,950 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:25:48,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:25:48,951 INFO L82 PathProgramCache]: Analyzing trace with hash -2105553832, now seen corresponding path program 1 times [2018-11-14 18:25:48,951 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:25:48,951 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 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 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:25:48,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:25:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:25:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:25:49,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:25:49,275 INFO L256 TraceCheckUtils]: 0: Hoare triple {4419#true} call ULTIMATE.init(); {4419#true} is VALID [2018-11-14 18:25:49,275 INFO L273 TraceCheckUtils]: 1: Hoare triple {4419#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4419#true} is VALID [2018-11-14 18:25:49,276 INFO L273 TraceCheckUtils]: 2: Hoare triple {4419#true} assume true; {4419#true} is VALID [2018-11-14 18:25:49,276 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4419#true} {4419#true} #218#return; {4419#true} is VALID [2018-11-14 18:25:49,276 INFO L256 TraceCheckUtils]: 4: Hoare triple {4419#true} call #t~ret25 := main(); {4419#true} is VALID [2018-11-14 18:25:49,277 INFO L273 TraceCheckUtils]: 5: Hoare triple {4419#true} ~min~0 := 3bv32;~max~0 := 5bv32;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);~i~0 := ~min~0; {4439#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:49,278 INFO L273 TraceCheckUtils]: 6: Hoare triple {4439#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {4439#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:49,279 INFO L273 TraceCheckUtils]: 7: Hoare triple {4439#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {4439#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:49,279 INFO L273 TraceCheckUtils]: 8: Hoare triple {4439#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {4439#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:49,280 INFO L273 TraceCheckUtils]: 9: Hoare triple {4439#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {4439#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:49,281 INFO L273 TraceCheckUtils]: 10: Hoare triple {4439#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {4455#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv4 32) main_~i~0))} is VALID [2018-11-14 18:25:49,281 INFO L273 TraceCheckUtils]: 11: Hoare triple {4455#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv4 32) main_~i~0))} assume true; {4455#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv4 32) main_~i~0))} is VALID [2018-11-14 18:25:49,282 INFO L273 TraceCheckUtils]: 12: Hoare triple {4455#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv4 32) main_~i~0))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {4455#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv4 32) main_~i~0))} is VALID [2018-11-14 18:25:49,283 INFO L273 TraceCheckUtils]: 13: Hoare triple {4455#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv4 32) main_~i~0))} assume true; {4455#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv4 32) main_~i~0))} is VALID [2018-11-14 18:25:49,286 INFO L273 TraceCheckUtils]: 14: Hoare triple {4455#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv4 32) main_~i~0))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {4455#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv4 32) main_~i~0))} is VALID [2018-11-14 18:25:49,286 INFO L273 TraceCheckUtils]: 15: Hoare triple {4455#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv4 32) main_~i~0))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {4471#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:49,287 INFO L273 TraceCheckUtils]: 16: Hoare triple {4471#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} assume true; {4471#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:49,288 INFO L273 TraceCheckUtils]: 17: Hoare triple {4471#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {4471#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:49,289 INFO L273 TraceCheckUtils]: 18: Hoare triple {4471#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} assume true; {4471#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:49,290 INFO L273 TraceCheckUtils]: 19: Hoare triple {4471#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {4471#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:49,290 INFO L273 TraceCheckUtils]: 20: Hoare triple {4471#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {4487#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv6 32) main_~i~0))} is VALID [2018-11-14 18:25:49,299 INFO L273 TraceCheckUtils]: 21: Hoare triple {4487#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv6 32) main_~i~0))} assume true; {4487#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv6 32) main_~i~0))} is VALID [2018-11-14 18:25:49,300 INFO L273 TraceCheckUtils]: 22: Hoare triple {4487#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv6 32) main_~i~0))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {4420#false} is VALID [2018-11-14 18:25:49,300 INFO L273 TraceCheckUtils]: 23: Hoare triple {4420#false} assume true; {4420#false} is VALID [2018-11-14 18:25:49,300 INFO L273 TraceCheckUtils]: 24: Hoare triple {4420#false} assume !!(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {4420#false} is VALID [2018-11-14 18:25:49,300 INFO L256 TraceCheckUtils]: 25: Hoare triple {4420#false} call sll_append(~#head~1.base, ~#head~1.offset, ~i~0); {4420#false} is VALID [2018-11-14 18:25:49,300 INFO L273 TraceCheckUtils]: 26: Hoare triple {4420#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {4420#false} is VALID [2018-11-14 18:25:49,301 INFO L256 TraceCheckUtils]: 27: Hoare triple {4420#false} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {4420#false} is VALID [2018-11-14 18:25:49,301 INFO L273 TraceCheckUtils]: 28: Hoare triple {4420#false} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {4420#false} is VALID [2018-11-14 18:25:49,301 INFO L273 TraceCheckUtils]: 29: Hoare triple {4420#false} assume !(0bv32 == ~new_node~0.base && 0bv32 == ~new_node~0.offset); {4420#false} is VALID [2018-11-14 18:25:49,301 INFO L256 TraceCheckUtils]: 30: Hoare triple {4420#false} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {4420#false} is VALID [2018-11-14 18:25:49,301 INFO L273 TraceCheckUtils]: 31: Hoare triple {4420#false} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {4420#false} is VALID [2018-11-14 18:25:49,301 INFO L273 TraceCheckUtils]: 32: Hoare triple {4420#false} assume true; {4420#false} is VALID [2018-11-14 18:25:49,302 INFO L273 TraceCheckUtils]: 33: Hoare triple {4420#false} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {4420#false} is VALID [2018-11-14 18:25:49,302 INFO L273 TraceCheckUtils]: 34: Hoare triple {4420#false} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {4420#false} is VALID [2018-11-14 18:25:49,302 INFO L273 TraceCheckUtils]: 35: Hoare triple {4420#false} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {4420#false} is VALID [2018-11-14 18:25:49,302 INFO L273 TraceCheckUtils]: 36: Hoare triple {4420#false} assume true; {4420#false} is VALID [2018-11-14 18:25:49,302 INFO L273 TraceCheckUtils]: 37: Hoare triple {4420#false} assume !~bvsgt32(~len, 0bv32); {4420#false} is VALID [2018-11-14 18:25:49,303 INFO L273 TraceCheckUtils]: 38: Hoare triple {4420#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {4420#false} is VALID [2018-11-14 18:25:49,303 INFO L273 TraceCheckUtils]: 39: Hoare triple {4420#false} assume true; {4420#false} is VALID [2018-11-14 18:25:49,303 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {4420#false} {4420#false} #208#return; {4420#false} is VALID [2018-11-14 18:25:49,303 INFO L273 TraceCheckUtils]: 41: Hoare triple {4420#false} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0bv32, 0bv32, ~new_node~0.base, ~new_node~0.offset, 4bv32);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {4420#false} is VALID [2018-11-14 18:25:49,303 INFO L273 TraceCheckUtils]: 42: Hoare triple {4420#false} assume true; {4420#false} is VALID [2018-11-14 18:25:49,303 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {4420#false} {4420#false} #216#return; {4420#false} is VALID [2018-11-14 18:25:49,304 INFO L273 TraceCheckUtils]: 44: Hoare triple {4420#false} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0bv32, 0bv32, ~new_last~0.base, ~new_last~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {4420#false} is VALID [2018-11-14 18:25:49,304 INFO L273 TraceCheckUtils]: 45: Hoare triple {4420#false} assume !(0bv32 != ~temp~0.base || 0bv32 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {4420#false} is VALID [2018-11-14 18:25:49,304 INFO L273 TraceCheckUtils]: 46: Hoare triple {4420#false} assume true; {4420#false} is VALID [2018-11-14 18:25:49,304 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {4420#false} {4420#false} #210#return; {4420#false} is VALID [2018-11-14 18:25:49,304 INFO L273 TraceCheckUtils]: 48: Hoare triple {4420#false} #t~post16 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {4420#false} is VALID [2018-11-14 18:25:49,305 INFO L273 TraceCheckUtils]: 49: Hoare triple {4420#false} assume true; {4420#false} is VALID [2018-11-14 18:25:49,305 INFO L273 TraceCheckUtils]: 50: Hoare triple {4420#false} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {4420#false} is VALID [2018-11-14 18:25:49,305 INFO L273 TraceCheckUtils]: 51: Hoare triple {4420#false} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {4420#false} is VALID [2018-11-14 18:25:49,305 INFO L273 TraceCheckUtils]: 52: Hoare triple {4420#false} assume true; {4420#false} is VALID [2018-11-14 18:25:49,305 INFO L273 TraceCheckUtils]: 53: Hoare triple {4420#false} assume !~bvsle32(~i~0, ~max~0); {4420#false} is VALID [2018-11-14 18:25:49,305 INFO L273 TraceCheckUtils]: 54: Hoare triple {4420#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~i~0 := ~min~0; {4420#false} is VALID [2018-11-14 18:25:49,306 INFO L273 TraceCheckUtils]: 55: Hoare triple {4420#false} assume true; {4420#false} is VALID [2018-11-14 18:25:49,306 INFO L273 TraceCheckUtils]: 56: Hoare triple {4420#false} assume !!(0bv32 != ~ptr~0.base || 0bv32 != ~ptr~0.offset); {4420#false} is VALID [2018-11-14 18:25:49,306 INFO L273 TraceCheckUtils]: 57: Hoare triple {4420#false} assume !~bvsgt32(~i~0, ~max~0); {4420#false} is VALID [2018-11-14 18:25:49,306 INFO L273 TraceCheckUtils]: 58: Hoare triple {4420#false} assume true; {4420#false} is VALID [2018-11-14 18:25:49,306 INFO L273 TraceCheckUtils]: 59: Hoare triple {4420#false} assume !!(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32);call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {4420#false} is VALID [2018-11-14 18:25:49,306 INFO L256 TraceCheckUtils]: 60: Hoare triple {4420#false} call #t~ret21 := sll_length(#t~mem20.base, #t~mem20.offset); {4420#false} is VALID [2018-11-14 18:25:49,307 INFO L273 TraceCheckUtils]: 61: Hoare triple {4420#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {4420#false} is VALID [2018-11-14 18:25:49,307 INFO L273 TraceCheckUtils]: 62: Hoare triple {4420#false} assume true; {4420#false} is VALID [2018-11-14 18:25:49,307 INFO L273 TraceCheckUtils]: 63: Hoare triple {4420#false} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {4420#false} is VALID [2018-11-14 18:25:49,307 INFO L273 TraceCheckUtils]: 64: Hoare triple {4420#false} #res := ~len~0; {4420#false} is VALID [2018-11-14 18:25:49,307 INFO L273 TraceCheckUtils]: 65: Hoare triple {4420#false} assume true; {4420#false} is VALID [2018-11-14 18:25:49,307 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {4420#false} {4420#false} #212#return; {4420#false} is VALID [2018-11-14 18:25:49,308 INFO L273 TraceCheckUtils]: 67: Hoare triple {4420#false} ~count~0 := #t~ret21;havoc #t~ret21;havoc #t~mem20.base, #t~mem20.offset; {4420#false} is VALID [2018-11-14 18:25:49,308 INFO L273 TraceCheckUtils]: 68: Hoare triple {4420#false} assume !(~i~0 == ~count~0); {4420#false} is VALID [2018-11-14 18:25:49,308 INFO L273 TraceCheckUtils]: 69: Hoare triple {4420#false} assume !(3bv32 == ~i~0 && 5bv32 == ~count~0); {4420#false} is VALID [2018-11-14 18:25:49,308 INFO L273 TraceCheckUtils]: 70: Hoare triple {4420#false} assume !(~bvadd32(1bv32, ~i~0) == ~count~0 && ~bvslt32(~i~0, ~max~0)); {4420#false} is VALID [2018-11-14 18:25:49,308 INFO L273 TraceCheckUtils]: 71: Hoare triple {4420#false} assume !false; {4420#false} is VALID [2018-11-14 18:25:49,317 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 23 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 18:25:49,317 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:25:49,597 INFO L273 TraceCheckUtils]: 71: Hoare triple {4420#false} assume !false; {4420#false} is VALID [2018-11-14 18:25:49,598 INFO L273 TraceCheckUtils]: 70: Hoare triple {4420#false} assume !(~bvadd32(1bv32, ~i~0) == ~count~0 && ~bvslt32(~i~0, ~max~0)); {4420#false} is VALID [2018-11-14 18:25:49,598 INFO L273 TraceCheckUtils]: 69: Hoare triple {4420#false} assume !(3bv32 == ~i~0 && 5bv32 == ~count~0); {4420#false} is VALID [2018-11-14 18:25:49,598 INFO L273 TraceCheckUtils]: 68: Hoare triple {4420#false} assume !(~i~0 == ~count~0); {4420#false} is VALID [2018-11-14 18:25:49,598 INFO L273 TraceCheckUtils]: 67: Hoare triple {4420#false} ~count~0 := #t~ret21;havoc #t~ret21;havoc #t~mem20.base, #t~mem20.offset; {4420#false} is VALID [2018-11-14 18:25:49,598 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {4419#true} {4420#false} #212#return; {4420#false} is VALID [2018-11-14 18:25:49,599 INFO L273 TraceCheckUtils]: 65: Hoare triple {4419#true} assume true; {4419#true} is VALID [2018-11-14 18:25:49,599 INFO L273 TraceCheckUtils]: 64: Hoare triple {4419#true} #res := ~len~0; {4419#true} is VALID [2018-11-14 18:25:49,599 INFO L273 TraceCheckUtils]: 63: Hoare triple {4419#true} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {4419#true} is VALID [2018-11-14 18:25:49,599 INFO L273 TraceCheckUtils]: 62: Hoare triple {4419#true} assume true; {4419#true} is VALID [2018-11-14 18:25:49,599 INFO L273 TraceCheckUtils]: 61: Hoare triple {4419#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {4419#true} is VALID [2018-11-14 18:25:49,600 INFO L256 TraceCheckUtils]: 60: Hoare triple {4420#false} call #t~ret21 := sll_length(#t~mem20.base, #t~mem20.offset); {4419#true} is VALID [2018-11-14 18:25:49,600 INFO L273 TraceCheckUtils]: 59: Hoare triple {4420#false} assume !!(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32);call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {4420#false} is VALID [2018-11-14 18:25:49,600 INFO L273 TraceCheckUtils]: 58: Hoare triple {4420#false} assume true; {4420#false} is VALID [2018-11-14 18:25:49,600 INFO L273 TraceCheckUtils]: 57: Hoare triple {4420#false} assume !~bvsgt32(~i~0, ~max~0); {4420#false} is VALID [2018-11-14 18:25:49,600 INFO L273 TraceCheckUtils]: 56: Hoare triple {4420#false} assume !!(0bv32 != ~ptr~0.base || 0bv32 != ~ptr~0.offset); {4420#false} is VALID [2018-11-14 18:25:49,600 INFO L273 TraceCheckUtils]: 55: Hoare triple {4420#false} assume true; {4420#false} is VALID [2018-11-14 18:25:49,601 INFO L273 TraceCheckUtils]: 54: Hoare triple {4420#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~i~0 := ~min~0; {4420#false} is VALID [2018-11-14 18:25:49,601 INFO L273 TraceCheckUtils]: 53: Hoare triple {4420#false} assume !~bvsle32(~i~0, ~max~0); {4420#false} is VALID [2018-11-14 18:25:49,601 INFO L273 TraceCheckUtils]: 52: Hoare triple {4420#false} assume true; {4420#false} is VALID [2018-11-14 18:25:49,601 INFO L273 TraceCheckUtils]: 51: Hoare triple {4420#false} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {4420#false} is VALID [2018-11-14 18:25:49,602 INFO L273 TraceCheckUtils]: 50: Hoare triple {4420#false} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {4420#false} is VALID [2018-11-14 18:25:49,602 INFO L273 TraceCheckUtils]: 49: Hoare triple {4420#false} assume true; {4420#false} is VALID [2018-11-14 18:25:49,602 INFO L273 TraceCheckUtils]: 48: Hoare triple {4420#false} #t~post16 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {4420#false} is VALID [2018-11-14 18:25:49,602 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {4419#true} {4420#false} #210#return; {4420#false} is VALID [2018-11-14 18:25:49,603 INFO L273 TraceCheckUtils]: 46: Hoare triple {4419#true} assume true; {4419#true} is VALID [2018-11-14 18:25:49,603 INFO L273 TraceCheckUtils]: 45: Hoare triple {4419#true} assume !(0bv32 != ~temp~0.base || 0bv32 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {4419#true} is VALID [2018-11-14 18:25:49,603 INFO L273 TraceCheckUtils]: 44: Hoare triple {4419#true} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0bv32, 0bv32, ~new_last~0.base, ~new_last~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {4419#true} is VALID [2018-11-14 18:25:49,603 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {4419#true} {4419#true} #216#return; {4419#true} is VALID [2018-11-14 18:25:49,603 INFO L273 TraceCheckUtils]: 42: Hoare triple {4419#true} assume true; {4419#true} is VALID [2018-11-14 18:25:49,604 INFO L273 TraceCheckUtils]: 41: Hoare triple {4419#true} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0bv32, 0bv32, ~new_node~0.base, ~new_node~0.offset, 4bv32);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {4419#true} is VALID [2018-11-14 18:25:49,604 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {4419#true} {4419#true} #208#return; {4419#true} is VALID [2018-11-14 18:25:49,604 INFO L273 TraceCheckUtils]: 39: Hoare triple {4419#true} assume true; {4419#true} is VALID [2018-11-14 18:25:49,604 INFO L273 TraceCheckUtils]: 38: Hoare triple {4419#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {4419#true} is VALID [2018-11-14 18:25:49,605 INFO L273 TraceCheckUtils]: 37: Hoare triple {4419#true} assume !~bvsgt32(~len, 0bv32); {4419#true} is VALID [2018-11-14 18:25:49,605 INFO L273 TraceCheckUtils]: 36: Hoare triple {4419#true} assume true; {4419#true} is VALID [2018-11-14 18:25:49,605 INFO L273 TraceCheckUtils]: 35: Hoare triple {4419#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {4419#true} is VALID [2018-11-14 18:25:49,605 INFO L273 TraceCheckUtils]: 34: Hoare triple {4419#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {4419#true} is VALID [2018-11-14 18:25:49,605 INFO L273 TraceCheckUtils]: 33: Hoare triple {4419#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {4419#true} is VALID [2018-11-14 18:25:49,605 INFO L273 TraceCheckUtils]: 32: Hoare triple {4419#true} assume true; {4419#true} is VALID [2018-11-14 18:25:49,606 INFO L273 TraceCheckUtils]: 31: Hoare triple {4419#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {4419#true} is VALID [2018-11-14 18:25:49,606 INFO L256 TraceCheckUtils]: 30: Hoare triple {4419#true} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {4419#true} is VALID [2018-11-14 18:25:49,606 INFO L273 TraceCheckUtils]: 29: Hoare triple {4419#true} assume !(0bv32 == ~new_node~0.base && 0bv32 == ~new_node~0.offset); {4419#true} is VALID [2018-11-14 18:25:49,606 INFO L273 TraceCheckUtils]: 28: Hoare triple {4419#true} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {4419#true} is VALID [2018-11-14 18:25:49,606 INFO L256 TraceCheckUtils]: 27: Hoare triple {4419#true} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {4419#true} is VALID [2018-11-14 18:25:49,607 INFO L273 TraceCheckUtils]: 26: Hoare triple {4419#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {4419#true} is VALID [2018-11-14 18:25:49,607 INFO L256 TraceCheckUtils]: 25: Hoare triple {4420#false} call sll_append(~#head~1.base, ~#head~1.offset, ~i~0); {4419#true} is VALID [2018-11-14 18:25:49,607 INFO L273 TraceCheckUtils]: 24: Hoare triple {4420#false} assume !!(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {4420#false} is VALID [2018-11-14 18:25:49,607 INFO L273 TraceCheckUtils]: 23: Hoare triple {4420#false} assume true; {4420#false} is VALID [2018-11-14 18:25:49,608 INFO L273 TraceCheckUtils]: 22: Hoare triple {4788#(not (bvsle main_~i~0 main_~max~0))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {4420#false} is VALID [2018-11-14 18:25:49,608 INFO L273 TraceCheckUtils]: 21: Hoare triple {4788#(not (bvsle main_~i~0 main_~max~0))} assume true; {4788#(not (bvsle main_~i~0 main_~max~0))} is VALID [2018-11-14 18:25:49,609 INFO L273 TraceCheckUtils]: 20: Hoare triple {4795#(not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~max~0))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {4788#(not (bvsle main_~i~0 main_~max~0))} is VALID [2018-11-14 18:25:49,610 INFO L273 TraceCheckUtils]: 19: Hoare triple {4795#(not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~max~0))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {4795#(not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~max~0))} is VALID [2018-11-14 18:25:49,610 INFO L273 TraceCheckUtils]: 18: Hoare triple {4795#(not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~max~0))} assume true; {4795#(not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~max~0))} is VALID [2018-11-14 18:25:49,611 INFO L273 TraceCheckUtils]: 17: Hoare triple {4795#(not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~max~0))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {4795#(not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~max~0))} is VALID [2018-11-14 18:25:49,611 INFO L273 TraceCheckUtils]: 16: Hoare triple {4795#(not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~max~0))} assume true; {4795#(not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~max~0))} is VALID [2018-11-14 18:25:49,636 INFO L273 TraceCheckUtils]: 15: Hoare triple {4811#(not (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~max~0))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {4795#(not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~max~0))} is VALID [2018-11-14 18:25:49,637 INFO L273 TraceCheckUtils]: 14: Hoare triple {4811#(not (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~max~0))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {4811#(not (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~max~0))} is VALID [2018-11-14 18:25:49,637 INFO L273 TraceCheckUtils]: 13: Hoare triple {4811#(not (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~max~0))} assume true; {4811#(not (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~max~0))} is VALID [2018-11-14 18:25:49,637 INFO L273 TraceCheckUtils]: 12: Hoare triple {4811#(not (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~max~0))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {4811#(not (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~max~0))} is VALID [2018-11-14 18:25:49,638 INFO L273 TraceCheckUtils]: 11: Hoare triple {4811#(not (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~max~0))} assume true; {4811#(not (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~max~0))} is VALID [2018-11-14 18:25:49,670 INFO L273 TraceCheckUtils]: 10: Hoare triple {4827#(not (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~max~0))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {4811#(not (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~max~0))} is VALID [2018-11-14 18:25:49,675 INFO L273 TraceCheckUtils]: 9: Hoare triple {4827#(not (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~max~0))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {4827#(not (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~max~0))} is VALID [2018-11-14 18:25:49,675 INFO L273 TraceCheckUtils]: 8: Hoare triple {4827#(not (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~max~0))} assume true; {4827#(not (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~max~0))} is VALID [2018-11-14 18:25:49,677 INFO L273 TraceCheckUtils]: 7: Hoare triple {4827#(not (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~max~0))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {4827#(not (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~max~0))} is VALID [2018-11-14 18:25:49,680 INFO L273 TraceCheckUtils]: 6: Hoare triple {4827#(not (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~max~0))} assume true; {4827#(not (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~max~0))} is VALID [2018-11-14 18:25:49,682 INFO L273 TraceCheckUtils]: 5: Hoare triple {4419#true} ~min~0 := 3bv32;~max~0 := 5bv32;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);~i~0 := ~min~0; {4827#(not (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~max~0))} is VALID [2018-11-14 18:25:49,682 INFO L256 TraceCheckUtils]: 4: Hoare triple {4419#true} call #t~ret25 := main(); {4419#true} is VALID [2018-11-14 18:25:49,682 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4419#true} {4419#true} #218#return; {4419#true} is VALID [2018-11-14 18:25:49,682 INFO L273 TraceCheckUtils]: 2: Hoare triple {4419#true} assume true; {4419#true} is VALID [2018-11-14 18:25:49,682 INFO L273 TraceCheckUtils]: 1: Hoare triple {4419#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4419#true} is VALID [2018-11-14 18:25:49,683 INFO L256 TraceCheckUtils]: 0: Hoare triple {4419#true} call ULTIMATE.init(); {4419#true} is VALID [2018-11-14 18:25:49,689 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 23 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 18:25:49,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:25:49,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-14 18:25:49,696 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2018-11-14 18:25:49,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:25:49,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 18:25:49,976 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:25:49,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 18:25:49,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 18:25:49,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:25:49,977 INFO L87 Difference]: Start difference. First operand 156 states and 192 transitions. Second operand 10 states. [2018-11-14 18:25:51,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:51,575 INFO L93 Difference]: Finished difference Result 228 states and 273 transitions. [2018-11-14 18:25:51,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 18:25:51,575 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2018-11-14 18:25:51,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:25:51,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:25:51,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2018-11-14 18:25:51,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:25:51,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2018-11-14 18:25:51,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 147 transitions. [2018-11-14 18:25:51,818 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:25:51,821 INFO L225 Difference]: With dead ends: 228 [2018-11-14 18:25:51,821 INFO L226 Difference]: Without dead ends: 99 [2018-11-14 18:25:51,823 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:25:51,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-14 18:25:52,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-11-14 18:25:52,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:25:52,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 97 states. [2018-11-14 18:25:52,338 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 97 states. [2018-11-14 18:25:52,338 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 97 states. [2018-11-14 18:25:52,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:52,342 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2018-11-14 18:25:52,343 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2018-11-14 18:25:52,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:25:52,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:25:52,343 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 99 states. [2018-11-14 18:25:52,343 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 99 states. [2018-11-14 18:25:52,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:52,347 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2018-11-14 18:25:52,347 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2018-11-14 18:25:52,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:25:52,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:25:52,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:25:52,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:25:52,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-14 18:25:52,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2018-11-14 18:25:52,352 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 72 [2018-11-14 18:25:52,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:25:52,352 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2018-11-14 18:25:52,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 18:25:52,352 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2018-11-14 18:25:52,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-14 18:25:52,353 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:25:52,354 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:25:52,354 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:25:52,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:25:52,354 INFO L82 PathProgramCache]: Analyzing trace with hash -676188987, now seen corresponding path program 2 times [2018-11-14 18:25:52,355 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:25:52,355 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 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 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:25:52,383 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 18:25:52,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:25:52,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:25:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:25:52,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:25:52,781 INFO L256 TraceCheckUtils]: 0: Hoare triple {5494#true} call ULTIMATE.init(); {5494#true} is VALID [2018-11-14 18:25:52,782 INFO L273 TraceCheckUtils]: 1: Hoare triple {5494#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {5494#true} is VALID [2018-11-14 18:25:52,782 INFO L273 TraceCheckUtils]: 2: Hoare triple {5494#true} assume true; {5494#true} is VALID [2018-11-14 18:25:52,782 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5494#true} {5494#true} #218#return; {5494#true} is VALID [2018-11-14 18:25:52,782 INFO L256 TraceCheckUtils]: 4: Hoare triple {5494#true} call #t~ret25 := main(); {5494#true} is VALID [2018-11-14 18:25:52,784 INFO L273 TraceCheckUtils]: 5: Hoare triple {5494#true} ~min~0 := 3bv32;~max~0 := 5bv32;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);~i~0 := ~min~0; {5514#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:52,784 INFO L273 TraceCheckUtils]: 6: Hoare triple {5514#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {5514#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:52,785 INFO L273 TraceCheckUtils]: 7: Hoare triple {5514#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {5514#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:52,785 INFO L273 TraceCheckUtils]: 8: Hoare triple {5514#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {5514#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:52,786 INFO L273 TraceCheckUtils]: 9: Hoare triple {5514#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {5514#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:52,787 INFO L273 TraceCheckUtils]: 10: Hoare triple {5514#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {5530#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 18:25:52,787 INFO L273 TraceCheckUtils]: 11: Hoare triple {5530#(= (_ bv4 32) main_~i~0)} assume true; {5530#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 18:25:52,788 INFO L273 TraceCheckUtils]: 12: Hoare triple {5530#(= (_ bv4 32) main_~i~0)} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {5530#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 18:25:52,788 INFO L273 TraceCheckUtils]: 13: Hoare triple {5530#(= (_ bv4 32) main_~i~0)} assume true; {5530#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 18:25:52,793 INFO L273 TraceCheckUtils]: 14: Hoare triple {5530#(= (_ bv4 32) main_~i~0)} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {5530#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 18:25:52,794 INFO L273 TraceCheckUtils]: 15: Hoare triple {5530#(= (_ bv4 32) main_~i~0)} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {5546#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:52,794 INFO L273 TraceCheckUtils]: 16: Hoare triple {5546#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {5546#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:52,794 INFO L273 TraceCheckUtils]: 17: Hoare triple {5546#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {5546#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:52,795 INFO L273 TraceCheckUtils]: 18: Hoare triple {5546#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {5546#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:52,795 INFO L273 TraceCheckUtils]: 19: Hoare triple {5546#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {5546#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:52,795 INFO L256 TraceCheckUtils]: 20: Hoare triple {5546#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} call sll_append(~#head~1.base, ~#head~1.offset, ~i~0); {5494#true} is VALID [2018-11-14 18:25:52,796 INFO L273 TraceCheckUtils]: 21: Hoare triple {5494#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {5565#(= |sll_append_#in~sublist_length| sll_append_~sublist_length)} is VALID [2018-11-14 18:25:52,796 INFO L256 TraceCheckUtils]: 22: Hoare triple {5565#(= |sll_append_#in~sublist_length| sll_append_~sublist_length)} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {5494#true} is VALID [2018-11-14 18:25:52,797 INFO L273 TraceCheckUtils]: 23: Hoare triple {5494#true} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {5572#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} is VALID [2018-11-14 18:25:52,797 INFO L273 TraceCheckUtils]: 24: Hoare triple {5572#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} assume !(0bv32 == ~new_node~0.base && 0bv32 == ~new_node~0.offset); {5572#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} is VALID [2018-11-14 18:25:52,798 INFO L256 TraceCheckUtils]: 25: Hoare triple {5572#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {5494#true} is VALID [2018-11-14 18:25:52,798 INFO L273 TraceCheckUtils]: 26: Hoare triple {5494#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {5582#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 18:25:52,799 INFO L273 TraceCheckUtils]: 27: Hoare triple {5582#(= |sll_create_#in~len| sll_create_~len)} assume true; {5582#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 18:25:52,799 INFO L273 TraceCheckUtils]: 28: Hoare triple {5582#(= |sll_create_#in~len| sll_create_~len)} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {5582#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 18:25:52,800 INFO L273 TraceCheckUtils]: 29: Hoare triple {5582#(= |sll_create_#in~len| sll_create_~len)} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {5582#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 18:25:52,801 INFO L273 TraceCheckUtils]: 30: Hoare triple {5582#(= |sll_create_#in~len| sll_create_~len)} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {5595#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-14 18:25:52,801 INFO L273 TraceCheckUtils]: 31: Hoare triple {5595#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume true; {5595#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-14 18:25:52,806 INFO L273 TraceCheckUtils]: 32: Hoare triple {5595#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {5602#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:52,807 INFO L273 TraceCheckUtils]: 33: Hoare triple {5602#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {5602#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:52,807 INFO L273 TraceCheckUtils]: 34: Hoare triple {5602#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {5602#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:52,808 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {5602#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {5572#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} #208#return; {5612#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:52,808 INFO L273 TraceCheckUtils]: 36: Hoare triple {5612#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0bv32, 0bv32, ~new_node~0.base, ~new_node~0.offset, 4bv32);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {5612#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:52,808 INFO L273 TraceCheckUtils]: 37: Hoare triple {5612#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {5612#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:52,811 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {5612#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} {5565#(= |sll_append_#in~sublist_length| sll_append_~sublist_length)} #216#return; {5622#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:52,812 INFO L273 TraceCheckUtils]: 39: Hoare triple {5622#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0bv32, 0bv32, ~new_last~0.base, ~new_last~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {5622#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:52,812 INFO L273 TraceCheckUtils]: 40: Hoare triple {5622#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} assume !(0bv32 != ~temp~0.base || 0bv32 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {5622#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:52,812 INFO L273 TraceCheckUtils]: 41: Hoare triple {5622#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {5622#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:52,813 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5622#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} {5546#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} #210#return; {5495#false} is VALID [2018-11-14 18:25:52,813 INFO L273 TraceCheckUtils]: 43: Hoare triple {5495#false} #t~post16 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {5495#false} is VALID [2018-11-14 18:25:52,813 INFO L273 TraceCheckUtils]: 44: Hoare triple {5495#false} assume true; {5495#false} is VALID [2018-11-14 18:25:52,813 INFO L273 TraceCheckUtils]: 45: Hoare triple {5495#false} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {5495#false} is VALID [2018-11-14 18:25:52,814 INFO L273 TraceCheckUtils]: 46: Hoare triple {5495#false} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {5495#false} is VALID [2018-11-14 18:25:52,814 INFO L273 TraceCheckUtils]: 47: Hoare triple {5495#false} assume true; {5495#false} is VALID [2018-11-14 18:25:52,814 INFO L273 TraceCheckUtils]: 48: Hoare triple {5495#false} assume !~bvsle32(~i~0, ~max~0); {5495#false} is VALID [2018-11-14 18:25:52,814 INFO L273 TraceCheckUtils]: 49: Hoare triple {5495#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~i~0 := ~min~0; {5495#false} is VALID [2018-11-14 18:25:52,814 INFO L273 TraceCheckUtils]: 50: Hoare triple {5495#false} assume true; {5495#false} is VALID [2018-11-14 18:25:52,815 INFO L273 TraceCheckUtils]: 51: Hoare triple {5495#false} assume !!(0bv32 != ~ptr~0.base || 0bv32 != ~ptr~0.offset); {5495#false} is VALID [2018-11-14 18:25:52,815 INFO L273 TraceCheckUtils]: 52: Hoare triple {5495#false} assume !~bvsgt32(~i~0, ~max~0); {5495#false} is VALID [2018-11-14 18:25:52,815 INFO L273 TraceCheckUtils]: 53: Hoare triple {5495#false} assume true; {5495#false} is VALID [2018-11-14 18:25:52,815 INFO L273 TraceCheckUtils]: 54: Hoare triple {5495#false} assume !!(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32);call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {5495#false} is VALID [2018-11-14 18:25:52,816 INFO L256 TraceCheckUtils]: 55: Hoare triple {5495#false} call #t~ret21 := sll_length(#t~mem20.base, #t~mem20.offset); {5495#false} is VALID [2018-11-14 18:25:52,816 INFO L273 TraceCheckUtils]: 56: Hoare triple {5495#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {5495#false} is VALID [2018-11-14 18:25:52,816 INFO L273 TraceCheckUtils]: 57: Hoare triple {5495#false} assume true; {5495#false} is VALID [2018-11-14 18:25:52,816 INFO L273 TraceCheckUtils]: 58: Hoare triple {5495#false} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {5495#false} is VALID [2018-11-14 18:25:52,816 INFO L273 TraceCheckUtils]: 59: Hoare triple {5495#false} #res := ~len~0; {5495#false} is VALID [2018-11-14 18:25:52,817 INFO L273 TraceCheckUtils]: 60: Hoare triple {5495#false} assume true; {5495#false} is VALID [2018-11-14 18:25:52,817 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {5495#false} {5495#false} #212#return; {5495#false} is VALID [2018-11-14 18:25:52,817 INFO L273 TraceCheckUtils]: 62: Hoare triple {5495#false} ~count~0 := #t~ret21;havoc #t~ret21;havoc #t~mem20.base, #t~mem20.offset; {5495#false} is VALID [2018-11-14 18:25:52,817 INFO L273 TraceCheckUtils]: 63: Hoare triple {5495#false} assume !(~i~0 == ~count~0); {5495#false} is VALID [2018-11-14 18:25:52,817 INFO L273 TraceCheckUtils]: 64: Hoare triple {5495#false} assume !(3bv32 == ~i~0 && 5bv32 == ~count~0); {5495#false} is VALID [2018-11-14 18:25:52,817 INFO L273 TraceCheckUtils]: 65: Hoare triple {5495#false} assume !(~bvadd32(1bv32, ~i~0) == ~count~0 && ~bvslt32(~i~0, ~max~0)); {5495#false} is VALID [2018-11-14 18:25:52,817 INFO L273 TraceCheckUtils]: 66: Hoare triple {5495#false} assume !false; {5495#false} is VALID [2018-11-14 18:25:52,821 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:25:52,821 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:25:53,735 INFO L273 TraceCheckUtils]: 66: Hoare triple {5495#false} assume !false; {5495#false} is VALID [2018-11-14 18:25:53,736 INFO L273 TraceCheckUtils]: 65: Hoare triple {5495#false} assume !(~bvadd32(1bv32, ~i~0) == ~count~0 && ~bvslt32(~i~0, ~max~0)); {5495#false} is VALID [2018-11-14 18:25:53,736 INFO L273 TraceCheckUtils]: 64: Hoare triple {5495#false} assume !(3bv32 == ~i~0 && 5bv32 == ~count~0); {5495#false} is VALID [2018-11-14 18:25:53,736 INFO L273 TraceCheckUtils]: 63: Hoare triple {5495#false} assume !(~i~0 == ~count~0); {5495#false} is VALID [2018-11-14 18:25:53,737 INFO L273 TraceCheckUtils]: 62: Hoare triple {5495#false} ~count~0 := #t~ret21;havoc #t~ret21;havoc #t~mem20.base, #t~mem20.offset; {5495#false} is VALID [2018-11-14 18:25:53,737 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {5494#true} {5495#false} #212#return; {5495#false} is VALID [2018-11-14 18:25:53,737 INFO L273 TraceCheckUtils]: 60: Hoare triple {5494#true} assume true; {5494#true} is VALID [2018-11-14 18:25:53,737 INFO L273 TraceCheckUtils]: 59: Hoare triple {5494#true} #res := ~len~0; {5494#true} is VALID [2018-11-14 18:25:53,738 INFO L273 TraceCheckUtils]: 58: Hoare triple {5494#true} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {5494#true} is VALID [2018-11-14 18:25:53,738 INFO L273 TraceCheckUtils]: 57: Hoare triple {5494#true} assume true; {5494#true} is VALID [2018-11-14 18:25:53,738 INFO L273 TraceCheckUtils]: 56: Hoare triple {5494#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {5494#true} is VALID [2018-11-14 18:25:53,739 INFO L256 TraceCheckUtils]: 55: Hoare triple {5495#false} call #t~ret21 := sll_length(#t~mem20.base, #t~mem20.offset); {5494#true} is VALID [2018-11-14 18:25:53,739 INFO L273 TraceCheckUtils]: 54: Hoare triple {5495#false} assume !!(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32);call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {5495#false} is VALID [2018-11-14 18:25:53,739 INFO L273 TraceCheckUtils]: 53: Hoare triple {5495#false} assume true; {5495#false} is VALID [2018-11-14 18:25:53,739 INFO L273 TraceCheckUtils]: 52: Hoare triple {5495#false} assume !~bvsgt32(~i~0, ~max~0); {5495#false} is VALID [2018-11-14 18:25:53,739 INFO L273 TraceCheckUtils]: 51: Hoare triple {5495#false} assume !!(0bv32 != ~ptr~0.base || 0bv32 != ~ptr~0.offset); {5495#false} is VALID [2018-11-14 18:25:53,739 INFO L273 TraceCheckUtils]: 50: Hoare triple {5495#false} assume true; {5495#false} is VALID [2018-11-14 18:25:53,740 INFO L273 TraceCheckUtils]: 49: Hoare triple {5495#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~i~0 := ~min~0; {5495#false} is VALID [2018-11-14 18:25:53,740 INFO L273 TraceCheckUtils]: 48: Hoare triple {5495#false} assume !~bvsle32(~i~0, ~max~0); {5495#false} is VALID [2018-11-14 18:25:53,740 INFO L273 TraceCheckUtils]: 47: Hoare triple {5495#false} assume true; {5495#false} is VALID [2018-11-14 18:25:53,740 INFO L273 TraceCheckUtils]: 46: Hoare triple {5495#false} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {5495#false} is VALID [2018-11-14 18:25:53,740 INFO L273 TraceCheckUtils]: 45: Hoare triple {5495#false} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {5495#false} is VALID [2018-11-14 18:25:53,741 INFO L273 TraceCheckUtils]: 44: Hoare triple {5495#false} assume true; {5495#false} is VALID [2018-11-14 18:25:53,741 INFO L273 TraceCheckUtils]: 43: Hoare triple {5495#false} #t~post16 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {5495#false} is VALID [2018-11-14 18:25:53,754 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5622#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} {5779#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #210#return; {5495#false} is VALID [2018-11-14 18:25:53,755 INFO L273 TraceCheckUtils]: 41: Hoare triple {5622#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {5622#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:53,755 INFO L273 TraceCheckUtils]: 40: Hoare triple {5622#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} assume !(0bv32 != ~temp~0.base || 0bv32 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {5622#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:53,755 INFO L273 TraceCheckUtils]: 39: Hoare triple {5622#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0bv32, 0bv32, ~new_last~0.base, ~new_last~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {5622#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:53,758 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {5612#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} {5795#(or (bvsgt (bvadd sll_append_~sublist_length (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32))))} #216#return; {5622#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:53,759 INFO L273 TraceCheckUtils]: 37: Hoare triple {5612#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {5612#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:53,759 INFO L273 TraceCheckUtils]: 36: Hoare triple {5612#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0bv32, 0bv32, ~new_node~0.base, ~new_node~0.offset, 4bv32);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {5612#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:53,762 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {5602#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {5808#(or (not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd node_create_with_sublist_~sublist_length (_ bv4294967295 32)) (_ bv0 32)))} #208#return; {5612#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:53,763 INFO L273 TraceCheckUtils]: 34: Hoare triple {5602#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {5602#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:53,763 INFO L273 TraceCheckUtils]: 33: Hoare triple {5602#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {5602#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:53,764 INFO L273 TraceCheckUtils]: 32: Hoare triple {5821#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume !~bvsgt32(~len, 0bv32); {5602#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:53,764 INFO L273 TraceCheckUtils]: 31: Hoare triple {5821#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume true; {5821#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-14 18:25:53,767 INFO L273 TraceCheckUtils]: 30: Hoare triple {5828#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {5821#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-14 18:25:53,768 INFO L273 TraceCheckUtils]: 29: Hoare triple {5828#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {5828#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:53,768 INFO L273 TraceCheckUtils]: 28: Hoare triple {5828#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {5828#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:53,769 INFO L273 TraceCheckUtils]: 27: Hoare triple {5828#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} assume true; {5828#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:53,769 INFO L273 TraceCheckUtils]: 26: Hoare triple {5494#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {5828#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:53,769 INFO L256 TraceCheckUtils]: 25: Hoare triple {5808#(or (not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd node_create_with_sublist_~sublist_length (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {5494#true} is VALID [2018-11-14 18:25:53,769 INFO L273 TraceCheckUtils]: 24: Hoare triple {5808#(or (not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd node_create_with_sublist_~sublist_length (_ bv4294967295 32)) (_ bv0 32)))} assume !(0bv32 == ~new_node~0.base && 0bv32 == ~new_node~0.offset); {5808#(or (not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd node_create_with_sublist_~sublist_length (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:53,770 INFO L273 TraceCheckUtils]: 23: Hoare triple {5494#true} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {5808#(or (not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd node_create_with_sublist_~sublist_length (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:53,771 INFO L256 TraceCheckUtils]: 22: Hoare triple {5795#(or (bvsgt (bvadd sll_append_~sublist_length (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32))))} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {5494#true} is VALID [2018-11-14 18:25:53,773 INFO L273 TraceCheckUtils]: 21: Hoare triple {5494#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {5795#(or (bvsgt (bvadd sll_append_~sublist_length (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-14 18:25:53,773 INFO L256 TraceCheckUtils]: 20: Hoare triple {5779#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call sll_append(~#head~1.base, ~#head~1.offset, ~i~0); {5494#true} is VALID [2018-11-14 18:25:53,773 INFO L273 TraceCheckUtils]: 19: Hoare triple {5779#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {5779#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:53,774 INFO L273 TraceCheckUtils]: 18: Hoare triple {5779#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {5779#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:53,775 INFO L273 TraceCheckUtils]: 17: Hoare triple {5779#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {5779#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:53,775 INFO L273 TraceCheckUtils]: 16: Hoare triple {5779#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {5779#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:53,777 INFO L273 TraceCheckUtils]: 15: Hoare triple {5865#(bvsgt main_~i~0 (_ bv0 32))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {5779#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:53,777 INFO L273 TraceCheckUtils]: 14: Hoare triple {5865#(bvsgt main_~i~0 (_ bv0 32))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {5865#(bvsgt main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:25:53,778 INFO L273 TraceCheckUtils]: 13: Hoare triple {5865#(bvsgt main_~i~0 (_ bv0 32))} assume true; {5865#(bvsgt main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:25:53,778 INFO L273 TraceCheckUtils]: 12: Hoare triple {5865#(bvsgt main_~i~0 (_ bv0 32))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {5865#(bvsgt main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:25:53,779 INFO L273 TraceCheckUtils]: 11: Hoare triple {5865#(bvsgt main_~i~0 (_ bv0 32))} assume true; {5865#(bvsgt main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:25:53,779 INFO L273 TraceCheckUtils]: 10: Hoare triple {5881#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {5865#(bvsgt main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:25:53,780 INFO L273 TraceCheckUtils]: 9: Hoare triple {5881#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {5881#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:53,780 INFO L273 TraceCheckUtils]: 8: Hoare triple {5881#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} assume true; {5881#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:53,780 INFO L273 TraceCheckUtils]: 7: Hoare triple {5881#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {5881#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:53,781 INFO L273 TraceCheckUtils]: 6: Hoare triple {5881#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} assume true; {5881#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:53,782 INFO L273 TraceCheckUtils]: 5: Hoare triple {5494#true} ~min~0 := 3bv32;~max~0 := 5bv32;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);~i~0 := ~min~0; {5881#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:53,782 INFO L256 TraceCheckUtils]: 4: Hoare triple {5494#true} call #t~ret25 := main(); {5494#true} is VALID [2018-11-14 18:25:53,783 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5494#true} {5494#true} #218#return; {5494#true} is VALID [2018-11-14 18:25:53,783 INFO L273 TraceCheckUtils]: 2: Hoare triple {5494#true} assume true; {5494#true} is VALID [2018-11-14 18:25:53,783 INFO L273 TraceCheckUtils]: 1: Hoare triple {5494#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {5494#true} is VALID [2018-11-14 18:25:53,783 INFO L256 TraceCheckUtils]: 0: Hoare triple {5494#true} call ULTIMATE.init(); {5494#true} is VALID [2018-11-14 18:25:53,789 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:25:53,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:25:53,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-11-14 18:25:53,792 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2018-11-14 18:25:53,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:25:53,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 18:25:53,942 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:25:53,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 18:25:53,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 18:25:53,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-11-14 18:25:53,943 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand 19 states. [2018-11-14 18:25:59,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:59,346 INFO L93 Difference]: Finished difference Result 223 states and 264 transitions. [2018-11-14 18:25:59,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 18:25:59,346 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2018-11-14 18:25:59,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:25:59,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 18:25:59,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 219 transitions. [2018-11-14 18:25:59,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 18:25:59,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 219 transitions. [2018-11-14 18:25:59,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 219 transitions. [2018-11-14 18:26:00,297 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:26:00,300 INFO L225 Difference]: With dead ends: 223 [2018-11-14 18:26:00,300 INFO L226 Difference]: Without dead ends: 132 [2018-11-14 18:26:00,301 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2018-11-14 18:26:00,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-14 18:26:00,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 101. [2018-11-14 18:26:00,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:26:00,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand 101 states. [2018-11-14 18:26:00,583 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 101 states. [2018-11-14 18:26:00,583 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 101 states. [2018-11-14 18:26:00,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:26:00,588 INFO L93 Difference]: Finished difference Result 132 states and 154 transitions. [2018-11-14 18:26:00,588 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 154 transitions. [2018-11-14 18:26:00,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:26:00,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:26:00,589 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 132 states. [2018-11-14 18:26:00,589 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 132 states. [2018-11-14 18:26:00,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:26:00,594 INFO L93 Difference]: Finished difference Result 132 states and 154 transitions. [2018-11-14 18:26:00,594 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 154 transitions. [2018-11-14 18:26:00,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:26:00,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:26:00,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:26:00,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:26:00,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-14 18:26:00,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2018-11-14 18:26:00,600 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 67 [2018-11-14 18:26:00,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:26:00,600 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2018-11-14 18:26:00,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 18:26:00,600 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2018-11-14 18:26:00,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-14 18:26:00,601 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:26:00,601 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:26:00,601 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:26:00,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:26:00,602 INFO L82 PathProgramCache]: Analyzing trace with hash -734405619, now seen corresponding path program 3 times [2018-11-14 18:26:00,602 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:26:00,602 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 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 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:26:00,632 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 18:26:00,855 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-14 18:26:00,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:26:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:26:00,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:26:00,920 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:26:00,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:00,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:26:00,929 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-14 18:26:00,933 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:26:01,148 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 16 treesize of output 13 [2018-11-14 18:26:01,154 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-11-14 18:26:01,163 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:26:01,165 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:26:01,166 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 33 [2018-11-14 18:26:01,169 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:01,183 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:26:01,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:26:01,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:26:01,214 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-11-14 18:26:01,227 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:26:01,362 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:01,363 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 27 treesize of output 25 [2018-11-14 18:26:01,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-11-14 18:26:01,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:01,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:26:01,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:26:01,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:30 [2018-11-14 18:26:01,517 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:26:01,522 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:26:01,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:01,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:26:01,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 37 [2018-11-14 18:26:01,688 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 28 treesize of output 27 [2018-11-14 18:26:01,692 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:01,841 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 4 case distinctions, treesize of input 23 treesize of output 37 [2018-11-14 18:26:01,852 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-11-14 18:26:01,930 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-14 18:26:01,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-14 18:26:01,997 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:43, output treesize:110 [2018-11-14 18:26:04,005 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:26:04,174 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:26:04,175 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:26:04,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2018-11-14 18:26:04,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:04,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:26:04,254 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:131, output treesize:42 [2018-11-14 18:26:04,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 18:26:04,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 18:26:04,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:04,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:26:04,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:26:04,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:42 [2018-11-14 18:26:04,427 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:26:04,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 28 [2018-11-14 18:26:04,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 4 [2018-11-14 18:26:04,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:04,733 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 6 treesize of output 4 [2018-11-14 18:26:04,735 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:04,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:26:04,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:26:04,738 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:43, output treesize:4 [2018-11-14 18:26:04,742 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:26:04,853 INFO L256 TraceCheckUtils]: 0: Hoare triple {6624#true} call ULTIMATE.init(); {6624#true} is VALID [2018-11-14 18:26:04,854 INFO L273 TraceCheckUtils]: 1: Hoare triple {6624#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {6624#true} is VALID [2018-11-14 18:26:04,854 INFO L273 TraceCheckUtils]: 2: Hoare triple {6624#true} assume true; {6624#true} is VALID [2018-11-14 18:26:04,854 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6624#true} {6624#true} #218#return; {6624#true} is VALID [2018-11-14 18:26:04,854 INFO L256 TraceCheckUtils]: 4: Hoare triple {6624#true} call #t~ret25 := main(); {6624#true} is VALID [2018-11-14 18:26:04,856 INFO L273 TraceCheckUtils]: 5: Hoare triple {6624#true} ~min~0 := 3bv32;~max~0 := 5bv32;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);~i~0 := ~min~0; {6644#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 18:26:04,857 INFO L273 TraceCheckUtils]: 6: Hoare triple {6644#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume true; {6644#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 18:26:04,857 INFO L273 TraceCheckUtils]: 7: Hoare triple {6644#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {6644#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 18:26:04,858 INFO L273 TraceCheckUtils]: 8: Hoare triple {6644#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume true; {6644#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 18:26:04,859 INFO L273 TraceCheckUtils]: 9: Hoare triple {6644#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {6644#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 18:26:04,860 INFO L273 TraceCheckUtils]: 10: Hoare triple {6644#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {6644#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 18:26:04,860 INFO L273 TraceCheckUtils]: 11: Hoare triple {6644#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume true; {6644#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 18:26:04,861 INFO L273 TraceCheckUtils]: 12: Hoare triple {6644#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {6644#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 18:26:04,862 INFO L273 TraceCheckUtils]: 13: Hoare triple {6644#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume true; {6644#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 18:26:04,862 INFO L273 TraceCheckUtils]: 14: Hoare triple {6644#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {6644#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 18:26:04,863 INFO L273 TraceCheckUtils]: 15: Hoare triple {6644#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {6644#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 18:26:04,864 INFO L273 TraceCheckUtils]: 16: Hoare triple {6644#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume true; {6644#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 18:26:04,864 INFO L273 TraceCheckUtils]: 17: Hoare triple {6644#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {6644#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 18:26:04,865 INFO L273 TraceCheckUtils]: 18: Hoare triple {6644#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume true; {6644#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 18:26:04,866 INFO L273 TraceCheckUtils]: 19: Hoare triple {6644#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume !!(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {6644#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 18:26:04,867 INFO L256 TraceCheckUtils]: 20: Hoare triple {6644#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} call sll_append(~#head~1.base, ~#head~1.offset, ~i~0); {6690#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 18:26:04,868 INFO L273 TraceCheckUtils]: 21: Hoare triple {6690#(= |#valid| |old(#valid)|)} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {6694#(and (= |#valid| |old(#valid)|) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|))} is VALID [2018-11-14 18:26:04,869 INFO L256 TraceCheckUtils]: 22: Hoare triple {6694#(and (= |#valid| |old(#valid)|) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|))} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {6690#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 18:26:04,871 INFO L273 TraceCheckUtils]: 23: Hoare triple {6690#(= |#valid| |old(#valid)|)} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {6701#(and (= node_create_with_sublist_~new_node~0.offset (_ bv0 32)) (= (select |old(#valid)| node_create_with_sublist_~new_node~0.base) (_ bv0 1)))} is VALID [2018-11-14 18:26:04,872 INFO L273 TraceCheckUtils]: 24: Hoare triple {6701#(and (= node_create_with_sublist_~new_node~0.offset (_ bv0 32)) (= (select |old(#valid)| node_create_with_sublist_~new_node~0.base) (_ bv0 1)))} assume !(0bv32 == ~new_node~0.base && 0bv32 == ~new_node~0.offset); {6701#(and (= node_create_with_sublist_~new_node~0.offset (_ bv0 32)) (= (select |old(#valid)| node_create_with_sublist_~new_node~0.base) (_ bv0 1)))} is VALID [2018-11-14 18:26:04,872 INFO L256 TraceCheckUtils]: 25: Hoare triple {6701#(and (= node_create_with_sublist_~new_node~0.offset (_ bv0 32)) (= (select |old(#valid)| node_create_with_sublist_~new_node~0.base) (_ bv0 1)))} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {6624#true} is VALID [2018-11-14 18:26:04,872 INFO L273 TraceCheckUtils]: 26: Hoare triple {6624#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {6624#true} is VALID [2018-11-14 18:26:04,872 INFO L273 TraceCheckUtils]: 27: Hoare triple {6624#true} assume true; {6624#true} is VALID [2018-11-14 18:26:04,873 INFO L273 TraceCheckUtils]: 28: Hoare triple {6624#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6624#true} is VALID [2018-11-14 18:26:04,873 INFO L273 TraceCheckUtils]: 29: Hoare triple {6624#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {6624#true} is VALID [2018-11-14 18:26:04,873 INFO L273 TraceCheckUtils]: 30: Hoare triple {6624#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {6624#true} is VALID [2018-11-14 18:26:04,873 INFO L273 TraceCheckUtils]: 31: Hoare triple {6624#true} assume true; {6624#true} is VALID [2018-11-14 18:26:04,874 INFO L273 TraceCheckUtils]: 32: Hoare triple {6624#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6729#(not (= (_ bv0 32) sll_create_~new_head~0.base))} is VALID [2018-11-14 18:26:04,875 INFO L273 TraceCheckUtils]: 33: Hoare triple {6729#(not (= (_ bv0 32) sll_create_~new_head~0.base))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {6729#(not (= (_ bv0 32) sll_create_~new_head~0.base))} is VALID [2018-11-14 18:26:04,875 INFO L273 TraceCheckUtils]: 34: Hoare triple {6729#(not (= (_ bv0 32) sll_create_~new_head~0.base))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {6736#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 18:26:04,876 INFO L273 TraceCheckUtils]: 35: Hoare triple {6736#(not (= sll_create_~head~0.base (_ bv0 32)))} assume true; {6736#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 18:26:04,876 INFO L273 TraceCheckUtils]: 36: Hoare triple {6736#(not (= sll_create_~head~0.base (_ bv0 32)))} assume !~bvsgt32(~len, 0bv32); {6736#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 18:26:04,876 INFO L273 TraceCheckUtils]: 37: Hoare triple {6736#(not (= sll_create_~head~0.base (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {6746#(not (= (_ bv0 32) |sll_create_#res.base|))} is VALID [2018-11-14 18:26:04,877 INFO L273 TraceCheckUtils]: 38: Hoare triple {6746#(not (= (_ bv0 32) |sll_create_#res.base|))} assume true; {6746#(not (= (_ bv0 32) |sll_create_#res.base|))} is VALID [2018-11-14 18:26:04,878 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {6746#(not (= (_ bv0 32) |sll_create_#res.base|))} {6701#(and (= node_create_with_sublist_~new_node~0.offset (_ bv0 32)) (= (select |old(#valid)| node_create_with_sublist_~new_node~0.base) (_ bv0 1)))} #208#return; {6753#(and (not (= (_ bv0 32) |node_create_with_sublist_#t~ret5.base|)) (= node_create_with_sublist_~new_node~0.offset (_ bv0 32)) (= (select |old(#valid)| node_create_with_sublist_~new_node~0.base) (_ bv0 1)))} is VALID [2018-11-14 18:26:04,880 INFO L273 TraceCheckUtils]: 40: Hoare triple {6753#(and (not (= (_ bv0 32) |node_create_with_sublist_#t~ret5.base|)) (= node_create_with_sublist_~new_node~0.offset (_ bv0 32)) (= (select |old(#valid)| node_create_with_sublist_~new_node~0.base) (_ bv0 1)))} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0bv32, 0bv32, ~new_node~0.base, ~new_node~0.offset, 4bv32);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {6757#(and (= |node_create_with_sublist_#res.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|) (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) (bvadd |node_create_with_sublist_#res.offset| (_ bv4 32))))) (= (select |old(#valid)| |node_create_with_sublist_#res.base|) (_ bv0 1)))} is VALID [2018-11-14 18:26:04,882 INFO L273 TraceCheckUtils]: 41: Hoare triple {6757#(and (= |node_create_with_sublist_#res.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|) (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) (bvadd |node_create_with_sublist_#res.offset| (_ bv4 32))))) (= (select |old(#valid)| |node_create_with_sublist_#res.base|) (_ bv0 1)))} assume true; {6757#(and (= |node_create_with_sublist_#res.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|) (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) (bvadd |node_create_with_sublist_#res.offset| (_ bv4 32))))) (= (select |old(#valid)| |node_create_with_sublist_#res.base|) (_ bv0 1)))} is VALID [2018-11-14 18:26:04,884 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {6757#(and (= |node_create_with_sublist_#res.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|) (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) (bvadd |node_create_with_sublist_#res.offset| (_ bv4 32))))) (= (select |old(#valid)| |node_create_with_sublist_#res.base|) (_ bv0 1)))} {6694#(and (= |#valid| |old(#valid)|) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|))} #216#return; {6764#(and (= sll_append_~head.base |sll_append_#in~head.base|) (= (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) (_ bv4 32)) (_ bv0 32))) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= (_ bv0 32) |sll_append_#t~ret8.offset|) (= (_ bv0 1) (select |old(#valid)| |sll_append_#t~ret8.base|)))} is VALID [2018-11-14 18:26:04,886 INFO L273 TraceCheckUtils]: 43: Hoare triple {6764#(and (= sll_append_~head.base |sll_append_#in~head.base|) (= (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) (_ bv4 32)) (_ bv0 32))) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= (_ bv0 32) |sll_append_#t~ret8.offset|) (= (_ bv0 1) (select |old(#valid)| |sll_append_#t~ret8.base|)))} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0bv32, 0bv32, ~new_last~0.base, ~new_last~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {6768#(and (= (_ bv0 1) (select |old(#valid)| sll_append_~new_last~0.base)) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= (select (select |#memory_$Pointer$.base| sll_append_~new_last~0.base) sll_append_~new_last~0.offset) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| sll_append_~new_last~0.base) (_ bv4 32)) (_ bv0 32))) (= sll_append_~new_last~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:26:04,892 INFO L273 TraceCheckUtils]: 44: Hoare triple {6768#(and (= (_ bv0 1) (select |old(#valid)| sll_append_~new_last~0.base)) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= (select (select |#memory_$Pointer$.base| sll_append_~new_last~0.base) sll_append_~new_last~0.offset) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| sll_append_~new_last~0.base) (_ bv4 32)) (_ bv0 32))) (= sll_append_~new_last~0.offset (_ bv0 32)))} assume !(0bv32 != ~temp~0.base || 0bv32 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {6772#(or (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32)))) (and (= (_ bv4 32) |sll_append_#in~head.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv0 32)) (_ bv0 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (not (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) |sll_append_#in~head.offset|)))} is VALID [2018-11-14 18:26:04,892 INFO L273 TraceCheckUtils]: 45: Hoare triple {6772#(or (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32)))) (and (= (_ bv4 32) |sll_append_#in~head.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv0 32)) (_ bv0 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (not (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) |sll_append_#in~head.offset|)))} assume true; {6772#(or (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32)))) (and (= (_ bv4 32) |sll_append_#in~head.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv0 32)) (_ bv0 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (not (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) |sll_append_#in~head.offset|)))} is VALID [2018-11-14 18:26:04,895 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {6772#(or (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32)))) (and (= (_ bv4 32) |sll_append_#in~head.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv0 32)) (_ bv0 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (not (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) |sll_append_#in~head.offset|)))} {6644#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} #210#return; {6779#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv4 32)) (_ bv0 32))) (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 18:26:04,895 INFO L273 TraceCheckUtils]: 47: Hoare triple {6779#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv4 32)) (_ bv0 32))) (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv0 32)) (_ bv0 32)))} #t~post16 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {6779#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv4 32)) (_ bv0 32))) (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 18:26:04,896 INFO L273 TraceCheckUtils]: 48: Hoare triple {6779#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv4 32)) (_ bv0 32))) (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv0 32)) (_ bv0 32)))} assume true; {6779#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv4 32)) (_ bv0 32))) (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 18:26:04,897 INFO L273 TraceCheckUtils]: 49: Hoare triple {6779#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv4 32)) (_ bv0 32))) (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv0 32)) (_ bv0 32)))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {6779#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv4 32)) (_ bv0 32))) (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 18:26:04,898 INFO L273 TraceCheckUtils]: 50: Hoare triple {6779#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv4 32)) (_ bv0 32))) (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv0 32)) (_ bv0 32)))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {6779#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv4 32)) (_ bv0 32))) (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 18:26:04,899 INFO L273 TraceCheckUtils]: 51: Hoare triple {6779#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv4 32)) (_ bv0 32))) (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv0 32)) (_ bv0 32)))} assume true; {6779#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv4 32)) (_ bv0 32))) (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 18:26:04,900 INFO L273 TraceCheckUtils]: 52: Hoare triple {6779#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv4 32)) (_ bv0 32))) (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv0 32)) (_ bv0 32)))} assume !~bvsle32(~i~0, ~max~0); {6779#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv4 32)) (_ bv0 32))) (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 18:26:04,902 INFO L273 TraceCheckUtils]: 53: Hoare triple {6779#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv4 32)) (_ bv0 32))) (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv0 32)) (_ bv0 32)))} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~i~0 := ~min~0; {6801#(and (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.base))) (= main_~ptr~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:26:04,904 INFO L273 TraceCheckUtils]: 54: Hoare triple {6801#(and (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.base))) (= main_~ptr~0.offset (_ bv0 32)))} assume true; {6801#(and (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.base))) (= main_~ptr~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:26:04,905 INFO L273 TraceCheckUtils]: 55: Hoare triple {6801#(and (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.base))) (= main_~ptr~0.offset (_ bv0 32)))} assume !!(0bv32 != ~ptr~0.base || 0bv32 != ~ptr~0.offset); {6801#(and (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.base))) (= main_~ptr~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:26:04,906 INFO L273 TraceCheckUtils]: 56: Hoare triple {6801#(and (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.base))) (= main_~ptr~0.offset (_ bv0 32)))} assume !~bvsgt32(~i~0, ~max~0); {6801#(and (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.base))) (= main_~ptr~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:26:04,907 INFO L273 TraceCheckUtils]: 57: Hoare triple {6801#(and (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.base))) (= main_~ptr~0.offset (_ bv0 32)))} assume true; {6801#(and (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.base))) (= main_~ptr~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:26:04,908 INFO L273 TraceCheckUtils]: 58: Hoare triple {6801#(and (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.base))) (= main_~ptr~0.offset (_ bv0 32)))} assume !!(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32);call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {6817#(not (= |main_#t~mem20.base| (_ bv0 32)))} is VALID [2018-11-14 18:26:04,909 INFO L256 TraceCheckUtils]: 59: Hoare triple {6817#(not (= |main_#t~mem20.base| (_ bv0 32)))} call #t~ret21 := sll_length(#t~mem20.base, #t~mem20.offset); {6624#true} is VALID [2018-11-14 18:26:04,909 INFO L273 TraceCheckUtils]: 60: Hoare triple {6624#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {6824#(= sll_length_~head.base |sll_length_#in~head.base|)} is VALID [2018-11-14 18:26:04,910 INFO L273 TraceCheckUtils]: 61: Hoare triple {6824#(= sll_length_~head.base |sll_length_#in~head.base|)} assume true; {6824#(= sll_length_~head.base |sll_length_#in~head.base|)} is VALID [2018-11-14 18:26:04,910 INFO L273 TraceCheckUtils]: 62: Hoare triple {6824#(= sll_length_~head.base |sll_length_#in~head.base|)} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {6831#(= (_ bv0 32) |sll_length_#in~head.base|)} is VALID [2018-11-14 18:26:04,911 INFO L273 TraceCheckUtils]: 63: Hoare triple {6831#(= (_ bv0 32) |sll_length_#in~head.base|)} #res := ~len~0; {6831#(= (_ bv0 32) |sll_length_#in~head.base|)} is VALID [2018-11-14 18:26:04,911 INFO L273 TraceCheckUtils]: 64: Hoare triple {6831#(= (_ bv0 32) |sll_length_#in~head.base|)} assume true; {6831#(= (_ bv0 32) |sll_length_#in~head.base|)} is VALID [2018-11-14 18:26:04,912 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {6831#(= (_ bv0 32) |sll_length_#in~head.base|)} {6817#(not (= |main_#t~mem20.base| (_ bv0 32)))} #212#return; {6625#false} is VALID [2018-11-14 18:26:04,913 INFO L273 TraceCheckUtils]: 66: Hoare triple {6625#false} ~count~0 := #t~ret21;havoc #t~ret21;havoc #t~mem20.base, #t~mem20.offset; {6625#false} is VALID [2018-11-14 18:26:04,913 INFO L273 TraceCheckUtils]: 67: Hoare triple {6625#false} assume !(~i~0 == ~count~0); {6625#false} is VALID [2018-11-14 18:26:04,913 INFO L273 TraceCheckUtils]: 68: Hoare triple {6625#false} assume !(3bv32 == ~i~0 && 5bv32 == ~count~0); {6625#false} is VALID [2018-11-14 18:26:04,913 INFO L273 TraceCheckUtils]: 69: Hoare triple {6625#false} assume !(~bvadd32(1bv32, ~i~0) == ~count~0 && ~bvslt32(~i~0, ~max~0)); {6625#false} is VALID [2018-11-14 18:26:04,914 INFO L273 TraceCheckUtils]: 70: Hoare triple {6625#false} assume !false; {6625#false} is VALID [2018-11-14 18:26:04,929 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-14 18:26:04,929 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:26:06,218 WARN L179 SmtUtils]: Spent 482.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-11-14 18:26:06,359 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-14 18:26:06,582 WARN L179 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-14 18:26:06,784 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-14 18:26:07,006 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2018-11-14 18:26:07,059 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 32 [2018-11-14 18:26:07,065 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:07,066 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 28 treesize of output 35 [2018-11-14 18:26:07,068 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:07,086 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:26:07,088 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-14 18:26:07,089 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:07,107 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 28 treesize of output 22 [2018-11-14 18:26:07,204 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-14 18:26:07,205 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:07,208 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:07,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-11-14 18:26:07,212 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:07,219 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:26:07,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:26:07,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:26:07,245 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:48, output treesize:17 [2018-11-14 18:26:09,310 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-14 18:26:09,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2018-11-14 18:26:09,326 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 32 treesize of output 30 [2018-11-14 18:26:09,328 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:26:09,355 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:26:09,361 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 43 treesize of output 41 [2018-11-14 18:26:09,370 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-11-14 18:26:09,372 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:26:09,395 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:26:09,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2018-11-14 18:26:09,416 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 32 treesize of output 30 [2018-11-14 18:26:09,419 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:26:09,447 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:26:09,465 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 43 treesize of output 41 [2018-11-14 18:26:09,522 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 32 treesize of output 30 [2018-11-14 18:26:09,545 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:26:09,623 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:26:09,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2018-11-14 18:26:09,635 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 32 treesize of output 30 [2018-11-14 18:26:09,638 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:26:09,662 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:26:09,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2018-11-14 18:26:09,716 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 32 treesize of output 30 [2018-11-14 18:26:09,739 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:26:09,768 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:26:10,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 9 xjuncts. [2018-11-14 18:26:10,335 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 1 variables, input treesize:143, output treesize:361 [2018-11-14 18:26:10,361 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:26:13,263 WARN L179 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2018-11-14 18:26:25,192 WARN L179 SmtUtils]: Spent 9.31 s on a formula simplification that was a NOOP. DAG size: 78 [2018-11-14 18:26:32,251 WARN L179 SmtUtils]: Spent 6.22 s on a formula simplification that was a NOOP. DAG size: 327 [2018-11-14 18:26:32,313 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 70 [2018-11-14 18:26:32,491 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-14 18:26:32,501 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 55 [2018-11-14 18:26:32,513 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:32,515 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 55 treesize of output 61 [2018-11-14 18:26:32,517 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:32,550 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:26:32,555 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2018-11-14 18:26:32,577 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:32,578 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 47 treesize of output 53 [2018-11-14 18:26:32,580 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:32,612 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:26:32,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2018-11-14 18:26:32,828 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:32,847 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 51 [2018-11-14 18:26:32,851 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-14 18:26:32,861 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:32,878 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:32,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 69 [2018-11-14 18:26:32,928 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-11-14 18:26:33,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 40 [2018-11-14 18:26:33,185 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:33,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-14 18:26:33,188 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:33,212 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 6 treesize of output 1 [2018-11-14 18:26:33,213 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:33,224 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:26:33,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-11-14 18:26:33,248 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:33,249 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:33,264 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:33,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2018-11-14 18:26:33,282 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-11-14 18:26:33,337 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 6 treesize of output 1 [2018-11-14 18:26:33,338 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:33,368 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:26:33,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-11-14 18:26:33,393 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:33,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 14 [2018-11-14 18:26:33,409 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-11-14 18:26:33,446 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 6 treesize of output 1 [2018-11-14 18:26:33,448 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:33,463 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:26:33,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-11-14 18:26:33,488 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:33,501 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:33,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 35 [2018-11-14 18:26:33,546 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 4 xjuncts. [2018-11-14 18:26:33,642 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 6 treesize of output 1 [2018-11-14 18:26:33,643 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:33,699 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-14 18:26:33,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2018-11-14 18:26:33,718 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 6 treesize of output 1 [2018-11-14 18:26:33,719 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:33,752 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:33,752 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:33,755 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:33,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-11-14 18:26:33,758 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:33,777 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:26:33,843 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-14 18:26:33,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2018-11-14 18:26:33,888 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:33,926 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 0 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 38 [2018-11-14 18:26:33,930 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 4 xjuncts. [2018-11-14 18:26:34,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 52 [2018-11-14 18:26:34,086 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:34,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-11-14 18:26:34,093 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:34,173 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 35 treesize of output 27 [2018-11-14 18:26:34,175 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:34,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2018-11-14 18:26:34,260 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-11-14 18:26:34,317 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:34,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2018-11-14 18:26:34,322 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:34,372 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 18:26:34,374 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:34,386 INFO L267 ElimStorePlain]: Start of recursive call 27: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:26:34,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 54 [2018-11-14 18:26:34,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 45 treesize of output 39 [2018-11-14 18:26:34,647 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:34,839 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:34,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 33 [2018-11-14 18:26:34,869 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 4 xjuncts. [2018-11-14 18:26:35,004 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 27 treesize of output 19 [2018-11-14 18:26:35,013 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:35,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2018-11-14 18:26:35,162 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 2 xjuncts. [2018-11-14 18:26:35,218 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:35,219 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:35,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-11-14 18:26:35,222 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:35,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2018-11-14 18:26:35,279 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 2 xjuncts. [2018-11-14 18:26:35,378 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:35,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 20 [2018-11-14 18:26:35,398 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 4 xjuncts. [2018-11-14 18:26:35,444 INFO L267 ElimStorePlain]: Start of recursive call 33: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-14 18:26:35,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 52 [2018-11-14 18:26:35,505 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:35,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-11-14 18:26:35,513 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:35,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2018-11-14 18:26:35,626 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 2 xjuncts. [2018-11-14 18:26:35,708 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:35,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2018-11-14 18:26:35,716 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:35,791 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 23 treesize of output 15 [2018-11-14 18:26:35,794 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:35,856 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 18:26:35,860 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:35,879 INFO L267 ElimStorePlain]: Start of recursive call 41: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:26:35,896 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:26:35,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:26:35,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 61 [2018-11-14 18:26:36,557 WARN L179 SmtUtils]: Spent 382.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-14 18:26:36,565 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2018-11-14 18:26:36,572 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:36,574 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 24 [2018-11-14 18:26:36,576 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:36,593 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:26:36,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 54 [2018-11-14 18:26:36,792 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 9 treesize of output 8 [2018-11-14 18:26:36,794 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:36,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 68 [2018-11-14 18:26:37,026 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 41 treesize of output 35 [2018-11-14 18:26:37,028 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:37,716 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:37,729 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:37,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 41 [2018-11-14 18:26:37,787 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 3 xjuncts. [2018-11-14 18:26:38,411 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 37 treesize of output 31 [2018-11-14 18:26:38,414 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:39,001 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:39,017 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:39,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 41 [2018-11-14 18:26:39,073 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 3 xjuncts. [2018-11-14 18:26:39,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-11-14 18:26:39,749 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:40,241 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:40,244 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:40,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2018-11-14 18:26:40,248 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:40,749 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 42 treesize of output 36 [2018-11-14 18:26:40,752 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:41,278 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:41,332 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:41,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 38 [2018-11-14 18:26:41,384 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 3 xjuncts. [2018-11-14 18:26:41,994 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:42,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 37 [2018-11-14 18:26:42,035 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 3 xjuncts. [2018-11-14 18:26:42,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-14 18:26:42,663 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:42,667 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 18 treesize of output 10 [2018-11-14 18:26:42,668 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:42,673 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 21 treesize of output 13 [2018-11-14 18:26:42,676 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:42,944 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 45 treesize of output 39 [2018-11-14 18:26:42,948 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:43,200 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 40 treesize of output 34 [2018-11-14 18:26:43,202 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:43,442 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:43,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-11-14 18:26:43,445 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:43,647 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:43,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-11-14 18:26:43,650 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:43,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-11-14 18:26:43,859 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:44,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 20 [2018-11-14 18:26:44,086 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 2 xjuncts. [2018-11-14 18:26:44,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 19 treesize of output 13 [2018-11-14 18:26:44,358 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:44,518 INFO L267 ElimStorePlain]: Start of recursive call 52: 21 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-14 18:26:44,568 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-14 18:26:44,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 69 [2018-11-14 18:26:44,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2018-11-14 18:26:44,687 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:44,870 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 47 treesize of output 53 [2018-11-14 18:26:44,872 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:45,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 73 [2018-11-14 18:26:45,207 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:45,225 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:45,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 58 [2018-11-14 18:26:45,301 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 3 xjuncts. [2018-11-14 18:26:46,392 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 50 treesize of output 42 [2018-11-14 18:26:46,398 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:47,155 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-11-14 18:26:47,157 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:47,162 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-11-14 18:26:47,165 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:47,867 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:47,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2018-11-14 18:26:47,871 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:48,479 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:48,502 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:48,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 49 [2018-11-14 18:26:48,569 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 3 xjuncts. [2018-11-14 18:26:49,294 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-14 18:26:49,296 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:50,044 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-11-14 18:26:50,046 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:50,054 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-11-14 18:26:50,055 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:51,698 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:51,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 48 [2018-11-14 18:26:51,759 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 3 xjuncts. [2018-11-14 18:26:52,272 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-11-14 18:26:52,274 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:52,283 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-11-14 18:26:52,284 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:52,291 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-11-14 18:26:52,295 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:52,702 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:52,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-11-14 18:26:52,706 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:53,045 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:53,048 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:53,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2018-11-14 18:26:53,052 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:53,403 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-11-14 18:26:53,404 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:53,701 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-14 18:26:53,703 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:54,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 25 [2018-11-14 18:26:54,018 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 2 xjuncts. [2018-11-14 18:26:54,304 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-11-14 18:26:54,306 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:54,787 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 20 treesize of output 12 [2018-11-14 18:26:54,788 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:54,795 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 26 treesize of output 18 [2018-11-14 18:26:54,798 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:54,802 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 20 treesize of output 12 [2018-11-14 18:26:54,804 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:55,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 24 treesize of output 18 [2018-11-14 18:26:55,015 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:55,123 INFO L267 ElimStorePlain]: Start of recursive call 75: 21 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-14 18:26:55,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2018-11-14 18:26:55,394 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 47 treesize of output 41 [2018-11-14 18:26:55,396 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:55,497 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:55,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2018-11-14 18:26:55,500 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:55,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-11-14 18:26:55,585 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:55,674 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:55,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 25 [2018-11-14 18:26:55,706 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 4 xjuncts. [2018-11-14 18:26:55,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-11-14 18:26:55,811 INFO L267 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:55,882 INFO L267 ElimStorePlain]: Start of recursive call 99: 5 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-14 18:26:56,029 INFO L267 ElimStorePlain]: Start of recursive call 72: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-14 18:26:56,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2018-11-14 18:26:56,061 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 9 treesize of output 10 [2018-11-14 18:26:56,063 INFO L267 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:56,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-11-14 18:26:56,131 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:26:56,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-11-14 18:26:56,134 INFO L267 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:56,160 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 8 treesize of output 1 [2018-11-14 18:26:56,161 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:56,172 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 6 treesize of output 1 [2018-11-14 18:26:56,172 INFO L267 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2018-11-14 18:26:56,177 INFO L267 ElimStorePlain]: Start of recursive call 107: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:26:56,189 INFO L267 ElimStorePlain]: Start of recursive call 105: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:26:56,344 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-11-14 18:27:04,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2018-11-14 18:27:04,928 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-14 18:27:04,964 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2018-11-14 18:27:04,971 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:27:04,971 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 24 [2018-11-14 18:27:04,973 INFO L267 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2018-11-14 18:27:04,996 INFO L267 ElimStorePlain]: Start of recursive call 112: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:27:05,093 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:27:05,103 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:27:05,114 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 66 [2018-11-14 18:27:05,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-14 18:27:05,125 INFO L267 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2018-11-14 18:27:05,194 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:27:05,212 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:27:05,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 71 [2018-11-14 18:27:05,303 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 49 treesize of output 43 [2018-11-14 18:27:05,305 INFO L267 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2018-11-14 18:27:05,739 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 40 treesize of output 34 [2018-11-14 18:27:05,741 INFO L267 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2018-11-14 18:27:06,166 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:27:06,210 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 48 [2018-11-14 18:27:06,225 INFO L267 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 8 xjuncts. [2018-11-14 18:27:06,924 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:27:06,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-11-14 18:27:06,929 INFO L267 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2018-11-14 18:27:07,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2018-11-14 18:27:07,546 INFO L267 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2018-11-14 18:27:08,041 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:27:08,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2018-11-14 18:27:08,044 INFO L267 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2018-11-14 18:27:08,527 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 34 treesize of output 28 [2018-11-14 18:27:08,529 INFO L267 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2018-11-14 18:27:08,996 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:27:09,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 38 [2018-11-14 18:27:09,031 INFO L267 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 3 xjuncts. [2018-11-14 18:27:09,544 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 28 treesize of output 22 [2018-11-14 18:27:09,546 INFO L267 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2018-11-14 18:27:10,031 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 22 treesize of output 16 [2018-11-14 18:27:10,033 INFO L267 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2018-11-14 18:27:10,036 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 16 treesize of output 10 [2018-11-14 18:27:10,037 INFO L267 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2018-11-14 18:27:10,040 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 19 treesize of output 13 [2018-11-14 18:27:10,060 INFO L267 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2018-11-14 18:27:10,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 22 treesize of output 16 [2018-11-14 18:27:10,443 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2018-11-14 18:27:11,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 29 [2018-11-14 18:27:11,271 INFO L267 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 3 xjuncts. [2018-11-14 18:27:11,448 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:27:11,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-11-14 18:27:11,450 INFO L267 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2018-11-14 18:27:11,594 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 13 treesize of output 7 [2018-11-14 18:27:11,599 INFO L267 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2018-11-14 18:27:11,776 INFO L267 ElimStorePlain]: Start of recursive call 116: 17 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-14 18:27:11,844 INFO L267 ElimStorePlain]: Start of recursive call 114: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-14 18:27:11,867 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:27:11,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 55 [2018-11-14 18:27:11,897 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 18 treesize of output 16 [2018-11-14 18:27:11,899 INFO L267 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2018-11-14 18:27:11,955 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:27:11,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 42 [2018-11-14 18:27:11,994 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:27:12,001 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:27:12,031 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 43 [2018-11-14 18:27:12,040 INFO L267 ElimStorePlain]: Start of recursive call 136: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-14 18:27:12,118 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 28 treesize of output 22 [2018-11-14 18:27:12,119 INFO L267 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2018-11-14 18:27:12,156 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:27:12,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-11-14 18:27:12,158 INFO L267 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2018-11-14 18:27:12,183 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 22 treesize of output 16 [2018-11-14 18:27:12,185 INFO L267 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts.