java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/list-simple/sll2c_prepend_unequal_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:32:22,175 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:32:22,177 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:32:22,189 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:32:22,189 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:32:22,190 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:32:22,192 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:32:22,193 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:32:22,195 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:32:22,196 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:32:22,197 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:32:22,197 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:32:22,198 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:32:22,199 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:32:22,200 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:32:22,201 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:32:22,202 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:32:22,203 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:32:22,205 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:32:22,207 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:32:22,208 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:32:22,209 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:32:22,212 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:32:22,212 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:32:22,212 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:32:22,213 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:32:22,214 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:32:22,215 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:32:22,216 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:32:22,217 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:32:22,217 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:32:22,218 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:32:22,218 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:32:22,218 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:32:22,219 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:32:22,220 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:32:22,220 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-14 16:32:22,246 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:32:22,246 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:32:22,247 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:32:22,247 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:32:22,248 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:32:22,248 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:32:22,249 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:32:22,249 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:32:22,249 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:32:22,249 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:32:22,249 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:32:22,250 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:32:22,250 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:32:22,250 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:32:22,250 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:32:22,250 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:32:22,250 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:32:22,254 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:32:22,254 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:32:22,255 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:32:22,255 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:32:22,255 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:32:22,255 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:32:22,255 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:32:22,256 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:32:22,256 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:32:22,256 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:32:22,257 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:32:22,257 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:32:22,257 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:32:22,257 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:32:22,257 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:32:22,303 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:32:22,316 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:32:22,320 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:32:22,322 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:32:22,322 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:32:22,323 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_prepend_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-14 16:32:22,389 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca494307a/a411220e4f6a419083b87c97344b8ebf/FLAG01183dc82 [2018-11-14 16:32:22,883 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:32:22,884 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_prepend_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-14 16:32:22,898 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca494307a/a411220e4f6a419083b87c97344b8ebf/FLAG01183dc82 [2018-11-14 16:32:22,912 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca494307a/a411220e4f6a419083b87c97344b8ebf [2018-11-14 16:32:22,923 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:32:22,924 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:32:22,926 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:32:22,926 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:32:22,930 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:32:22,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:32:22" (1/1) ... [2018-11-14 16:32:22,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19b4ce90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:32:22, skipping insertion in model container [2018-11-14 16:32:22,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:32:22" (1/1) ... [2018-11-14 16:32:22,945 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:32:22,993 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:32:23,469 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:32:23,488 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:32:23,564 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:32:23,724 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:32:23,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:32:23 WrapperNode [2018-11-14 16:32:23,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:32:23,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:32:23,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:32:23,727 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:32:23,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:32:23" (1/1) ... [2018-11-14 16:32:23,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:32:23" (1/1) ... [2018-11-14 16:32:23,778 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:32:23" (1/1) ... [2018-11-14 16:32:23,781 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:32:23" (1/1) ... [2018-11-14 16:32:23,834 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:32:23" (1/1) ... [2018-11-14 16:32:23,840 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:32:23" (1/1) ... [2018-11-14 16:32:23,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:32:23" (1/1) ... [2018-11-14 16:32:23,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:32:23,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:32:23,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:32:23,864 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:32:23,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:32:23" (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 16:32:23,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:32:23,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:32:23,932 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 16:32:23,932 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 16:32:23,933 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-14 16:32:23,933 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-14 16:32:23,933 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2018-11-14 16:32:23,933 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2018-11-14 16:32:23,933 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_prepend [2018-11-14 16:32:23,934 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:32:23,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:32:23,934 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 16:32:23,934 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 16:32:23,934 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 16:32:23,935 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 16:32:23,935 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 16:32:23,935 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 16:32:23,935 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 16:32:23,935 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 16:32:23,936 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 16:32:23,936 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 16:32:23,936 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 16:32:23,936 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 16:32:23,936 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 16:32:23,936 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 16:32:23,937 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 16:32:23,937 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 16:32:23,937 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 16:32:23,937 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 16:32:23,937 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 16:32:23,938 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 16:32:23,938 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 16:32:23,938 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 16:32:23,938 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 16:32:23,938 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 16:32:23,939 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 16:32:23,939 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 16:32:23,939 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 16:32:23,939 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 16:32:23,939 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 16:32:23,939 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 16:32:23,940 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 16:32:23,940 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 16:32:23,940 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 16:32:23,940 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 16:32:23,940 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 16:32:23,940 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 16:32:23,941 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 16:32:23,941 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 16:32:23,941 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 16:32:23,941 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 16:32:23,941 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 16:32:23,941 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 16:32:23,942 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 16:32:23,942 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 16:32:23,942 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 16:32:23,942 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 16:32:23,942 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 16:32:23,943 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 16:32:23,943 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 16:32:23,943 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 16:32:23,943 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 16:32:23,943 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 16:32:23,943 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 16:32:23,944 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 16:32:23,944 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 16:32:23,944 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 16:32:23,944 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 16:32:23,944 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 16:32:23,944 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 16:32:23,945 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 16:32:23,945 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 16:32:23,945 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 16:32:23,945 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 16:32:23,945 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 16:32:23,946 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 16:32:23,946 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 16:32:23,946 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 16:32:23,946 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 16:32:23,946 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 16:32:23,946 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 16:32:23,947 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 16:32:23,947 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 16:32:23,947 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 16:32:23,947 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 16:32:23,947 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 16:32:23,948 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 16:32:23,948 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 16:32:23,948 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 16:32:23,948 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 16:32:23,948 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 16:32:23,948 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 16:32:23,949 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 16:32:23,949 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 16:32:23,949 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 16:32:23,949 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 16:32:23,949 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 16:32:23,949 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 16:32:23,950 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 16:32:23,950 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 16:32:23,950 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 16:32:23,950 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 16:32:23,950 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 16:32:23,950 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 16:32:23,951 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 16:32:23,951 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 16:32:23,951 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 16:32:23,951 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 16:32:23,951 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 16:32:23,951 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 16:32:23,952 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 16:32:23,952 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 16:32:23,952 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 16:32:23,952 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 16:32:23,952 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 16:32:23,952 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 16:32:23,953 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-14 16:32:23,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:32:23,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 16:32:23,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 16:32:23,953 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2018-11-14 16:32:23,954 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2018-11-14 16:32:23,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 16:32:23,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:32:23,954 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_prepend [2018-11-14 16:32:23,954 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:32:23,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 16:32:23,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:32:23,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:32:23,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 16:32:25,189 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:32:25,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:32:25 BoogieIcfgContainer [2018-11-14 16:32:25,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:32:25,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:32:25,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:32:25,195 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:32:25,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:32:22" (1/3) ... [2018-11-14 16:32:25,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb301a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:32:25, skipping insertion in model container [2018-11-14 16:32:25,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:32:23" (2/3) ... [2018-11-14 16:32:25,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb301a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:32:25, skipping insertion in model container [2018-11-14 16:32:25,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:32:25" (3/3) ... [2018-11-14 16:32:25,199 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-14 16:32:25,208 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:32:25,217 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:32:25,234 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:32:25,266 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:32:25,267 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:32:25,268 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:32:25,268 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:32:25,268 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:32:25,268 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:32:25,268 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:32:25,269 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:32:25,269 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:32:25,287 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-11-14 16:32:25,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 16:32:25,295 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:32:25,296 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:32:25,298 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:32:25,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:32:25,304 INFO L82 PathProgramCache]: Analyzing trace with hash -579085372, now seen corresponding path program 1 times [2018-11-14 16:32:25,308 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:32:25,309 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 16:32:25,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:32:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:32:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:32:25,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:32:25,754 INFO L256 TraceCheckUtils]: 0: Hoare triple {62#true} call ULTIMATE.init(); {62#true} is VALID [2018-11-14 16:32:25,758 INFO L273 TraceCheckUtils]: 1: Hoare triple {62#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {62#true} is VALID [2018-11-14 16:32:25,759 INFO L273 TraceCheckUtils]: 2: Hoare triple {62#true} assume true; {62#true} is VALID [2018-11-14 16:32:25,759 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {62#true} {62#true} #144#return; {62#true} is VALID [2018-11-14 16:32:25,760 INFO L256 TraceCheckUtils]: 4: Hoare triple {62#true} call #t~ret24 := main(); {62#true} is VALID [2018-11-14 16:32:25,760 INFO L273 TraceCheckUtils]: 5: Hoare triple {62#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {62#true} is VALID [2018-11-14 16:32:25,760 INFO L256 TraceCheckUtils]: 6: Hoare triple {62#true} call #t~ret15.base, #t~ret15.offset := sll_circular_create(~len~0, ~data~0); {62#true} is VALID [2018-11-14 16:32:25,761 INFO L273 TraceCheckUtils]: 7: Hoare triple {62#true} ~len := #in~len;~data := #in~data; {62#true} is VALID [2018-11-14 16:32:25,761 INFO L256 TraceCheckUtils]: 8: Hoare triple {62#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {62#true} is VALID [2018-11-14 16:32:25,761 INFO L273 TraceCheckUtils]: 9: Hoare triple {62#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {62#true} is VALID [2018-11-14 16:32:25,762 INFO L273 TraceCheckUtils]: 10: Hoare triple {62#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {62#true} is VALID [2018-11-14 16:32:25,762 INFO L273 TraceCheckUtils]: 11: Hoare triple {62#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {62#true} is VALID [2018-11-14 16:32:25,763 INFO L273 TraceCheckUtils]: 12: Hoare triple {62#true} assume true; {62#true} is VALID [2018-11-14 16:32:25,763 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {62#true} {62#true} #138#return; {62#true} is VALID [2018-11-14 16:32:25,763 INFO L273 TraceCheckUtils]: 14: Hoare triple {62#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {62#true} is VALID [2018-11-14 16:32:25,778 INFO L273 TraceCheckUtils]: 15: Hoare triple {62#true} assume !true; {63#false} is VALID [2018-11-14 16:32:25,779 INFO L273 TraceCheckUtils]: 16: Hoare triple {63#false} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {63#false} is VALID [2018-11-14 16:32:25,779 INFO L273 TraceCheckUtils]: 17: Hoare triple {63#false} assume true; {63#false} is VALID [2018-11-14 16:32:25,779 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {63#false} {62#true} #132#return; {63#false} is VALID [2018-11-14 16:32:25,780 INFO L273 TraceCheckUtils]: 19: Hoare triple {63#false} call write~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret15.base, #t~ret15.offset;~uneq~0 := 5bv32; {63#false} is VALID [2018-11-14 16:32:25,780 INFO L256 TraceCheckUtils]: 20: Hoare triple {63#false} call sll_circular_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {63#false} is VALID [2018-11-14 16:32:25,780 INFO L273 TraceCheckUtils]: 21: Hoare triple {63#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {63#false} is VALID [2018-11-14 16:32:25,781 INFO L256 TraceCheckUtils]: 22: Hoare triple {63#false} call #t~ret8.base, #t~ret8.offset := node_create(~data); {63#false} is VALID [2018-11-14 16:32:25,781 INFO L273 TraceCheckUtils]: 23: Hoare triple {63#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {63#false} is VALID [2018-11-14 16:32:25,781 INFO L273 TraceCheckUtils]: 24: Hoare triple {63#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {63#false} is VALID [2018-11-14 16:32:25,782 INFO L273 TraceCheckUtils]: 25: Hoare triple {63#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {63#false} is VALID [2018-11-14 16:32:25,782 INFO L273 TraceCheckUtils]: 26: Hoare triple {63#false} assume true; {63#false} is VALID [2018-11-14 16:32:25,782 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {63#false} {63#false} #142#return; {63#false} is VALID [2018-11-14 16:32:25,783 INFO L273 TraceCheckUtils]: 28: Hoare triple {63#false} ~new_head~1.base, ~new_head~1.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {63#false} is VALID [2018-11-14 16:32:25,783 INFO L273 TraceCheckUtils]: 29: Hoare triple {63#false} assume 0bv32 == #t~mem9.base && 0bv32 == #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~new_head~1.base, ~new_head~1.offset, 4bv32); {63#false} is VALID [2018-11-14 16:32:25,784 INFO L273 TraceCheckUtils]: 30: Hoare triple {63#false} assume true; {63#false} is VALID [2018-11-14 16:32:25,784 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {63#false} {63#false} #134#return; {63#false} is VALID [2018-11-14 16:32:25,784 INFO L273 TraceCheckUtils]: 32: Hoare triple {63#false} call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset;call #t~mem17 := read~intINTTYPE4(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {63#false} is VALID [2018-11-14 16:32:25,785 INFO L273 TraceCheckUtils]: 33: Hoare triple {63#false} assume ~uneq~0 != #t~mem17;havoc #t~mem17; {63#false} is VALID [2018-11-14 16:32:25,785 INFO L273 TraceCheckUtils]: 34: Hoare triple {63#false} assume !false; {63#false} is VALID [2018-11-14 16:32:25,793 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:32:25,794 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:32:25,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:32:25,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:32:25,806 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 35 [2018-11-14 16:32:25,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:32:25,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:32:26,115 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:32:26,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:32:26,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:32:26,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:32:26,126 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 2 states. [2018-11-14 16:32:26,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:32:26,464 INFO L93 Difference]: Finished difference Result 104 states and 130 transitions. [2018-11-14 16:32:26,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:32:26,465 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 35 [2018-11-14 16:32:26,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:32:26,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:32:26,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 130 transitions. [2018-11-14 16:32:26,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:32:26,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 130 transitions. [2018-11-14 16:32:26,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 130 transitions. [2018-11-14 16:32:27,040 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:32:27,055 INFO L225 Difference]: With dead ends: 104 [2018-11-14 16:32:27,055 INFO L226 Difference]: Without dead ends: 43 [2018-11-14 16:32:27,059 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 34 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 16:32:27,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-14 16:32:27,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-14 16:32:27,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:32:27,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2018-11-14 16:32:27,110 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-14 16:32:27,110 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-14 16:32:27,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:32:27,117 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-11-14 16:32:27,117 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2018-11-14 16:32:27,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:32:27,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:32:27,119 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-14 16:32:27,119 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-14 16:32:27,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:32:27,124 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-11-14 16:32:27,124 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2018-11-14 16:32:27,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:32:27,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:32:27,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:32:27,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:32:27,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-14 16:32:27,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2018-11-14 16:32:27,132 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 35 [2018-11-14 16:32:27,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:32:27,133 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-11-14 16:32:27,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:32:27,133 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2018-11-14 16:32:27,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 16:32:27,135 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:32:27,135 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:32:27,135 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:32:27,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:32:27,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1636852463, now seen corresponding path program 1 times [2018-11-14 16:32:27,137 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:32:27,137 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 16:32:27,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:32:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:32:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:32:27,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:32:27,477 INFO L256 TraceCheckUtils]: 0: Hoare triple {450#true} call ULTIMATE.init(); {450#true} is VALID [2018-11-14 16:32:27,478 INFO L273 TraceCheckUtils]: 1: Hoare triple {450#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {450#true} is VALID [2018-11-14 16:32:27,478 INFO L273 TraceCheckUtils]: 2: Hoare triple {450#true} assume true; {450#true} is VALID [2018-11-14 16:32:27,478 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {450#true} {450#true} #144#return; {450#true} is VALID [2018-11-14 16:32:27,479 INFO L256 TraceCheckUtils]: 4: Hoare triple {450#true} call #t~ret24 := main(); {450#true} is VALID [2018-11-14 16:32:27,479 INFO L273 TraceCheckUtils]: 5: Hoare triple {450#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {470#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:32:27,480 INFO L256 TraceCheckUtils]: 6: Hoare triple {470#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret15.base, #t~ret15.offset := sll_circular_create(~len~0, ~data~0); {450#true} is VALID [2018-11-14 16:32:27,487 INFO L273 TraceCheckUtils]: 7: Hoare triple {450#true} ~len := #in~len;~data := #in~data; {477#(= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-14 16:32:27,487 INFO L256 TraceCheckUtils]: 8: Hoare triple {477#(= |sll_circular_create_#in~len| sll_circular_create_~len)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {450#true} is VALID [2018-11-14 16:32:27,487 INFO L273 TraceCheckUtils]: 9: Hoare triple {450#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {450#true} is VALID [2018-11-14 16:32:27,488 INFO L273 TraceCheckUtils]: 10: Hoare triple {450#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {450#true} is VALID [2018-11-14 16:32:27,488 INFO L273 TraceCheckUtils]: 11: Hoare triple {450#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {450#true} is VALID [2018-11-14 16:32:27,488 INFO L273 TraceCheckUtils]: 12: Hoare triple {450#true} assume true; {450#true} is VALID [2018-11-14 16:32:27,489 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {450#true} {477#(= |sll_circular_create_#in~len| sll_circular_create_~len)} #138#return; {477#(= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-14 16:32:27,491 INFO L273 TraceCheckUtils]: 14: Hoare triple {477#(= |sll_circular_create_#in~len| sll_circular_create_~len)} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {477#(= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-14 16:32:27,496 INFO L273 TraceCheckUtils]: 15: Hoare triple {477#(= |sll_circular_create_#in~len| sll_circular_create_~len)} assume true; {477#(= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-14 16:32:27,497 INFO L273 TraceCheckUtils]: 16: Hoare triple {477#(= |sll_circular_create_#in~len| sll_circular_create_~len)} assume !~bvsgt32(~len, 1bv32); {505#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-14 16:32:27,498 INFO L273 TraceCheckUtils]: 17: Hoare triple {505#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {505#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-14 16:32:27,498 INFO L273 TraceCheckUtils]: 18: Hoare triple {505#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} assume true; {505#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-14 16:32:27,499 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {505#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} {470#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #132#return; {451#false} is VALID [2018-11-14 16:32:27,500 INFO L273 TraceCheckUtils]: 20: Hoare triple {451#false} call write~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret15.base, #t~ret15.offset;~uneq~0 := 5bv32; {451#false} is VALID [2018-11-14 16:32:27,500 INFO L256 TraceCheckUtils]: 21: Hoare triple {451#false} call sll_circular_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {451#false} is VALID [2018-11-14 16:32:27,500 INFO L273 TraceCheckUtils]: 22: Hoare triple {451#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {451#false} is VALID [2018-11-14 16:32:27,500 INFO L256 TraceCheckUtils]: 23: Hoare triple {451#false} call #t~ret8.base, #t~ret8.offset := node_create(~data); {451#false} is VALID [2018-11-14 16:32:27,501 INFO L273 TraceCheckUtils]: 24: Hoare triple {451#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {451#false} is VALID [2018-11-14 16:32:27,501 INFO L273 TraceCheckUtils]: 25: Hoare triple {451#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {451#false} is VALID [2018-11-14 16:32:27,501 INFO L273 TraceCheckUtils]: 26: Hoare triple {451#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {451#false} is VALID [2018-11-14 16:32:27,502 INFO L273 TraceCheckUtils]: 27: Hoare triple {451#false} assume true; {451#false} is VALID [2018-11-14 16:32:27,502 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {451#false} {451#false} #142#return; {451#false} is VALID [2018-11-14 16:32:27,502 INFO L273 TraceCheckUtils]: 29: Hoare triple {451#false} ~new_head~1.base, ~new_head~1.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {451#false} is VALID [2018-11-14 16:32:27,503 INFO L273 TraceCheckUtils]: 30: Hoare triple {451#false} assume 0bv32 == #t~mem9.base && 0bv32 == #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~new_head~1.base, ~new_head~1.offset, 4bv32); {451#false} is VALID [2018-11-14 16:32:27,503 INFO L273 TraceCheckUtils]: 31: Hoare triple {451#false} assume true; {451#false} is VALID [2018-11-14 16:32:27,503 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {451#false} {451#false} #134#return; {451#false} is VALID [2018-11-14 16:32:27,503 INFO L273 TraceCheckUtils]: 33: Hoare triple {451#false} call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset;call #t~mem17 := read~intINTTYPE4(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {451#false} is VALID [2018-11-14 16:32:27,504 INFO L273 TraceCheckUtils]: 34: Hoare triple {451#false} assume ~uneq~0 != #t~mem17;havoc #t~mem17; {451#false} is VALID [2018-11-14 16:32:27,504 INFO L273 TraceCheckUtils]: 35: Hoare triple {451#false} assume !false; {451#false} is VALID [2018-11-14 16:32:27,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:32:27,507 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:32:27,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:32:27,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:32:27,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-11-14 16:32:27,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:32:27,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:32:27,627 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:32:27,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:32:27,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:32:27,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:32:27,628 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 5 states. [2018-11-14 16:32:28,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:32:28,436 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2018-11-14 16:32:28,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:32:28,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-11-14 16:32:28,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:32:28,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:32:28,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2018-11-14 16:32:28,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:32:28,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2018-11-14 16:32:28,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 89 transitions. [2018-11-14 16:32:28,613 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:32:28,619 INFO L225 Difference]: With dead ends: 76 [2018-11-14 16:32:28,619 INFO L226 Difference]: Without dead ends: 47 [2018-11-14 16:32:28,620 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:32:28,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-14 16:32:28,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-11-14 16:32:28,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:32:28,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 45 states. [2018-11-14 16:32:28,656 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 45 states. [2018-11-14 16:32:28,656 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 45 states. [2018-11-14 16:32:28,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:32:28,661 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2018-11-14 16:32:28,661 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-14 16:32:28,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:32:28,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:32:28,663 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 47 states. [2018-11-14 16:32:28,663 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 47 states. [2018-11-14 16:32:28,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:32:28,667 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2018-11-14 16:32:28,667 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-14 16:32:28,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:32:28,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:32:28,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:32:28,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:32:28,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-14 16:32:28,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2018-11-14 16:32:28,672 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 36 [2018-11-14 16:32:28,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:32:28,672 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2018-11-14 16:32:28,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:32:28,672 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-11-14 16:32:28,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 16:32:28,674 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:32:28,674 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-14 16:32:28,674 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:32:28,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:32:28,675 INFO L82 PathProgramCache]: Analyzing trace with hash 609633090, now seen corresponding path program 1 times [2018-11-14 16:32:28,675 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:32:28,675 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 16:32:28,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:32:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:32:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:32:28,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:32:29,088 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 16:32:29,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 16:32:29,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:32:29,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:32:29,130 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 16:32:29,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-11-14 16:32:29,139 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:32:29,491 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 13 treesize of output 10 [2018-11-14 16:32:29,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-14 16:32:29,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:32:29,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:32:29,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:32:29,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-14 16:32:30,020 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 27 treesize of output 20 [2018-11-14 16:32:30,050 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 16:32:30,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:32:30,295 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 19 treesize of output 31 [2018-11-14 16:32:30,323 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 20 treesize of output 19 [2018-11-14 16:32:30,330 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:32:30,578 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:32:30,651 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 16:32:30,796 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 16:32:30,796 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:109, output treesize:96 [2018-11-14 16:32:32,898 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:32:33,458 WARN L179 SmtUtils]: Spent 366.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-14 16:32:33,950 WARN L179 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2018-11-14 16:32:33,963 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:32:33,964 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 68 treesize of output 51 [2018-11-14 16:32:34,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-11-14 16:32:34,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:32:34,114 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 0 case distinctions, treesize of input 35 treesize of output 28 [2018-11-14 16:32:34,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 14 treesize of output 11 [2018-11-14 16:32:34,130 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:32:34,153 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:32:34,155 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 19 treesize of output 19 [2018-11-14 16:32:34,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-11-14 16:32:34,178 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 16:32:34,185 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:32:34,189 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:32:34,194 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 16:32:34,222 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 16:32:34,222 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:112, output treesize:30 [2018-11-14 16:32:36,318 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:32:36,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-11-14 16:32:36,451 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:32:36,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-14 16:32:36,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:32:36,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:32:36,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-14 16:32:36,483 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:32:36,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-14 16:32:36,503 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 5 treesize of output 1 [2018-11-14 16:32:36,505 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 16:32:36,506 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:32:36,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:32:36,531 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:44, output treesize:9 [2018-11-14 16:32:36,540 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:32:36,607 INFO L256 TraceCheckUtils]: 0: Hoare triple {821#true} call ULTIMATE.init(); {821#true} is VALID [2018-11-14 16:32:36,608 INFO L273 TraceCheckUtils]: 1: Hoare triple {821#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {821#true} is VALID [2018-11-14 16:32:36,608 INFO L273 TraceCheckUtils]: 2: Hoare triple {821#true} assume true; {821#true} is VALID [2018-11-14 16:32:36,608 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {821#true} {821#true} #144#return; {821#true} is VALID [2018-11-14 16:32:36,608 INFO L256 TraceCheckUtils]: 4: Hoare triple {821#true} call #t~ret24 := main(); {821#true} is VALID [2018-11-14 16:32:36,609 INFO L273 TraceCheckUtils]: 5: Hoare triple {821#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {841#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-14 16:32:36,609 INFO L256 TraceCheckUtils]: 6: Hoare triple {841#(= |main_~#s~0.offset| (_ bv0 32))} call #t~ret15.base, #t~ret15.offset := sll_circular_create(~len~0, ~data~0); {821#true} is VALID [2018-11-14 16:32:36,609 INFO L273 TraceCheckUtils]: 7: Hoare triple {821#true} ~len := #in~len;~data := #in~data; {821#true} is VALID [2018-11-14 16:32:36,609 INFO L256 TraceCheckUtils]: 8: Hoare triple {821#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {821#true} is VALID [2018-11-14 16:32:36,610 INFO L273 TraceCheckUtils]: 9: Hoare triple {821#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {821#true} is VALID [2018-11-14 16:32:36,610 INFO L273 TraceCheckUtils]: 10: Hoare triple {821#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {821#true} is VALID [2018-11-14 16:32:36,610 INFO L273 TraceCheckUtils]: 11: Hoare triple {821#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {821#true} is VALID [2018-11-14 16:32:36,611 INFO L273 TraceCheckUtils]: 12: Hoare triple {821#true} assume true; {821#true} is VALID [2018-11-14 16:32:36,611 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {821#true} {821#true} #138#return; {821#true} is VALID [2018-11-14 16:32:36,611 INFO L273 TraceCheckUtils]: 14: Hoare triple {821#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {821#true} is VALID [2018-11-14 16:32:36,612 INFO L273 TraceCheckUtils]: 15: Hoare triple {821#true} assume true; {821#true} is VALID [2018-11-14 16:32:36,612 INFO L273 TraceCheckUtils]: 16: Hoare triple {821#true} assume !!~bvsgt32(~len, 1bv32); {821#true} is VALID [2018-11-14 16:32:36,612 INFO L256 TraceCheckUtils]: 17: Hoare triple {821#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {821#true} is VALID [2018-11-14 16:32:36,617 INFO L273 TraceCheckUtils]: 18: Hoare triple {821#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {881#(not (= (_ bv0 32) node_create_~temp~0.base))} is VALID [2018-11-14 16:32:36,618 INFO L273 TraceCheckUtils]: 19: Hoare triple {881#(not (= (_ bv0 32) node_create_~temp~0.base))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {881#(not (= (_ bv0 32) node_create_~temp~0.base))} is VALID [2018-11-14 16:32:36,618 INFO L273 TraceCheckUtils]: 20: Hoare triple {881#(not (= (_ bv0 32) node_create_~temp~0.base))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {888#(not (= (_ bv0 32) |node_create_#res.base|))} is VALID [2018-11-14 16:32:36,619 INFO L273 TraceCheckUtils]: 21: Hoare triple {888#(not (= (_ bv0 32) |node_create_#res.base|))} assume true; {888#(not (= (_ bv0 32) |node_create_#res.base|))} is VALID [2018-11-14 16:32:36,639 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {888#(not (= (_ bv0 32) |node_create_#res.base|))} {821#true} #140#return; {895#(not (= (_ bv0 32) |sll_circular_create_#t~ret4.base|))} is VALID [2018-11-14 16:32:36,654 INFO L273 TraceCheckUtils]: 23: Hoare triple {895#(not (= (_ bv0 32) |sll_circular_create_#t~ret4.base|))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;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~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {899#(not (= sll_circular_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:32:36,669 INFO L273 TraceCheckUtils]: 24: Hoare triple {899#(not (= sll_circular_create_~head~0.base (_ bv0 32)))} assume true; {899#(not (= sll_circular_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:32:36,677 INFO L273 TraceCheckUtils]: 25: Hoare triple {899#(not (= sll_circular_create_~head~0.base (_ bv0 32)))} assume !~bvsgt32(~len, 1bv32); {899#(not (= sll_circular_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:32:36,678 INFO L273 TraceCheckUtils]: 26: Hoare triple {899#(not (= sll_circular_create_~head~0.base (_ bv0 32)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {909#(not (= (_ bv0 32) |sll_circular_create_#res.base|))} is VALID [2018-11-14 16:32:36,679 INFO L273 TraceCheckUtils]: 27: Hoare triple {909#(not (= (_ bv0 32) |sll_circular_create_#res.base|))} assume true; {909#(not (= (_ bv0 32) |sll_circular_create_#res.base|))} is VALID [2018-11-14 16:32:36,680 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {909#(not (= (_ bv0 32) |sll_circular_create_#res.base|))} {841#(= |main_~#s~0.offset| (_ bv0 32))} #132#return; {916#(and (not (= (_ bv0 32) |main_#t~ret15.base|)) (= |main_~#s~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:32:36,682 INFO L273 TraceCheckUtils]: 29: Hoare triple {916#(and (not (= (_ bv0 32) |main_#t~ret15.base|)) (= |main_~#s~0.offset| (_ bv0 32)))} call write~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret15.base, #t~ret15.offset;~uneq~0 := 5bv32; {920#(and (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-14 16:32:36,683 INFO L256 TraceCheckUtils]: 30: Hoare triple {920#(and (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call sll_circular_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {924#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} is VALID [2018-11-14 16:32:36,683 INFO L273 TraceCheckUtils]: 31: Hoare triple {924#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {928#(and (= |sll_circular_prepend_#in~data| sll_circular_prepend_~data) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} is VALID [2018-11-14 16:32:36,690 INFO L256 TraceCheckUtils]: 32: Hoare triple {928#(and (= |sll_circular_prepend_#in~data| sll_circular_prepend_~data) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} call #t~ret8.base, #t~ret8.offset := node_create(~data); {924#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} is VALID [2018-11-14 16:32:36,691 INFO L273 TraceCheckUtils]: 33: Hoare triple {924#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {935#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-14 16:32:36,695 INFO L273 TraceCheckUtils]: 34: Hoare triple {935#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {935#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-14 16:32:36,696 INFO L273 TraceCheckUtils]: 35: Hoare triple {935#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {942#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) |node_create_#res.offset| (_ bv0 32)))) (= (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32))) |node_create_#in~data|) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-14 16:32:36,697 INFO L273 TraceCheckUtils]: 36: Hoare triple {942#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) |node_create_#res.offset| (_ bv0 32)))) (= (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32))) |node_create_#in~data|) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {942#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) |node_create_#res.offset| (_ bv0 32)))) (= (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32))) |node_create_#in~data|) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-14 16:32:36,700 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {942#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) |node_create_#res.offset| (_ bv0 32)))) (= (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32))) |node_create_#in~data|) (= |node_create_#res.offset| (_ bv0 32)))} {928#(and (= |sll_circular_prepend_#in~data| sll_circular_prepend_~data) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} #142#return; {949#(and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| |sll_circular_prepend_#t~ret8.base|) (bvadd |sll_circular_prepend_#t~ret8.offset| (_ bv4 32)))) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= (_ bv0 32) |sll_circular_prepend_#t~ret8.offset|) (= (store |old(#memory_$Pointer$.base)| |sll_circular_prepend_#t~ret8.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_prepend_#t~ret8.base|) |sll_circular_prepend_#t~ret8.offset| (_ bv0 32))) |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} is VALID [2018-11-14 16:32:36,701 INFO L273 TraceCheckUtils]: 38: Hoare triple {949#(and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| |sll_circular_prepend_#t~ret8.base|) (bvadd |sll_circular_prepend_#t~ret8.offset| (_ bv4 32)))) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= (_ bv0 32) |sll_circular_prepend_#t~ret8.offset|) (= (store |old(#memory_$Pointer$.base)| |sll_circular_prepend_#t~ret8.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_prepend_#t~ret8.base|) |sll_circular_prepend_#t~ret8.offset| (_ bv0 32))) |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} ~new_head~1.base, ~new_head~1.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {953#(and (= (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) sll_circular_prepend_~new_head~1.offset (_ bv0 32))) |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~data| (select (select |#memory_int| sll_circular_prepend_~new_head~1.base) (bvadd sll_circular_prepend_~new_head~1.offset (_ bv4 32)))) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= (_ bv0 32) sll_circular_prepend_~new_head~1.offset) (= (select (select |#memory_$Pointer$.base| sll_circular_prepend_~head.base) sll_circular_prepend_~head.offset) |sll_circular_prepend_#t~mem9.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} is VALID [2018-11-14 16:32:36,707 INFO L273 TraceCheckUtils]: 39: Hoare triple {953#(and (= (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) sll_circular_prepend_~new_head~1.offset (_ bv0 32))) |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~data| (select (select |#memory_int| sll_circular_prepend_~new_head~1.base) (bvadd sll_circular_prepend_~new_head~1.offset (_ bv4 32)))) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= (_ bv0 32) sll_circular_prepend_~new_head~1.offset) (= (select (select |#memory_$Pointer$.base| sll_circular_prepend_~head.base) sll_circular_prepend_~head.offset) |sll_circular_prepend_#t~mem9.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} assume 0bv32 == #t~mem9.base && 0bv32 == #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~new_head~1.base, ~new_head~1.offset, 4bv32); {957#(and (exists ((sll_circular_prepend_~new_head~1.base (_ BitVec 32))) (and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| sll_circular_prepend_~new_head~1.base) (_ bv4 32))) (= (store (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base (store (select (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base) (_ bv0 32) sll_circular_prepend_~new_head~1.base)) |#memory_$Pointer$.base|) (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_prepend_~new_head~1.base) (_ bv0 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)))} is VALID [2018-11-14 16:32:36,709 INFO L273 TraceCheckUtils]: 40: Hoare triple {957#(and (exists ((sll_circular_prepend_~new_head~1.base (_ BitVec 32))) (and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| sll_circular_prepend_~new_head~1.base) (_ bv4 32))) (= (store (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base (store (select (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base) (_ bv0 32) sll_circular_prepend_~new_head~1.base)) |#memory_$Pointer$.base|) (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_prepend_~new_head~1.base) (_ bv0 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)))} assume true; {957#(and (exists ((sll_circular_prepend_~new_head~1.base (_ BitVec 32))) (and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| sll_circular_prepend_~new_head~1.base) (_ bv4 32))) (= (store (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base (store (select (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base) (_ bv0 32) sll_circular_prepend_~new_head~1.base)) |#memory_$Pointer$.base|) (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_prepend_~new_head~1.base) (_ bv0 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)))} is VALID [2018-11-14 16:32:36,712 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {957#(and (exists ((sll_circular_prepend_~new_head~1.base (_ BitVec 32))) (and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| sll_circular_prepend_~new_head~1.base) (_ bv4 32))) (= (store (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base (store (select (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base) (_ bv0 32) sll_circular_prepend_~new_head~1.base)) |#memory_$Pointer$.base|) (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_prepend_~new_head~1.base) (_ bv0 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)))} {920#(and (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} #134#return; {964#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) (_ bv0 32))) (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= main_~uneq~0 (select (select |#memory_int| |main_~#s~0.base|) (_ bv4 32))) (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-14 16:32:36,714 INFO L273 TraceCheckUtils]: 42: Hoare triple {964#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) (_ bv0 32))) (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= main_~uneq~0 (select (select |#memory_int| |main_~#s~0.base|) (_ bv4 32))) (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset;call #t~mem17 := read~intINTTYPE4(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {968#(and (= |main_#t~mem17| main_~uneq~0) (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-14 16:32:36,714 INFO L273 TraceCheckUtils]: 43: Hoare triple {968#(and (= |main_#t~mem17| main_~uneq~0) (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)))} assume ~uneq~0 != #t~mem17;havoc #t~mem17; {822#false} is VALID [2018-11-14 16:32:36,714 INFO L273 TraceCheckUtils]: 44: Hoare triple {822#false} assume !false; {822#false} is VALID [2018-11-14 16:32:36,723 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-14 16:32:36,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:32:37,219 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-14 16:32:37,323 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-14 16:32:38,799 WARN L179 SmtUtils]: Spent 1.46 s on a formula simplification that was a NOOP. DAG size: 71 [2018-11-14 16:32:39,614 WARN L179 SmtUtils]: Spent 804.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-14 16:32:40,768 WARN L179 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 54 [2018-11-14 16:32:41,788 WARN L179 SmtUtils]: Spent 1.00 s on a formula simplification that was a NOOP. DAG size: 52 [2018-11-14 16:32:46,329 WARN L833 TransFormulaUtils]: predicate-based correctness check returned UNKNOWN, hence correctness of interprocedural sequential composition was not checked. [2018-11-14 16:32:46,424 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-14 16:32:46,425 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 3 variables, input treesize:122, output treesize:1 [2018-11-14 16:32:49,107 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 65 treesize of output 59 [2018-11-14 16:32:49,375 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-14 16:32:49,383 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 9 treesize of output 8 [2018-11-14 16:32:49,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:32:49,481 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 17 treesize of output 15 [2018-11-14 16:32:49,490 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 16:32:49,491 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:32:49,510 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:32:49,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 54 [2018-11-14 16:32:49,567 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 16:32:49,571 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 16:32:49,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2018-11-14 16:32:49,646 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:32:49,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 46 [2018-11-14 16:32:49,757 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-14 16:32:49,838 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-14 16:32:49,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-11-14 16:32:50,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-11-14 16:32:50,210 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 1 variables, input treesize:70, output treesize:235 [2018-11-14 16:32:50,330 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:32:59,072 WARN L179 SmtUtils]: Spent 8.42 s on a formula simplification that was a NOOP. DAG size: 56 [2018-11-14 16:33:08,131 WARN L179 SmtUtils]: Spent 8.36 s on a formula simplification that was a NOOP. DAG size: 56 [2018-11-14 16:33:08,389 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-14 16:33:08,495 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-14 16:33:11,869 WARN L179 SmtUtils]: Spent 2.83 s on a formula simplification that was a NOOP. DAG size: 152 [2018-11-14 16:33:11,905 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 95 treesize of output 33 [2018-11-14 16:33:11,914 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 7 treesize of output 3 [2018-11-14 16:33:11,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:11,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:11,949 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 155 treesize of output 93 [2018-11-14 16:33:11,959 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 7 treesize of output 3 [2018-11-14 16:33:11,961 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:11,999 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:12,007 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 95 treesize of output 33 [2018-11-14 16:33:12,014 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 7 treesize of output 3 [2018-11-14 16:33:12,016 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:12,041 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:16,384 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 155 treesize of output 93 [2018-11-14 16:33:16,426 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 7 treesize of output 3 [2018-11-14 16:33:16,450 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:16,488 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:16,496 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 95 treesize of output 33 [2018-11-14 16:33:16,504 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 7 treesize of output 3 [2018-11-14 16:33:16,507 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:16,526 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:21,423 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 95 treesize of output 33 [2018-11-14 16:33:21,445 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 7 treesize of output 3 [2018-11-14 16:33:21,447 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:21,466 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:21,479 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 155 treesize of output 93 [2018-11-14 16:33:21,494 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 7 treesize of output 3 [2018-11-14 16:33:21,501 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:21,568 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:25,587 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 155 treesize of output 93 [2018-11-14 16:33:25,632 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 7 treesize of output 3 [2018-11-14 16:33:25,662 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:25,729 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:25,738 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 95 treesize of output 33 [2018-11-14 16:33:25,747 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 7 treesize of output 3 [2018-11-14 16:33:25,749 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:25,770 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:28,614 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 147 treesize of output 85 [2018-11-14 16:33:28,622 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 5 treesize of output 3 [2018-11-14 16:33:28,641 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:28,669 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:31,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 5 dim-2 vars, End of recursive call: 14 dim-0 vars, and 14 xjuncts. [2018-11-14 16:33:31,447 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 14 variables, input treesize:493, output treesize:635 [2018-11-14 16:33:33,873 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:33:35,488 WARN L179 SmtUtils]: Spent 688.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 44 [2018-11-14 16:33:35,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:33:35,506 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:33:35,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:33:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:33:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:33:35,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:33:35,923 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 13 treesize of output 10 [2018-11-14 16:33:35,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-14 16:33:35,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:35,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:35,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:35,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-14 16:33:36,339 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 27 treesize of output 20 [2018-11-14 16:33:36,352 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 16:33:36,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:36,530 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 19 treesize of output 31 [2018-11-14 16:33:36,582 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 20 treesize of output 19 [2018-11-14 16:33:36,587 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:36,710 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:36,751 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 16:33:36,832 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 27 treesize of output 20 [2018-11-14 16:33:36,838 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 16:33:36,840 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:36,913 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 19 treesize of output 31 [2018-11-14 16:33:36,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 18 [2018-11-14 16:33:36,939 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:37,009 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 16 treesize of output 15 [2018-11-14 16:33:37,011 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:37,032 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:37,046 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:37,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:37,070 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:62, output treesize:45 [2018-11-14 16:33:44,468 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:33:46,980 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 29 treesize of output 17 [2018-11-14 16:33:46,989 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:33:46,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-14 16:33:46,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:47,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:47,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2018-11-14 16:33:47,045 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:47,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2018-11-14 16:33:47,081 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:47,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:47,085 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:62, output treesize:3 [2018-11-14 16:33:47,094 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:33:47,095 INFO L256 TraceCheckUtils]: 0: Hoare triple {821#true} call ULTIMATE.init(); {821#true} is VALID [2018-11-14 16:33:47,095 INFO L273 TraceCheckUtils]: 1: Hoare triple {821#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {821#true} is VALID [2018-11-14 16:33:47,096 INFO L273 TraceCheckUtils]: 2: Hoare triple {821#true} assume true; {821#true} is VALID [2018-11-14 16:33:47,096 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {821#true} {821#true} #144#return; {821#true} is VALID [2018-11-14 16:33:47,096 INFO L256 TraceCheckUtils]: 4: Hoare triple {821#true} call #t~ret24 := main(); {821#true} is VALID [2018-11-14 16:33:47,113 INFO L273 TraceCheckUtils]: 5: Hoare triple {821#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {841#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-14 16:33:47,113 INFO L256 TraceCheckUtils]: 6: Hoare triple {841#(= |main_~#s~0.offset| (_ bv0 32))} call #t~ret15.base, #t~ret15.offset := sll_circular_create(~len~0, ~data~0); {821#true} is VALID [2018-11-14 16:33:47,113 INFO L273 TraceCheckUtils]: 7: Hoare triple {821#true} ~len := #in~len;~data := #in~data; {821#true} is VALID [2018-11-14 16:33:47,114 INFO L256 TraceCheckUtils]: 8: Hoare triple {821#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {821#true} is VALID [2018-11-14 16:33:47,114 INFO L273 TraceCheckUtils]: 9: Hoare triple {821#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {821#true} is VALID [2018-11-14 16:33:47,114 INFO L273 TraceCheckUtils]: 10: Hoare triple {821#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {821#true} is VALID [2018-11-14 16:33:47,114 INFO L273 TraceCheckUtils]: 11: Hoare triple {821#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {821#true} is VALID [2018-11-14 16:33:47,114 INFO L273 TraceCheckUtils]: 12: Hoare triple {821#true} assume true; {821#true} is VALID [2018-11-14 16:33:47,115 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {821#true} {821#true} #138#return; {821#true} is VALID [2018-11-14 16:33:47,115 INFO L273 TraceCheckUtils]: 14: Hoare triple {821#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {821#true} is VALID [2018-11-14 16:33:47,115 INFO L273 TraceCheckUtils]: 15: Hoare triple {821#true} assume true; {821#true} is VALID [2018-11-14 16:33:47,115 INFO L273 TraceCheckUtils]: 16: Hoare triple {821#true} assume !!~bvsgt32(~len, 1bv32); {821#true} is VALID [2018-11-14 16:33:47,116 INFO L256 TraceCheckUtils]: 17: Hoare triple {821#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {821#true} is VALID [2018-11-14 16:33:47,116 INFO L273 TraceCheckUtils]: 18: Hoare triple {821#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {821#true} is VALID [2018-11-14 16:33:47,116 INFO L273 TraceCheckUtils]: 19: Hoare triple {821#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {821#true} is VALID [2018-11-14 16:33:47,116 INFO L273 TraceCheckUtils]: 20: Hoare triple {821#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {821#true} is VALID [2018-11-14 16:33:47,116 INFO L273 TraceCheckUtils]: 21: Hoare triple {821#true} assume true; {821#true} is VALID [2018-11-14 16:33:47,117 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {821#true} {821#true} #140#return; {821#true} is VALID [2018-11-14 16:33:47,117 INFO L273 TraceCheckUtils]: 23: Hoare triple {821#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;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~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {821#true} is VALID [2018-11-14 16:33:47,117 INFO L273 TraceCheckUtils]: 24: Hoare triple {821#true} assume true; {821#true} is VALID [2018-11-14 16:33:47,117 INFO L273 TraceCheckUtils]: 25: Hoare triple {821#true} assume !~bvsgt32(~len, 1bv32); {821#true} is VALID [2018-11-14 16:33:47,118 INFO L273 TraceCheckUtils]: 26: Hoare triple {821#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {821#true} is VALID [2018-11-14 16:33:47,118 INFO L273 TraceCheckUtils]: 27: Hoare triple {821#true} assume true; {821#true} is VALID [2018-11-14 16:33:47,121 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {821#true} {841#(= |main_~#s~0.offset| (_ bv0 32))} #132#return; {841#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-14 16:33:47,123 INFO L273 TraceCheckUtils]: 29: Hoare triple {841#(= |main_~#s~0.offset| (_ bv0 32))} call write~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret15.base, #t~ret15.offset;~uneq~0 := 5bv32; {841#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-14 16:33:47,123 INFO L256 TraceCheckUtils]: 30: Hoare triple {841#(= |main_~#s~0.offset| (_ bv0 32))} call sll_circular_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {821#true} is VALID [2018-11-14 16:33:47,124 INFO L273 TraceCheckUtils]: 31: Hoare triple {821#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1101#(and (= |sll_circular_prepend_#in~data| sll_circular_prepend_~data) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} is VALID [2018-11-14 16:33:47,124 INFO L256 TraceCheckUtils]: 32: Hoare triple {1101#(and (= |sll_circular_prepend_#in~data| sll_circular_prepend_~data) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} call #t~ret8.base, #t~ret8.offset := node_create(~data); {821#true} is VALID [2018-11-14 16:33:47,125 INFO L273 TraceCheckUtils]: 33: Hoare triple {821#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1108#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:33:47,127 INFO L273 TraceCheckUtils]: 34: Hoare triple {1108#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1108#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:33:47,130 INFO L273 TraceCheckUtils]: 35: Hoare triple {1108#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1115#(and (= (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32))) |node_create_#in~data|) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-14 16:33:47,132 INFO L273 TraceCheckUtils]: 36: Hoare triple {1115#(and (= (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32))) |node_create_#in~data|) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {1115#(and (= (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32))) |node_create_#in~data|) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-14 16:33:47,133 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1115#(and (= (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32))) |node_create_#in~data|) (= |node_create_#res.offset| (_ bv0 32)))} {1101#(and (= |sll_circular_prepend_#in~data| sll_circular_prepend_~data) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} #142#return; {1122#(and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| |sll_circular_prepend_#t~ret8.base|) (_ bv4 32))) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= (_ bv0 32) |sll_circular_prepend_#t~ret8.offset|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} is VALID [2018-11-14 16:33:47,135 INFO L273 TraceCheckUtils]: 38: Hoare triple {1122#(and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| |sll_circular_prepend_#t~ret8.base|) (_ bv4 32))) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= (_ bv0 32) |sll_circular_prepend_#t~ret8.offset|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} ~new_head~1.base, ~new_head~1.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1126#(and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| sll_circular_prepend_~new_head~1.base) (_ bv4 32))) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= (_ bv0 32) sll_circular_prepend_~new_head~1.offset) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} is VALID [2018-11-14 16:33:47,139 INFO L273 TraceCheckUtils]: 39: Hoare triple {1126#(and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| sll_circular_prepend_~new_head~1.base) (_ bv4 32))) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= (_ bv0 32) sll_circular_prepend_~new_head~1.offset) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} assume 0bv32 == #t~mem9.base && 0bv32 == #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~new_head~1.base, ~new_head~1.offset, 4bv32); {1130#(and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)))} is VALID [2018-11-14 16:33:47,142 INFO L273 TraceCheckUtils]: 40: Hoare triple {1130#(and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)))} assume true; {1130#(and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)))} is VALID [2018-11-14 16:33:47,144 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {1130#(and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)))} {841#(= |main_~#s~0.offset| (_ bv0 32))} #134#return; {1137#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= main_~uneq~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))))} is VALID [2018-11-14 16:33:47,146 INFO L273 TraceCheckUtils]: 42: Hoare triple {1137#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= main_~uneq~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))))} call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset;call #t~mem17 := read~intINTTYPE4(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {978#(= |main_#t~mem17| main_~uneq~0)} is VALID [2018-11-14 16:33:47,148 INFO L273 TraceCheckUtils]: 43: Hoare triple {978#(= |main_#t~mem17| main_~uneq~0)} assume ~uneq~0 != #t~mem17;havoc #t~mem17; {822#false} is VALID [2018-11-14 16:33:47,148 INFO L273 TraceCheckUtils]: 44: Hoare triple {822#false} assume !false; {822#false} is VALID [2018-11-14 16:33:47,152 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-14 16:33:47,153 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:33:47,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 16:33:47,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [19] total 27 [2018-11-14 16:33:47,185 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 45 [2018-11-14 16:33:47,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:33:47,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-14 16:33:47,348 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:33:47,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-14 16:33:47,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-14 16:33:47,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=906, Unknown=1, NotChecked=0, Total=992 [2018-11-14 16:33:47,350 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 27 states. [2018-11-14 16:33:53,806 WARN L179 SmtUtils]: Spent 2.20 s on a formula simplification that was a NOOP. DAG size: 42 [2018-11-14 16:33:58,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:33:58,137 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2018-11-14 16:33:58,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 16:33:58,137 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 45 [2018-11-14 16:33:58,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:33:58,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 16:33:58,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 69 transitions. [2018-11-14 16:33:58,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 16:33:58,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 69 transitions. [2018-11-14 16:33:58,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 69 transitions. [2018-11-14 16:33:58,279 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:33:58,282 INFO L225 Difference]: With dead ends: 60 [2018-11-14 16:33:58,282 INFO L226 Difference]: Without dead ends: 58 [2018-11-14 16:33:58,283 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 26.7s TimeCoverageRelationStatistics Valid=149, Invalid=1572, Unknown=1, NotChecked=0, Total=1722 [2018-11-14 16:33:58,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-14 16:33:58,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2018-11-14 16:33:58,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:33:58,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 49 states. [2018-11-14 16:33:58,340 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 49 states. [2018-11-14 16:33:58,340 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 49 states. [2018-11-14 16:33:58,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:33:58,344 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-11-14 16:33:58,345 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2018-11-14 16:33:58,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:33:58,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:33:58,346 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 58 states. [2018-11-14 16:33:58,346 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 58 states. [2018-11-14 16:33:58,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:33:58,349 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-11-14 16:33:58,350 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2018-11-14 16:33:58,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:33:58,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:33:58,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:33:58,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:33:58,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-14 16:33:58,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-11-14 16:33:58,354 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 45 [2018-11-14 16:33:58,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:33:58,354 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-11-14 16:33:58,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-14 16:33:58,354 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-11-14 16:33:58,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-14 16:33:58,356 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:33:58,356 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-14 16:33:58,356 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:33:58,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:33:58,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1741885821, now seen corresponding path program 1 times [2018-11-14 16:33:58,357 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:33:58,357 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 16:33:58,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:33:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:33:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:33:58,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:33:58,670 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 16:33:58,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:58,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:58,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-14 16:33:58,682 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:34:00,825 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_circular_create_~head~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| sll_circular_create_~head~0.base)) (= |c_#valid| (store |c_old(#valid)| sll_circular_create_~head~0.base (_ bv1 1))))) is different from true [2018-11-14 16:34:02,968 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-14 16:34:05,021 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-14 16:34:07,201 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-14 16:34:07,231 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:34:07,233 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:34:07,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-14 16:34:07,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-14 16:34:07,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:07,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:07,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:34:07,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:27