java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-ext3-properties/sll_length_check_false-unreach-call_false-valid-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:28:23,499 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:28:23,502 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:28:23,518 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:28:23,518 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:28:23,520 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:28:23,522 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:28:23,525 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:28:23,527 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:28:23,528 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:28:23,536 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:28:23,537 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:28:23,538 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:28:23,541 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:28:23,544 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:28:23,545 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:28:23,546 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:28:23,550 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:28:23,551 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:28:23,553 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:28:23,554 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:28:23,555 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:28:23,557 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:28:23,557 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:28:23,558 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:28:23,558 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:28:23,559 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:28:23,560 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:28:23,561 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:28:23,562 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:28:23,562 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:28:23,563 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:28:23,563 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:28:23,563 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:28:23,564 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:28:23,565 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:28:23,565 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:28:23,588 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:28:23,589 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:28:23,592 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:28:23,592 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:28:23,594 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:28:23,594 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:28:23,594 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:28:23,594 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:28:23,595 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:28:23,595 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:28:23,595 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:28:23,595 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:28:23,595 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:28:23,596 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:28:23,596 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:28:23,596 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:28:23,596 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:28:23,596 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:28:23,597 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:28:23,597 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:28:23,597 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:28:23,597 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:28:23,597 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:28:23,597 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:28:23,598 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:28:23,598 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:28:23,598 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:28:23,598 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:28:23,598 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:28:23,599 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:28:23,658 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:28:23,673 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:28:23,676 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:28:23,678 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:28:23,678 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:28:23,679 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/sll_length_check_false-unreach-call_false-valid-memcleanup.i [2018-11-14 17:28:23,740 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5c6b8579/3d224c890fb74491b7645f2dc7cd2101/FLAG790a6773b [2018-11-14 17:28:24,240 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:28:24,241 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_length_check_false-unreach-call_false-valid-memcleanup.i [2018-11-14 17:28:24,254 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5c6b8579/3d224c890fb74491b7645f2dc7cd2101/FLAG790a6773b [2018-11-14 17:28:24,273 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5c6b8579/3d224c890fb74491b7645f2dc7cd2101 [2018-11-14 17:28:24,283 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:28:24,284 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:28:24,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:28:24,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:28:24,290 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:28:24,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:28:24" (1/1) ... [2018-11-14 17:28:24,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@602d4844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:28:24, skipping insertion in model container [2018-11-14 17:28:24,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:28:24" (1/1) ... [2018-11-14 17:28:24,305 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:28:24,352 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:28:24,743 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:28:24,752 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:28:24,820 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:28:24,884 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:28:24,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:28:24 WrapperNode [2018-11-14 17:28:24,885 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:28:24,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:28:24,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:28:24,886 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:28:24,975 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:28:24" (1/1) ... [2018-11-14 17:28:24,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:28:24" (1/1) ... [2018-11-14 17:28:24,994 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:28:24" (1/1) ... [2018-11-14 17:28:24,995 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:28:24" (1/1) ... [2018-11-14 17:28:25,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:28:24" (1/1) ... [2018-11-14 17:28:25,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:28:24" (1/1) ... [2018-11-14 17:28:25,038 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:28:24" (1/1) ... [2018-11-14 17:28:25,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:28:25,054 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:28:25,054 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:28:25,054 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:28:25,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:28:24" (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 17:28:25,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:28:25,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:28:25,123 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 17:28:25,123 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 17:28:25,123 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-14 17:28:25,123 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-14 17:28:25,123 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_length [2018-11-14 17:28:25,123 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-14 17:28:25,124 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:28:25,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:28:25,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:28:25,124 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 17:28:25,124 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 17:28:25,124 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 17:28:25,124 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 17:28:25,125 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 17:28:25,125 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 17:28:25,125 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 17:28:25,125 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 17:28:25,125 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 17:28:25,126 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 17:28:25,126 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 17:28:25,126 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 17:28:25,126 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 17:28:25,126 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 17:28:25,126 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 17:28:25,127 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 17:28:25,127 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 17:28:25,127 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 17:28:25,127 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 17:28:25,127 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 17:28:25,127 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 17:28:25,127 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 17:28:25,128 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 17:28:25,128 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 17:28:25,128 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 17:28:25,128 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 17:28:25,128 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 17:28:25,128 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 17:28:25,128 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 17:28:25,129 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 17:28:25,129 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 17:28:25,129 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 17:28:25,129 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 17:28:25,129 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 17:28:25,129 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 17:28:25,129 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 17:28:25,130 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 17:28:25,130 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 17:28:25,130 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 17:28:25,130 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 17:28:25,130 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 17:28:25,130 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 17:28:25,130 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 17:28:25,131 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 17:28:25,131 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 17:28:25,131 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 17:28:25,131 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 17:28:25,131 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 17:28:25,131 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 17:28:25,132 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 17:28:25,132 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 17:28:25,132 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 17:28:25,132 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 17:28:25,132 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 17:28:25,132 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 17:28:25,132 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 17:28:25,133 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 17:28:25,133 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 17:28:25,133 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 17:28:25,133 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 17:28:25,133 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 17:28:25,134 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 17:28:25,134 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 17:28:25,134 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 17:28:25,134 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 17:28:25,134 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 17:28:25,134 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 17:28:25,134 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 17:28:25,135 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 17:28:25,135 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 17:28:25,135 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 17:28:25,135 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 17:28:25,135 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 17:28:25,135 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 17:28:25,135 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 17:28:25,136 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 17:28:25,136 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 17:28:25,136 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 17:28:25,136 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 17:28:25,136 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 17:28:25,136 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 17:28:25,136 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 17:28:25,137 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 17:28:25,137 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 17:28:25,137 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 17:28:25,137 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 17:28:25,137 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 17:28:25,137 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 17:28:25,138 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 17:28:25,138 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 17:28:25,138 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 17:28:25,138 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 17:28:25,138 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 17:28:25,139 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 17:28:25,139 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 17:28:25,139 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 17:28:25,139 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 17:28:25,139 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 17:28:25,139 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 17:28:25,140 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 17:28:25,140 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 17:28:25,140 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 17:28:25,140 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 17:28:25,140 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 17:28:25,140 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 17:28:25,140 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-14 17:28:25,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:28:25,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 17:28:25,141 INFO L130 BoogieDeclarations]: Found specification of procedure sll_length [2018-11-14 17:28:25,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 17:28:25,141 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-14 17:28:25,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:28:25,142 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:28:25,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:28:25,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:28:26,014 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:28:26,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:28:26 BoogieIcfgContainer [2018-11-14 17:28:26,015 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:28:26,016 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:28:26,017 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:28:26,020 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:28:26,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:28:24" (1/3) ... [2018-11-14 17:28:26,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ab33cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:28:26, skipping insertion in model container [2018-11-14 17:28:26,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:28:24" (2/3) ... [2018-11-14 17:28:26,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ab33cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:28:26, skipping insertion in model container [2018-11-14 17:28:26,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:28:26" (3/3) ... [2018-11-14 17:28:26,024 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_length_check_false-unreach-call_false-valid-memcleanup.i [2018-11-14 17:28:26,034 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:28:26,042 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:28:26,060 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:28:26,093 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:28:26,094 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:28:26,094 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:28:26,094 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:28:26,094 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:28:26,095 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:28:26,095 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:28:26,095 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:28:26,095 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:28:26,116 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-11-14 17:28:26,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 17:28:26,123 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:28:26,124 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:28:26,127 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:28:26,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:28:26,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1270338, now seen corresponding path program 1 times [2018-11-14 17:28:26,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:28:26,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:28:26,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:26,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:28:26,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:28:26,349 INFO L256 TraceCheckUtils]: 0: Hoare triple {48#true} call ULTIMATE.init(); {48#true} is VALID [2018-11-14 17:28:26,353 INFO L273 TraceCheckUtils]: 1: Hoare triple {48#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {48#true} is VALID [2018-11-14 17:28:26,353 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#true} assume true; {48#true} is VALID [2018-11-14 17:28:26,354 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {48#true} {48#true} #112#return; {48#true} is VALID [2018-11-14 17:28:26,354 INFO L256 TraceCheckUtils]: 4: Hoare triple {48#true} call #t~ret12 := main(); {48#true} is VALID [2018-11-14 17:28:26,354 INFO L273 TraceCheckUtils]: 5: Hoare triple {48#true} ~len~1 := 2; {48#true} is VALID [2018-11-14 17:28:26,355 INFO L273 TraceCheckUtils]: 6: Hoare triple {48#true} assume !true; {49#false} is VALID [2018-11-14 17:28:26,356 INFO L256 TraceCheckUtils]: 7: Hoare triple {49#false} call #t~ret10.base, #t~ret10.offset := sll_create(~len~1 + 1); {48#true} is VALID [2018-11-14 17:28:26,356 INFO L273 TraceCheckUtils]: 8: Hoare triple {48#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {48#true} is VALID [2018-11-14 17:28:26,356 INFO L273 TraceCheckUtils]: 9: Hoare triple {48#true} assume !true; {48#true} is VALID [2018-11-14 17:28:26,357 INFO L273 TraceCheckUtils]: 10: Hoare triple {48#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {48#true} is VALID [2018-11-14 17:28:26,357 INFO L273 TraceCheckUtils]: 11: Hoare triple {48#true} assume true; {48#true} is VALID [2018-11-14 17:28:26,357 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {48#true} {49#false} #106#return; {49#false} is VALID [2018-11-14 17:28:26,358 INFO L273 TraceCheckUtils]: 13: Hoare triple {49#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset; {49#false} is VALID [2018-11-14 17:28:26,358 INFO L256 TraceCheckUtils]: 14: Hoare triple {49#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {48#true} is VALID [2018-11-14 17:28:26,359 INFO L273 TraceCheckUtils]: 15: Hoare triple {48#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {48#true} is VALID [2018-11-14 17:28:26,359 INFO L273 TraceCheckUtils]: 16: Hoare triple {48#true} assume !true; {48#true} is VALID [2018-11-14 17:28:26,359 INFO L273 TraceCheckUtils]: 17: Hoare triple {48#true} #res := ~len~0; {48#true} is VALID [2018-11-14 17:28:26,360 INFO L273 TraceCheckUtils]: 18: Hoare triple {48#true} assume true; {48#true} is VALID [2018-11-14 17:28:26,360 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {48#true} {49#false} #108#return; {49#false} is VALID [2018-11-14 17:28:26,360 INFO L273 TraceCheckUtils]: 20: Hoare triple {49#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {49#false} is VALID [2018-11-14 17:28:26,361 INFO L273 TraceCheckUtils]: 21: Hoare triple {49#false} assume ~len~1 != #t~ret11;havoc #t~ret11; {49#false} is VALID [2018-11-14 17:28:26,361 INFO L273 TraceCheckUtils]: 22: Hoare triple {49#false} assume !false; {49#false} is VALID [2018-11-14 17:28:26,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:28:26,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:28:26,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:28:26,375 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-11-14 17:28:26,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:28:26,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:28:26,625 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:28:26,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:28:26,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:28:26,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:28:26,635 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-11-14 17:28:27,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:27,056 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2018-11-14 17:28:27,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:28:27,056 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-11-14 17:28:27,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:28:27,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:28:27,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 98 transitions. [2018-11-14 17:28:27,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:28:27,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 98 transitions. [2018-11-14 17:28:27,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 98 transitions. [2018-11-14 17:28:27,550 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:28:27,563 INFO L225 Difference]: With dead ends: 80 [2018-11-14 17:28:27,563 INFO L226 Difference]: Without dead ends: 31 [2018-11-14 17:28:27,567 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:28:27,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-14 17:28:27,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-14 17:28:27,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:28:27,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-14 17:28:27,623 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-14 17:28:27,624 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-14 17:28:27,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:27,629 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-14 17:28:27,629 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-14 17:28:27,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:28:27,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:28:27,630 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-14 17:28:27,630 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-14 17:28:27,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:27,635 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-14 17:28:27,635 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-14 17:28:27,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:28:27,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:28:27,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:28:27,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:28:27,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:28:27,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-11-14 17:28:27,642 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 23 [2018-11-14 17:28:27,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:28:27,642 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-14 17:28:27,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:28:27,642 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-14 17:28:27,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 17:28:27,644 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:28:27,644 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:28:27,644 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:28:27,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:28:27,645 INFO L82 PathProgramCache]: Analyzing trace with hash 256070974, now seen corresponding path program 1 times [2018-11-14 17:28:27,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:28:27,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:28:27,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:27,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:28:27,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:28:27,844 INFO L256 TraceCheckUtils]: 0: Hoare triple {266#true} call ULTIMATE.init(); {266#true} is VALID [2018-11-14 17:28:27,845 INFO L273 TraceCheckUtils]: 1: Hoare triple {266#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {266#true} is VALID [2018-11-14 17:28:27,845 INFO L273 TraceCheckUtils]: 2: Hoare triple {266#true} assume true; {266#true} is VALID [2018-11-14 17:28:27,846 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {266#true} {266#true} #112#return; {266#true} is VALID [2018-11-14 17:28:27,846 INFO L256 TraceCheckUtils]: 4: Hoare triple {266#true} call #t~ret12 := main(); {266#true} is VALID [2018-11-14 17:28:27,847 INFO L273 TraceCheckUtils]: 5: Hoare triple {266#true} ~len~1 := 2; {268#(<= 2 main_~len~1)} is VALID [2018-11-14 17:28:27,848 INFO L273 TraceCheckUtils]: 6: Hoare triple {268#(<= 2 main_~len~1)} assume true; {268#(<= 2 main_~len~1)} is VALID [2018-11-14 17:28:27,848 INFO L273 TraceCheckUtils]: 7: Hoare triple {268#(<= 2 main_~len~1)} #t~short8 := ~len~1 < 32; {268#(<= 2 main_~len~1)} is VALID [2018-11-14 17:28:27,849 INFO L273 TraceCheckUtils]: 8: Hoare triple {268#(<= 2 main_~len~1)} assume #t~short8;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;#t~short8 := #t~nondet7 != 0; {268#(<= 2 main_~len~1)} is VALID [2018-11-14 17:28:27,850 INFO L273 TraceCheckUtils]: 9: Hoare triple {268#(<= 2 main_~len~1)} assume !#t~short8;havoc #t~short8;havoc #t~nondet7; {268#(<= 2 main_~len~1)} is VALID [2018-11-14 17:28:27,850 INFO L256 TraceCheckUtils]: 10: Hoare triple {268#(<= 2 main_~len~1)} call #t~ret10.base, #t~ret10.offset := sll_create(~len~1 + 1); {266#true} is VALID [2018-11-14 17:28:27,852 INFO L273 TraceCheckUtils]: 11: Hoare triple {266#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {269#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 17:28:27,853 INFO L273 TraceCheckUtils]: 12: Hoare triple {269#(<= |sll_create_#in~len| sll_create_~len)} assume true; {269#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 17:28:27,855 INFO L273 TraceCheckUtils]: 13: Hoare triple {269#(<= |sll_create_#in~len| sll_create_~len)} assume !(~len > 0); {270#(<= |sll_create_#in~len| 0)} is VALID [2018-11-14 17:28:27,855 INFO L273 TraceCheckUtils]: 14: Hoare triple {270#(<= |sll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {270#(<= |sll_create_#in~len| 0)} is VALID [2018-11-14 17:28:27,856 INFO L273 TraceCheckUtils]: 15: Hoare triple {270#(<= |sll_create_#in~len| 0)} assume true; {270#(<= |sll_create_#in~len| 0)} is VALID [2018-11-14 17:28:27,857 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {270#(<= |sll_create_#in~len| 0)} {268#(<= 2 main_~len~1)} #106#return; {267#false} is VALID [2018-11-14 17:28:27,858 INFO L273 TraceCheckUtils]: 17: Hoare triple {267#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset; {267#false} is VALID [2018-11-14 17:28:27,858 INFO L256 TraceCheckUtils]: 18: Hoare triple {267#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {266#true} is VALID [2018-11-14 17:28:27,858 INFO L273 TraceCheckUtils]: 19: Hoare triple {266#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {266#true} is VALID [2018-11-14 17:28:27,858 INFO L273 TraceCheckUtils]: 20: Hoare triple {266#true} assume true; {266#true} is VALID [2018-11-14 17:28:27,859 INFO L273 TraceCheckUtils]: 21: Hoare triple {266#true} assume !(~head.base != 0 || ~head.offset != 0); {266#true} is VALID [2018-11-14 17:28:27,859 INFO L273 TraceCheckUtils]: 22: Hoare triple {266#true} #res := ~len~0; {266#true} is VALID [2018-11-14 17:28:27,859 INFO L273 TraceCheckUtils]: 23: Hoare triple {266#true} assume true; {266#true} is VALID [2018-11-14 17:28:27,860 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {266#true} {267#false} #108#return; {267#false} is VALID [2018-11-14 17:28:27,860 INFO L273 TraceCheckUtils]: 25: Hoare triple {267#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {267#false} is VALID [2018-11-14 17:28:27,860 INFO L273 TraceCheckUtils]: 26: Hoare triple {267#false} assume ~len~1 != #t~ret11;havoc #t~ret11; {267#false} is VALID [2018-11-14 17:28:27,861 INFO L273 TraceCheckUtils]: 27: Hoare triple {267#false} assume !false; {267#false} is VALID [2018-11-14 17:28:27,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:28:27,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:28:27,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:28:27,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-14 17:28:27,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:28:27,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:28:27,950 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:28:27,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:28:27,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:28:27,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:28:27,952 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 5 states. [2018-11-14 17:28:28,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:28,431 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-14 17:28:28,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:28:28,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-14 17:28:28,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:28:28,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:28:28,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2018-11-14 17:28:28,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:28:28,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2018-11-14 17:28:28,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 54 transitions. [2018-11-14 17:28:28,556 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:28:28,559 INFO L225 Difference]: With dead ends: 50 [2018-11-14 17:28:28,559 INFO L226 Difference]: Without dead ends: 35 [2018-11-14 17:28:28,560 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 17:28:28,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-14 17:28:28,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-14 17:28:28,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:28:28,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 33 states. [2018-11-14 17:28:28,582 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 33 states. [2018-11-14 17:28:28,582 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 33 states. [2018-11-14 17:28:28,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:28,585 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-14 17:28:28,586 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-14 17:28:28,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:28:28,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:28:28,587 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 35 states. [2018-11-14 17:28:28,587 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 35 states. [2018-11-14 17:28:28,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:28,590 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-14 17:28:28,591 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-14 17:28:28,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:28:28,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:28:28,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:28:28,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:28:28,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 17:28:28,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-14 17:28:28,594 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 28 [2018-11-14 17:28:28,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:28:28,595 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-14 17:28:28,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:28:28,595 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-14 17:28:28,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 17:28:28,596 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:28:28,597 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:28:28,597 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:28:28,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:28:28,597 INFO L82 PathProgramCache]: Analyzing trace with hash -36569594, now seen corresponding path program 1 times [2018-11-14 17:28:28,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:28:28,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:28:28,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:28,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:28:28,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:28:28,880 INFO L256 TraceCheckUtils]: 0: Hoare triple {458#true} call ULTIMATE.init(); {458#true} is VALID [2018-11-14 17:28:28,880 INFO L273 TraceCheckUtils]: 1: Hoare triple {458#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {458#true} is VALID [2018-11-14 17:28:28,881 INFO L273 TraceCheckUtils]: 2: Hoare triple {458#true} assume true; {458#true} is VALID [2018-11-14 17:28:28,881 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {458#true} {458#true} #112#return; {458#true} is VALID [2018-11-14 17:28:28,882 INFO L256 TraceCheckUtils]: 4: Hoare triple {458#true} call #t~ret12 := main(); {458#true} is VALID [2018-11-14 17:28:28,882 INFO L273 TraceCheckUtils]: 5: Hoare triple {458#true} ~len~1 := 2; {458#true} is VALID [2018-11-14 17:28:28,882 INFO L273 TraceCheckUtils]: 6: Hoare triple {458#true} assume true; {458#true} is VALID [2018-11-14 17:28:28,883 INFO L273 TraceCheckUtils]: 7: Hoare triple {458#true} #t~short8 := ~len~1 < 32; {458#true} is VALID [2018-11-14 17:28:28,883 INFO L273 TraceCheckUtils]: 8: Hoare triple {458#true} assume #t~short8;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;#t~short8 := #t~nondet7 != 0; {458#true} is VALID [2018-11-14 17:28:28,883 INFO L273 TraceCheckUtils]: 9: Hoare triple {458#true} assume !#t~short8;havoc #t~short8;havoc #t~nondet7; {458#true} is VALID [2018-11-14 17:28:28,884 INFO L256 TraceCheckUtils]: 10: Hoare triple {458#true} call #t~ret10.base, #t~ret10.offset := sll_create(~len~1 + 1); {458#true} is VALID [2018-11-14 17:28:28,884 INFO L273 TraceCheckUtils]: 11: Hoare triple {458#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {458#true} is VALID [2018-11-14 17:28:28,884 INFO L273 TraceCheckUtils]: 12: Hoare triple {458#true} assume true; {458#true} is VALID [2018-11-14 17:28:28,895 INFO L273 TraceCheckUtils]: 13: Hoare triple {458#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {460#(not (= 0 sll_create_~new_head~0.base))} is VALID [2018-11-14 17:28:28,897 INFO L273 TraceCheckUtils]: 14: Hoare triple {460#(not (= 0 sll_create_~new_head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {460#(not (= 0 sll_create_~new_head~0.base))} is VALID [2018-11-14 17:28:28,898 INFO L273 TraceCheckUtils]: 15: Hoare triple {460#(not (= 0 sll_create_~new_head~0.base))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 0, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {461#(not (= 0 sll_create_~head~0.base))} is VALID [2018-11-14 17:28:28,898 INFO L273 TraceCheckUtils]: 16: Hoare triple {461#(not (= 0 sll_create_~head~0.base))} assume true; {461#(not (= 0 sll_create_~head~0.base))} is VALID [2018-11-14 17:28:28,899 INFO L273 TraceCheckUtils]: 17: Hoare triple {461#(not (= 0 sll_create_~head~0.base))} assume !(~len > 0); {461#(not (= 0 sll_create_~head~0.base))} is VALID [2018-11-14 17:28:28,899 INFO L273 TraceCheckUtils]: 18: Hoare triple {461#(not (= 0 sll_create_~head~0.base))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {462#(not (= 0 |sll_create_#res.base|))} is VALID [2018-11-14 17:28:28,900 INFO L273 TraceCheckUtils]: 19: Hoare triple {462#(not (= 0 |sll_create_#res.base|))} assume true; {462#(not (= 0 |sll_create_#res.base|))} is VALID [2018-11-14 17:28:28,901 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {462#(not (= 0 |sll_create_#res.base|))} {458#true} #106#return; {463#(not (= 0 |main_#t~ret10.base|))} is VALID [2018-11-14 17:28:28,905 INFO L273 TraceCheckUtils]: 21: Hoare triple {463#(not (= 0 |main_#t~ret10.base|))} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset; {464#(not (= 0 main_~s~0.base))} is VALID [2018-11-14 17:28:28,905 INFO L256 TraceCheckUtils]: 22: Hoare triple {464#(not (= 0 main_~s~0.base))} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {458#true} is VALID [2018-11-14 17:28:28,906 INFO L273 TraceCheckUtils]: 23: Hoare triple {458#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {465#(= |sll_length_#in~head.base| sll_length_~head.base)} is VALID [2018-11-14 17:28:28,907 INFO L273 TraceCheckUtils]: 24: Hoare triple {465#(= |sll_length_#in~head.base| sll_length_~head.base)} assume true; {465#(= |sll_length_#in~head.base| sll_length_~head.base)} is VALID [2018-11-14 17:28:28,910 INFO L273 TraceCheckUtils]: 25: Hoare triple {465#(= |sll_length_#in~head.base| sll_length_~head.base)} assume !(~head.base != 0 || ~head.offset != 0); {466#(= 0 |sll_length_#in~head.base|)} is VALID [2018-11-14 17:28:28,911 INFO L273 TraceCheckUtils]: 26: Hoare triple {466#(= 0 |sll_length_#in~head.base|)} #res := ~len~0; {466#(= 0 |sll_length_#in~head.base|)} is VALID [2018-11-14 17:28:28,912 INFO L273 TraceCheckUtils]: 27: Hoare triple {466#(= 0 |sll_length_#in~head.base|)} assume true; {466#(= 0 |sll_length_#in~head.base|)} is VALID [2018-11-14 17:28:28,913 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {466#(= 0 |sll_length_#in~head.base|)} {464#(not (= 0 main_~s~0.base))} #108#return; {459#false} is VALID [2018-11-14 17:28:28,914 INFO L273 TraceCheckUtils]: 29: Hoare triple {459#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {459#false} is VALID [2018-11-14 17:28:28,914 INFO L273 TraceCheckUtils]: 30: Hoare triple {459#false} assume ~len~1 != #t~ret11;havoc #t~ret11; {459#false} is VALID [2018-11-14 17:28:28,914 INFO L273 TraceCheckUtils]: 31: Hoare triple {459#false} assume !false; {459#false} is VALID [2018-11-14 17:28:28,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:28:28,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:28:28,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-14 17:28:28,919 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-14 17:28:28,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:28:28,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 17:28:28,970 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:28:28,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 17:28:28,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 17:28:28,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:28:28,972 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 9 states. [2018-11-14 17:28:29,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:29,568 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-11-14 17:28:29,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 17:28:29,569 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-14 17:28:29,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:28:29,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:28:29,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 47 transitions. [2018-11-14 17:28:29,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:28:29,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 47 transitions. [2018-11-14 17:28:29,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 47 transitions. [2018-11-14 17:28:29,642 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:28:29,645 INFO L225 Difference]: With dead ends: 44 [2018-11-14 17:28:29,645 INFO L226 Difference]: Without dead ends: 37 [2018-11-14 17:28:29,646 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:28:29,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-14 17:28:29,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-11-14 17:28:29,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:28:29,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 35 states. [2018-11-14 17:28:29,674 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 35 states. [2018-11-14 17:28:29,674 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 35 states. [2018-11-14 17:28:29,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:29,678 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-11-14 17:28:29,678 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-14 17:28:29,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:28:29,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:28:29,679 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 37 states. [2018-11-14 17:28:29,679 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 37 states. [2018-11-14 17:28:29,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:29,682 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-11-14 17:28:29,682 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-14 17:28:29,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:28:29,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:28:29,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:28:29,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:28:29,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 17:28:29,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-14 17:28:29,686 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2018-11-14 17:28:29,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:28:29,686 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-14 17:28:29,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 17:28:29,686 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-14 17:28:29,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 17:28:29,688 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:28:29,688 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:28:29,688 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:28:29,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:28:29,689 INFO L82 PathProgramCache]: Analyzing trace with hash -229115284, now seen corresponding path program 1 times [2018-11-14 17:28:29,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:28:29,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:28:29,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:29,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:28:29,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:28:29,828 INFO L256 TraceCheckUtils]: 0: Hoare triple {658#true} call ULTIMATE.init(); {658#true} is VALID [2018-11-14 17:28:29,828 INFO L273 TraceCheckUtils]: 1: Hoare triple {658#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {658#true} is VALID [2018-11-14 17:28:29,828 INFO L273 TraceCheckUtils]: 2: Hoare triple {658#true} assume true; {658#true} is VALID [2018-11-14 17:28:29,829 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {658#true} {658#true} #112#return; {658#true} is VALID [2018-11-14 17:28:29,829 INFO L256 TraceCheckUtils]: 4: Hoare triple {658#true} call #t~ret12 := main(); {658#true} is VALID [2018-11-14 17:28:29,830 INFO L273 TraceCheckUtils]: 5: Hoare triple {658#true} ~len~1 := 2; {660#(<= 2 main_~len~1)} is VALID [2018-11-14 17:28:29,831 INFO L273 TraceCheckUtils]: 6: Hoare triple {660#(<= 2 main_~len~1)} assume true; {660#(<= 2 main_~len~1)} is VALID [2018-11-14 17:28:29,831 INFO L273 TraceCheckUtils]: 7: Hoare triple {660#(<= 2 main_~len~1)} #t~short8 := ~len~1 < 32; {660#(<= 2 main_~len~1)} is VALID [2018-11-14 17:28:29,832 INFO L273 TraceCheckUtils]: 8: Hoare triple {660#(<= 2 main_~len~1)} assume #t~short8;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;#t~short8 := #t~nondet7 != 0; {660#(<= 2 main_~len~1)} is VALID [2018-11-14 17:28:29,832 INFO L273 TraceCheckUtils]: 9: Hoare triple {660#(<= 2 main_~len~1)} assume !#t~short8;havoc #t~short8;havoc #t~nondet7; {660#(<= 2 main_~len~1)} is VALID [2018-11-14 17:28:29,833 INFO L256 TraceCheckUtils]: 10: Hoare triple {660#(<= 2 main_~len~1)} call #t~ret10.base, #t~ret10.offset := sll_create(~len~1 + 1); {658#true} is VALID [2018-11-14 17:28:29,833 INFO L273 TraceCheckUtils]: 11: Hoare triple {658#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {661#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 17:28:29,834 INFO L273 TraceCheckUtils]: 12: Hoare triple {661#(<= |sll_create_#in~len| sll_create_~len)} assume true; {661#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 17:28:29,834 INFO L273 TraceCheckUtils]: 13: Hoare triple {661#(<= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {661#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 17:28:29,835 INFO L273 TraceCheckUtils]: 14: Hoare triple {661#(<= |sll_create_#in~len| sll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {661#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 17:28:29,836 INFO L273 TraceCheckUtils]: 15: Hoare triple {661#(<= |sll_create_#in~len| sll_create_~len)} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 0, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {662#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-14 17:28:29,837 INFO L273 TraceCheckUtils]: 16: Hoare triple {662#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume true; {662#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-14 17:28:29,838 INFO L273 TraceCheckUtils]: 17: Hoare triple {662#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(~len > 0); {663#(<= |sll_create_#in~len| 1)} is VALID [2018-11-14 17:28:29,839 INFO L273 TraceCheckUtils]: 18: Hoare triple {663#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {663#(<= |sll_create_#in~len| 1)} is VALID [2018-11-14 17:28:29,840 INFO L273 TraceCheckUtils]: 19: Hoare triple {663#(<= |sll_create_#in~len| 1)} assume true; {663#(<= |sll_create_#in~len| 1)} is VALID [2018-11-14 17:28:29,841 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {663#(<= |sll_create_#in~len| 1)} {660#(<= 2 main_~len~1)} #106#return; {659#false} is VALID [2018-11-14 17:28:29,842 INFO L273 TraceCheckUtils]: 21: Hoare triple {659#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset; {659#false} is VALID [2018-11-14 17:28:29,842 INFO L256 TraceCheckUtils]: 22: Hoare triple {659#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {658#true} is VALID [2018-11-14 17:28:29,843 INFO L273 TraceCheckUtils]: 23: Hoare triple {658#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {658#true} is VALID [2018-11-14 17:28:29,843 INFO L273 TraceCheckUtils]: 24: Hoare triple {658#true} assume true; {658#true} is VALID [2018-11-14 17:28:29,844 INFO L273 TraceCheckUtils]: 25: Hoare triple {658#true} assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := #t~post4 + 1;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset + 0, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {658#true} is VALID [2018-11-14 17:28:29,845 INFO L273 TraceCheckUtils]: 26: Hoare triple {658#true} assume true; {658#true} is VALID [2018-11-14 17:28:29,845 INFO L273 TraceCheckUtils]: 27: Hoare triple {658#true} assume !(~head.base != 0 || ~head.offset != 0); {658#true} is VALID [2018-11-14 17:28:29,845 INFO L273 TraceCheckUtils]: 28: Hoare triple {658#true} #res := ~len~0; {658#true} is VALID [2018-11-14 17:28:29,846 INFO L273 TraceCheckUtils]: 29: Hoare triple {658#true} assume true; {658#true} is VALID [2018-11-14 17:28:29,846 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {658#true} {659#false} #108#return; {659#false} is VALID [2018-11-14 17:28:29,846 INFO L273 TraceCheckUtils]: 31: Hoare triple {659#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {659#false} is VALID [2018-11-14 17:28:29,846 INFO L273 TraceCheckUtils]: 32: Hoare triple {659#false} assume ~len~1 != #t~ret11;havoc #t~ret11; {659#false} is VALID [2018-11-14 17:28:29,847 INFO L273 TraceCheckUtils]: 33: Hoare triple {659#false} assume !false; {659#false} is VALID [2018-11-14 17:28:29,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 17:28:29,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:28:29,850 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:28:29,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:28:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:28:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:28:29,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:28:30,203 INFO L256 TraceCheckUtils]: 0: Hoare triple {658#true} call ULTIMATE.init(); {658#true} is VALID [2018-11-14 17:28:30,204 INFO L273 TraceCheckUtils]: 1: Hoare triple {658#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {658#true} is VALID [2018-11-14 17:28:30,204 INFO L273 TraceCheckUtils]: 2: Hoare triple {658#true} assume true; {658#true} is VALID [2018-11-14 17:28:30,204 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {658#true} {658#true} #112#return; {658#true} is VALID [2018-11-14 17:28:30,205 INFO L256 TraceCheckUtils]: 4: Hoare triple {658#true} call #t~ret12 := main(); {658#true} is VALID [2018-11-14 17:28:30,220 INFO L273 TraceCheckUtils]: 5: Hoare triple {658#true} ~len~1 := 2; {660#(<= 2 main_~len~1)} is VALID [2018-11-14 17:28:30,221 INFO L273 TraceCheckUtils]: 6: Hoare triple {660#(<= 2 main_~len~1)} assume true; {660#(<= 2 main_~len~1)} is VALID [2018-11-14 17:28:30,222 INFO L273 TraceCheckUtils]: 7: Hoare triple {660#(<= 2 main_~len~1)} #t~short8 := ~len~1 < 32; {660#(<= 2 main_~len~1)} is VALID [2018-11-14 17:28:30,225 INFO L273 TraceCheckUtils]: 8: Hoare triple {660#(<= 2 main_~len~1)} assume #t~short8;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;#t~short8 := #t~nondet7 != 0; {660#(<= 2 main_~len~1)} is VALID [2018-11-14 17:28:30,225 INFO L273 TraceCheckUtils]: 9: Hoare triple {660#(<= 2 main_~len~1)} assume !#t~short8;havoc #t~short8;havoc #t~nondet7; {660#(<= 2 main_~len~1)} is VALID [2018-11-14 17:28:30,226 INFO L256 TraceCheckUtils]: 10: Hoare triple {660#(<= 2 main_~len~1)} call #t~ret10.base, #t~ret10.offset := sll_create(~len~1 + 1); {658#true} is VALID [2018-11-14 17:28:30,229 INFO L273 TraceCheckUtils]: 11: Hoare triple {658#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {661#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 17:28:30,230 INFO L273 TraceCheckUtils]: 12: Hoare triple {661#(<= |sll_create_#in~len| sll_create_~len)} assume true; {661#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 17:28:30,235 INFO L273 TraceCheckUtils]: 13: Hoare triple {661#(<= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {661#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 17:28:30,235 INFO L273 TraceCheckUtils]: 14: Hoare triple {661#(<= |sll_create_#in~len| sll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {661#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 17:28:30,236 INFO L273 TraceCheckUtils]: 15: Hoare triple {661#(<= |sll_create_#in~len| sll_create_~len)} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 0, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {662#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-14 17:28:30,237 INFO L273 TraceCheckUtils]: 16: Hoare triple {662#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume true; {662#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-14 17:28:30,237 INFO L273 TraceCheckUtils]: 17: Hoare triple {662#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(~len > 0); {663#(<= |sll_create_#in~len| 1)} is VALID [2018-11-14 17:28:30,241 INFO L273 TraceCheckUtils]: 18: Hoare triple {663#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {663#(<= |sll_create_#in~len| 1)} is VALID [2018-11-14 17:28:30,241 INFO L273 TraceCheckUtils]: 19: Hoare triple {663#(<= |sll_create_#in~len| 1)} assume true; {663#(<= |sll_create_#in~len| 1)} is VALID [2018-11-14 17:28:30,253 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {663#(<= |sll_create_#in~len| 1)} {660#(<= 2 main_~len~1)} #106#return; {659#false} is VALID [2018-11-14 17:28:30,253 INFO L273 TraceCheckUtils]: 21: Hoare triple {659#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset; {659#false} is VALID [2018-11-14 17:28:30,253 INFO L256 TraceCheckUtils]: 22: Hoare triple {659#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {659#false} is VALID [2018-11-14 17:28:30,253 INFO L273 TraceCheckUtils]: 23: Hoare triple {659#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {659#false} is VALID [2018-11-14 17:28:30,254 INFO L273 TraceCheckUtils]: 24: Hoare triple {659#false} assume true; {659#false} is VALID [2018-11-14 17:28:30,254 INFO L273 TraceCheckUtils]: 25: Hoare triple {659#false} assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := #t~post4 + 1;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset + 0, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {659#false} is VALID [2018-11-14 17:28:30,254 INFO L273 TraceCheckUtils]: 26: Hoare triple {659#false} assume true; {659#false} is VALID [2018-11-14 17:28:30,254 INFO L273 TraceCheckUtils]: 27: Hoare triple {659#false} assume !(~head.base != 0 || ~head.offset != 0); {659#false} is VALID [2018-11-14 17:28:30,254 INFO L273 TraceCheckUtils]: 28: Hoare triple {659#false} #res := ~len~0; {659#false} is VALID [2018-11-14 17:28:30,255 INFO L273 TraceCheckUtils]: 29: Hoare triple {659#false} assume true; {659#false} is VALID [2018-11-14 17:28:30,255 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {659#false} {659#false} #108#return; {659#false} is VALID [2018-11-14 17:28:30,255 INFO L273 TraceCheckUtils]: 31: Hoare triple {659#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {659#false} is VALID [2018-11-14 17:28:30,255 INFO L273 TraceCheckUtils]: 32: Hoare triple {659#false} assume ~len~1 != #t~ret11;havoc #t~ret11; {659#false} is VALID [2018-11-14 17:28:30,256 INFO L273 TraceCheckUtils]: 33: Hoare triple {659#false} assume !false; {659#false} is VALID [2018-11-14 17:28:30,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 17:28:30,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:28:30,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-14 17:28:30,285 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-11-14 17:28:30,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:28:30,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:28:30,528 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:28:30,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:28:30,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:28:30,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:28:30,529 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 6 states. [2018-11-14 17:28:30,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:30,790 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-11-14 17:28:30,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:28:30,791 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-11-14 17:28:30,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:28:30,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:28:30,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2018-11-14 17:28:30,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:28:30,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2018-11-14 17:28:30,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2018-11-14 17:28:30,956 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:28:30,958 INFO L225 Difference]: With dead ends: 58 [2018-11-14 17:28:30,959 INFO L226 Difference]: Without dead ends: 41 [2018-11-14 17:28:30,959 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:28:30,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-14 17:28:31,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-11-14 17:28:31,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:28:31,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 39 states. [2018-11-14 17:28:31,001 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 39 states. [2018-11-14 17:28:31,001 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 39 states. [2018-11-14 17:28:31,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:31,003 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-11-14 17:28:31,003 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-11-14 17:28:31,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:28:31,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:28:31,004 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 41 states. [2018-11-14 17:28:31,005 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 41 states. [2018-11-14 17:28:31,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:31,007 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-11-14 17:28:31,007 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-11-14 17:28:31,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:28:31,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:28:31,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:28:31,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:28:31,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-14 17:28:31,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-11-14 17:28:31,011 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 34 [2018-11-14 17:28:31,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:28:31,011 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-14 17:28:31,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:28:31,012 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-14 17:28:31,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-14 17:28:31,013 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:28:31,013 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:28:31,013 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:28:31,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:28:31,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1457066700, now seen corresponding path program 2 times [2018-11-14 17:28:31,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:28:31,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:28:31,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:31,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:28:31,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:28:31,288 INFO L256 TraceCheckUtils]: 0: Hoare triple {981#true} call ULTIMATE.init(); {981#true} is VALID [2018-11-14 17:28:31,288 INFO L273 TraceCheckUtils]: 1: Hoare triple {981#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {981#true} is VALID [2018-11-14 17:28:31,288 INFO L273 TraceCheckUtils]: 2: Hoare triple {981#true} assume true; {981#true} is VALID [2018-11-14 17:28:31,289 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {981#true} {981#true} #112#return; {981#true} is VALID [2018-11-14 17:28:31,289 INFO L256 TraceCheckUtils]: 4: Hoare triple {981#true} call #t~ret12 := main(); {981#true} is VALID [2018-11-14 17:28:31,290 INFO L273 TraceCheckUtils]: 5: Hoare triple {981#true} ~len~1 := 2; {981#true} is VALID [2018-11-14 17:28:31,290 INFO L273 TraceCheckUtils]: 6: Hoare triple {981#true} assume true; {981#true} is VALID [2018-11-14 17:28:31,291 INFO L273 TraceCheckUtils]: 7: Hoare triple {981#true} #t~short8 := ~len~1 < 32; {981#true} is VALID [2018-11-14 17:28:31,291 INFO L273 TraceCheckUtils]: 8: Hoare triple {981#true} assume #t~short8;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;#t~short8 := #t~nondet7 != 0; {981#true} is VALID [2018-11-14 17:28:31,291 INFO L273 TraceCheckUtils]: 9: Hoare triple {981#true} assume !#t~short8;havoc #t~short8;havoc #t~nondet7; {981#true} is VALID [2018-11-14 17:28:31,291 INFO L256 TraceCheckUtils]: 10: Hoare triple {981#true} call #t~ret10.base, #t~ret10.offset := sll_create(~len~1 + 1); {981#true} is VALID [2018-11-14 17:28:31,291 INFO L273 TraceCheckUtils]: 11: Hoare triple {981#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {981#true} is VALID [2018-11-14 17:28:31,292 INFO L273 TraceCheckUtils]: 12: Hoare triple {981#true} assume true; {981#true} is VALID [2018-11-14 17:28:31,292 INFO L273 TraceCheckUtils]: 13: Hoare triple {981#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {983#(not (= 0 sll_create_~new_head~0.base))} is VALID [2018-11-14 17:28:31,293 INFO L273 TraceCheckUtils]: 14: Hoare triple {983#(not (= 0 sll_create_~new_head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {983#(not (= 0 sll_create_~new_head~0.base))} is VALID [2018-11-14 17:28:31,294 INFO L273 TraceCheckUtils]: 15: Hoare triple {983#(not (= 0 sll_create_~new_head~0.base))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 0, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {984#(not (= 0 sll_create_~head~0.base))} is VALID [2018-11-14 17:28:31,294 INFO L273 TraceCheckUtils]: 16: Hoare triple {984#(not (= 0 sll_create_~head~0.base))} assume true; {984#(not (= 0 sll_create_~head~0.base))} is VALID [2018-11-14 17:28:31,294 INFO L273 TraceCheckUtils]: 17: Hoare triple {984#(not (= 0 sll_create_~head~0.base))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {984#(not (= 0 sll_create_~head~0.base))} is VALID [2018-11-14 17:28:31,295 INFO L273 TraceCheckUtils]: 18: Hoare triple {984#(not (= 0 sll_create_~head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {984#(not (= 0 sll_create_~head~0.base))} is VALID [2018-11-14 17:28:31,296 INFO L273 TraceCheckUtils]: 19: Hoare triple {984#(not (= 0 sll_create_~head~0.base))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 0, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {985#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2018-11-14 17:28:31,297 INFO L273 TraceCheckUtils]: 20: Hoare triple {985#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} assume true; {985#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2018-11-14 17:28:31,297 INFO L273 TraceCheckUtils]: 21: Hoare triple {985#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} assume !(~len > 0); {985#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2018-11-14 17:28:31,298 INFO L273 TraceCheckUtils]: 22: Hoare triple {985#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {986#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} is VALID [2018-11-14 17:28:31,299 INFO L273 TraceCheckUtils]: 23: Hoare triple {986#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} assume true; {986#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} is VALID [2018-11-14 17:28:31,301 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {986#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} {981#true} #106#return; {987#(not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~ret10.base|) |main_#t~ret10.offset|)))} is VALID [2018-11-14 17:28:31,302 INFO L273 TraceCheckUtils]: 25: Hoare triple {987#(not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~ret10.base|) |main_#t~ret10.offset|)))} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset; {988#(not (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-14 17:28:31,302 INFO L256 TraceCheckUtils]: 26: Hoare triple {988#(not (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)))} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {981#true} is VALID [2018-11-14 17:28:31,305 INFO L273 TraceCheckUtils]: 27: Hoare triple {981#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {989#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= sll_length_~head.base |sll_length_#in~head.base|))} is VALID [2018-11-14 17:28:31,306 INFO L273 TraceCheckUtils]: 28: Hoare triple {989#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= sll_length_~head.base |sll_length_#in~head.base|))} assume true; {989#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= sll_length_~head.base |sll_length_#in~head.base|))} is VALID [2018-11-14 17:28:31,307 INFO L273 TraceCheckUtils]: 29: Hoare triple {989#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= sll_length_~head.base |sll_length_#in~head.base|))} assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := #t~post4 + 1;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset + 0, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {990#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base)} is VALID [2018-11-14 17:28:31,307 INFO L273 TraceCheckUtils]: 30: Hoare triple {990#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base)} assume true; {990#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base)} is VALID [2018-11-14 17:28:31,308 INFO L273 TraceCheckUtils]: 31: Hoare triple {990#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base)} assume !(~head.base != 0 || ~head.offset != 0); {991#(= 0 (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|))} is VALID [2018-11-14 17:28:31,308 INFO L273 TraceCheckUtils]: 32: Hoare triple {991#(= 0 (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|))} #res := ~len~0; {991#(= 0 (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|))} is VALID [2018-11-14 17:28:31,314 INFO L273 TraceCheckUtils]: 33: Hoare triple {991#(= 0 (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|))} assume true; {991#(= 0 (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|))} is VALID [2018-11-14 17:28:31,317 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {991#(= 0 (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|))} {988#(not (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)))} #108#return; {982#false} is VALID [2018-11-14 17:28:31,317 INFO L273 TraceCheckUtils]: 35: Hoare triple {982#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {982#false} is VALID [2018-11-14 17:28:31,317 INFO L273 TraceCheckUtils]: 36: Hoare triple {982#false} assume ~len~1 != #t~ret11;havoc #t~ret11; {982#false} is VALID [2018-11-14 17:28:31,317 INFO L273 TraceCheckUtils]: 37: Hoare triple {982#false} assume !false; {982#false} is VALID [2018-11-14 17:28:31,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:28:31,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:28:31,322 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:28:31,338 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:28:31,395 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:28:31,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:28:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:28:31,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:28:31,795 INFO L256 TraceCheckUtils]: 0: Hoare triple {981#true} call ULTIMATE.init(); {981#true} is VALID [2018-11-14 17:28:31,796 INFO L273 TraceCheckUtils]: 1: Hoare triple {981#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {981#true} is VALID [2018-11-14 17:28:31,796 INFO L273 TraceCheckUtils]: 2: Hoare triple {981#true} assume true; {981#true} is VALID [2018-11-14 17:28:31,796 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {981#true} {981#true} #112#return; {981#true} is VALID [2018-11-14 17:28:31,796 INFO L256 TraceCheckUtils]: 4: Hoare triple {981#true} call #t~ret12 := main(); {981#true} is VALID [2018-11-14 17:28:31,797 INFO L273 TraceCheckUtils]: 5: Hoare triple {981#true} ~len~1 := 2; {1010#(<= 2 main_~len~1)} is VALID [2018-11-14 17:28:31,798 INFO L273 TraceCheckUtils]: 6: Hoare triple {1010#(<= 2 main_~len~1)} assume true; {1010#(<= 2 main_~len~1)} is VALID [2018-11-14 17:28:31,799 INFO L273 TraceCheckUtils]: 7: Hoare triple {1010#(<= 2 main_~len~1)} #t~short8 := ~len~1 < 32; {1010#(<= 2 main_~len~1)} is VALID [2018-11-14 17:28:31,799 INFO L273 TraceCheckUtils]: 8: Hoare triple {1010#(<= 2 main_~len~1)} assume #t~short8;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;#t~short8 := #t~nondet7 != 0; {1010#(<= 2 main_~len~1)} is VALID [2018-11-14 17:28:31,800 INFO L273 TraceCheckUtils]: 9: Hoare triple {1010#(<= 2 main_~len~1)} assume !#t~short8;havoc #t~short8;havoc #t~nondet7; {1010#(<= 2 main_~len~1)} is VALID [2018-11-14 17:28:31,800 INFO L256 TraceCheckUtils]: 10: Hoare triple {1010#(<= 2 main_~len~1)} call #t~ret10.base, #t~ret10.offset := sll_create(~len~1 + 1); {981#true} is VALID [2018-11-14 17:28:31,800 INFO L273 TraceCheckUtils]: 11: Hoare triple {981#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {1029#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 17:28:31,807 INFO L273 TraceCheckUtils]: 12: Hoare triple {1029#(<= |sll_create_#in~len| sll_create_~len)} assume true; {1029#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 17:28:31,808 INFO L273 TraceCheckUtils]: 13: Hoare triple {1029#(<= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1029#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 17:28:31,808 INFO L273 TraceCheckUtils]: 14: Hoare triple {1029#(<= |sll_create_#in~len| sll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1029#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 17:28:31,810 INFO L273 TraceCheckUtils]: 15: Hoare triple {1029#(<= |sll_create_#in~len| sll_create_~len)} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 0, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1042#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-14 17:28:31,811 INFO L273 TraceCheckUtils]: 16: Hoare triple {1042#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume true; {1042#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-14 17:28:31,811 INFO L273 TraceCheckUtils]: 17: Hoare triple {1042#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1042#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-14 17:28:31,812 INFO L273 TraceCheckUtils]: 18: Hoare triple {1042#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1042#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-14 17:28:31,813 INFO L273 TraceCheckUtils]: 19: Hoare triple {1042#(<= |sll_create_#in~len| (+ sll_create_~len 1))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 0, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1055#(<= |sll_create_#in~len| (+ sll_create_~len 2))} is VALID [2018-11-14 17:28:31,814 INFO L273 TraceCheckUtils]: 20: Hoare triple {1055#(<= |sll_create_#in~len| (+ sll_create_~len 2))} assume true; {1055#(<= |sll_create_#in~len| (+ sll_create_~len 2))} is VALID [2018-11-14 17:28:31,815 INFO L273 TraceCheckUtils]: 21: Hoare triple {1055#(<= |sll_create_#in~len| (+ sll_create_~len 2))} assume !(~len > 0); {1062#(<= |sll_create_#in~len| 2)} is VALID [2018-11-14 17:28:31,816 INFO L273 TraceCheckUtils]: 22: Hoare triple {1062#(<= |sll_create_#in~len| 2)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1062#(<= |sll_create_#in~len| 2)} is VALID [2018-11-14 17:28:31,817 INFO L273 TraceCheckUtils]: 23: Hoare triple {1062#(<= |sll_create_#in~len| 2)} assume true; {1062#(<= |sll_create_#in~len| 2)} is VALID [2018-11-14 17:28:31,818 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1062#(<= |sll_create_#in~len| 2)} {1010#(<= 2 main_~len~1)} #106#return; {982#false} is VALID [2018-11-14 17:28:31,819 INFO L273 TraceCheckUtils]: 25: Hoare triple {982#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset; {982#false} is VALID [2018-11-14 17:28:31,819 INFO L256 TraceCheckUtils]: 26: Hoare triple {982#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {982#false} is VALID [2018-11-14 17:28:31,820 INFO L273 TraceCheckUtils]: 27: Hoare triple {982#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {982#false} is VALID [2018-11-14 17:28:31,820 INFO L273 TraceCheckUtils]: 28: Hoare triple {982#false} assume true; {982#false} is VALID [2018-11-14 17:28:31,820 INFO L273 TraceCheckUtils]: 29: Hoare triple {982#false} assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := #t~post4 + 1;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset + 0, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {982#false} is VALID [2018-11-14 17:28:31,821 INFO L273 TraceCheckUtils]: 30: Hoare triple {982#false} assume true; {982#false} is VALID [2018-11-14 17:28:31,821 INFO L273 TraceCheckUtils]: 31: Hoare triple {982#false} assume !(~head.base != 0 || ~head.offset != 0); {982#false} is VALID [2018-11-14 17:28:31,821 INFO L273 TraceCheckUtils]: 32: Hoare triple {982#false} #res := ~len~0; {982#false} is VALID [2018-11-14 17:28:31,822 INFO L273 TraceCheckUtils]: 33: Hoare triple {982#false} assume true; {982#false} is VALID [2018-11-14 17:28:31,822 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {982#false} {982#false} #108#return; {982#false} is VALID [2018-11-14 17:28:31,822 INFO L273 TraceCheckUtils]: 35: Hoare triple {982#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {982#false} is VALID [2018-11-14 17:28:31,822 INFO L273 TraceCheckUtils]: 36: Hoare triple {982#false} assume ~len~1 != #t~ret11;havoc #t~ret11; {982#false} is VALID [2018-11-14 17:28:31,823 INFO L273 TraceCheckUtils]: 37: Hoare triple {982#false} assume !false; {982#false} is VALID [2018-11-14 17:28:31,825 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 17:28:31,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:28:31,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2018-11-14 17:28:31,847 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2018-11-14 17:28:31,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:28:31,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 17:28:31,961 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:28:31,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 17:28:31,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 17:28:31,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-11-14 17:28:31,962 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 16 states. [2018-11-14 17:28:33,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:33,906 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-11-14 17:28:33,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 17:28:33,906 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2018-11-14 17:28:33,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:28:33,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:28:33,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 70 transitions. [2018-11-14 17:28:33,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:28:33,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 70 transitions. [2018-11-14 17:28:33,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 70 transitions. [2018-11-14 17:28:34,043 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:28:34,046 INFO L225 Difference]: With dead ends: 67 [2018-11-14 17:28:34,046 INFO L226 Difference]: Without dead ends: 47 [2018-11-14 17:28:34,047 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2018-11-14 17:28:34,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-14 17:28:34,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-11-14 17:28:34,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:28:34,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 45 states. [2018-11-14 17:28:34,120 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 45 states. [2018-11-14 17:28:34,120 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 45 states. [2018-11-14 17:28:34,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:34,122 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-11-14 17:28:34,122 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-11-14 17:28:34,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:28:34,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:28:34,123 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 47 states. [2018-11-14 17:28:34,123 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 47 states. [2018-11-14 17:28:34,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:34,125 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-11-14 17:28:34,125 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-11-14 17:28:34,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:28:34,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:28:34,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:28:34,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:28:34,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-14 17:28:34,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-11-14 17:28:34,128 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 38 [2018-11-14 17:28:34,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:28:34,129 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-11-14 17:28:34,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 17:28:34,129 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-14 17:28:34,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-14 17:28:34,130 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:28:34,130 INFO L375 BasicCegarLoop]: trace histogram [4, 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] [2018-11-14 17:28:34,131 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:28:34,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:28:34,131 INFO L82 PathProgramCache]: Analyzing trace with hash -128085278, now seen corresponding path program 3 times [2018-11-14 17:28:34,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:28:34,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:28:34,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:34,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:28:34,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:28:34,635 INFO L256 TraceCheckUtils]: 0: Hoare triple {1378#true} call ULTIMATE.init(); {1378#true} is VALID [2018-11-14 17:28:34,635 INFO L273 TraceCheckUtils]: 1: Hoare triple {1378#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1378#true} is VALID [2018-11-14 17:28:34,635 INFO L273 TraceCheckUtils]: 2: Hoare triple {1378#true} assume true; {1378#true} is VALID [2018-11-14 17:28:34,636 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1378#true} {1378#true} #112#return; {1378#true} is VALID [2018-11-14 17:28:34,636 INFO L256 TraceCheckUtils]: 4: Hoare triple {1378#true} call #t~ret12 := main(); {1378#true} is VALID [2018-11-14 17:28:34,637 INFO L273 TraceCheckUtils]: 5: Hoare triple {1378#true} ~len~1 := 2; {1378#true} is VALID [2018-11-14 17:28:34,637 INFO L273 TraceCheckUtils]: 6: Hoare triple {1378#true} assume true; {1378#true} is VALID [2018-11-14 17:28:34,637 INFO L273 TraceCheckUtils]: 7: Hoare triple {1378#true} #t~short8 := ~len~1 < 32; {1378#true} is VALID [2018-11-14 17:28:34,638 INFO L273 TraceCheckUtils]: 8: Hoare triple {1378#true} assume #t~short8;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;#t~short8 := #t~nondet7 != 0; {1378#true} is VALID [2018-11-14 17:28:34,638 INFO L273 TraceCheckUtils]: 9: Hoare triple {1378#true} assume !#t~short8;havoc #t~short8;havoc #t~nondet7; {1378#true} is VALID [2018-11-14 17:28:34,638 INFO L256 TraceCheckUtils]: 10: Hoare triple {1378#true} call #t~ret10.base, #t~ret10.offset := sll_create(~len~1 + 1); {1378#true} is VALID [2018-11-14 17:28:34,638 INFO L273 TraceCheckUtils]: 11: Hoare triple {1378#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {1378#true} is VALID [2018-11-14 17:28:34,639 INFO L273 TraceCheckUtils]: 12: Hoare triple {1378#true} assume true; {1378#true} is VALID [2018-11-14 17:28:34,639 INFO L273 TraceCheckUtils]: 13: Hoare triple {1378#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1380#(not (= 0 sll_create_~new_head~0.base))} is VALID [2018-11-14 17:28:34,640 INFO L273 TraceCheckUtils]: 14: Hoare triple {1380#(not (= 0 sll_create_~new_head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1380#(not (= 0 sll_create_~new_head~0.base))} is VALID [2018-11-14 17:28:34,640 INFO L273 TraceCheckUtils]: 15: Hoare triple {1380#(not (= 0 sll_create_~new_head~0.base))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 0, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1381#(not (= 0 sll_create_~head~0.base))} is VALID [2018-11-14 17:28:34,640 INFO L273 TraceCheckUtils]: 16: Hoare triple {1381#(not (= 0 sll_create_~head~0.base))} assume true; {1381#(not (= 0 sll_create_~head~0.base))} is VALID [2018-11-14 17:28:34,641 INFO L273 TraceCheckUtils]: 17: Hoare triple {1381#(not (= 0 sll_create_~head~0.base))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1382#(and (= (select |#valid| sll_create_~new_head~0.base) 1) (not (= 0 sll_create_~head~0.base)))} is VALID [2018-11-14 17:28:34,642 INFO L273 TraceCheckUtils]: 18: Hoare triple {1382#(and (= (select |#valid| sll_create_~new_head~0.base) 1) (not (= 0 sll_create_~head~0.base)))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1382#(and (= (select |#valid| sll_create_~new_head~0.base) 1) (not (= 0 sll_create_~head~0.base)))} is VALID [2018-11-14 17:28:34,642 INFO L273 TraceCheckUtils]: 19: Hoare triple {1382#(and (= (select |#valid| sll_create_~new_head~0.base) 1) (not (= 0 sll_create_~head~0.base)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 0, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1383#(and (= (select |#valid| sll_create_~head~0.base) 1) (not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset))))} is VALID [2018-11-14 17:28:34,643 INFO L273 TraceCheckUtils]: 20: Hoare triple {1383#(and (= (select |#valid| sll_create_~head~0.base) 1) (not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset))))} assume true; {1383#(and (= (select |#valid| sll_create_~head~0.base) 1) (not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset))))} is VALID [2018-11-14 17:28:34,644 INFO L273 TraceCheckUtils]: 21: Hoare triple {1383#(and (= (select |#valid| sll_create_~head~0.base) 1) (not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset))))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1384#(not (= 0 (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2018-11-14 17:28:34,644 INFO L273 TraceCheckUtils]: 22: Hoare triple {1384#(not (= 0 (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) sll_create_~head~0.base) sll_create_~head~0.offset)))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1384#(not (= 0 (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2018-11-14 17:28:34,647 INFO L273 TraceCheckUtils]: 23: Hoare triple {1384#(not (= 0 (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) sll_create_~head~0.base) sll_create_~head~0.offset)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 0, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1385#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset))))} is VALID [2018-11-14 17:28:34,648 INFO L273 TraceCheckUtils]: 24: Hoare triple {1385#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset))))} assume true; {1385#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset))))} is VALID [2018-11-14 17:28:34,648 INFO L273 TraceCheckUtils]: 25: Hoare triple {1385#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset))))} assume !(~len > 0); {1385#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset))))} is VALID [2018-11-14 17:28:34,650 INFO L273 TraceCheckUtils]: 26: Hoare triple {1385#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset))))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1386#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)) (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) |sll_create_#res.offset|))))} is VALID [2018-11-14 17:28:34,653 INFO L273 TraceCheckUtils]: 27: Hoare triple {1386#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)) (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) |sll_create_#res.offset|))))} assume true; {1386#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)) (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) |sll_create_#res.offset|))))} is VALID [2018-11-14 17:28:34,657 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1386#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)) (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) |sll_create_#res.offset|))))} {1378#true} #106#return; {1387#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret10.base|) |main_#t~ret10.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~ret10.base|) |main_#t~ret10.offset|))))} is VALID [2018-11-14 17:28:34,659 INFO L273 TraceCheckUtils]: 29: Hoare triple {1387#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret10.base|) |main_#t~ret10.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~ret10.base|) |main_#t~ret10.offset|))))} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset; {1388#(not (= 0 (select (select |#memory_$Pointer$.base| (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))))} is VALID [2018-11-14 17:28:34,660 INFO L256 TraceCheckUtils]: 30: Hoare triple {1388#(not (= 0 (select (select |#memory_$Pointer$.base| (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))))} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {1378#true} is VALID [2018-11-14 17:28:34,660 INFO L273 TraceCheckUtils]: 31: Hoare triple {1378#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {1389#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= sll_length_~head.base |sll_length_#in~head.base|))} is VALID [2018-11-14 17:28:34,661 INFO L273 TraceCheckUtils]: 32: Hoare triple {1389#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= sll_length_~head.base |sll_length_#in~head.base|))} assume true; {1389#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= sll_length_~head.base |sll_length_#in~head.base|))} is VALID [2018-11-14 17:28:34,661 INFO L273 TraceCheckUtils]: 33: Hoare triple {1389#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= sll_length_~head.base |sll_length_#in~head.base|))} assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := #t~post4 + 1;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset + 0, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1390#(and (= sll_length_~head.offset (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (= sll_length_~head.base (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)))} is VALID [2018-11-14 17:28:34,662 INFO L273 TraceCheckUtils]: 34: Hoare triple {1390#(and (= sll_length_~head.offset (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (= sll_length_~head.base (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)))} assume true; {1390#(and (= sll_length_~head.offset (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (= sll_length_~head.base (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)))} is VALID [2018-11-14 17:28:34,663 INFO L273 TraceCheckUtils]: 35: Hoare triple {1390#(and (= sll_length_~head.offset (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (= sll_length_~head.base (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)))} assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := #t~post4 + 1;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset + 0, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1391#(= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) sll_length_~head.base)} is VALID [2018-11-14 17:28:34,663 INFO L273 TraceCheckUtils]: 36: Hoare triple {1391#(= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) sll_length_~head.base)} assume true; {1391#(= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) sll_length_~head.base)} is VALID [2018-11-14 17:28:34,664 INFO L273 TraceCheckUtils]: 37: Hoare triple {1391#(= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) sll_length_~head.base)} assume !(~head.base != 0 || ~head.offset != 0); {1392#(= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)))} is VALID [2018-11-14 17:28:34,664 INFO L273 TraceCheckUtils]: 38: Hoare triple {1392#(= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)))} #res := ~len~0; {1392#(= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)))} is VALID [2018-11-14 17:28:34,665 INFO L273 TraceCheckUtils]: 39: Hoare triple {1392#(= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)))} assume true; {1392#(= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)))} is VALID [2018-11-14 17:28:34,666 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1392#(= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)))} {1388#(not (= 0 (select (select |#memory_$Pointer$.base| (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))))} #108#return; {1379#false} is VALID [2018-11-14 17:28:34,667 INFO L273 TraceCheckUtils]: 41: Hoare triple {1379#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {1379#false} is VALID [2018-11-14 17:28:34,667 INFO L273 TraceCheckUtils]: 42: Hoare triple {1379#false} assume ~len~1 != #t~ret11;havoc #t~ret11; {1379#false} is VALID [2018-11-14 17:28:34,667 INFO L273 TraceCheckUtils]: 43: Hoare triple {1379#false} assume !false; {1379#false} is VALID [2018-11-14 17:28:34,675 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:28:34,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:28:34,676 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:28:34,692 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:28:34,748 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-14 17:28:34,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:28:34,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:28:34,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:28:35,004 INFO L256 TraceCheckUtils]: 0: Hoare triple {1378#true} call ULTIMATE.init(); {1378#true} is VALID [2018-11-14 17:28:35,004 INFO L273 TraceCheckUtils]: 1: Hoare triple {1378#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1378#true} is VALID [2018-11-14 17:28:35,004 INFO L273 TraceCheckUtils]: 2: Hoare triple {1378#true} assume true; {1378#true} is VALID [2018-11-14 17:28:35,004 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1378#true} {1378#true} #112#return; {1378#true} is VALID [2018-11-14 17:28:35,005 INFO L256 TraceCheckUtils]: 4: Hoare triple {1378#true} call #t~ret12 := main(); {1378#true} is VALID [2018-11-14 17:28:35,006 INFO L273 TraceCheckUtils]: 5: Hoare triple {1378#true} ~len~1 := 2; {1411#(= main_~len~1 2)} is VALID [2018-11-14 17:28:35,006 INFO L273 TraceCheckUtils]: 6: Hoare triple {1411#(= main_~len~1 2)} assume true; {1411#(= main_~len~1 2)} is VALID [2018-11-14 17:28:35,007 INFO L273 TraceCheckUtils]: 7: Hoare triple {1411#(= main_~len~1 2)} #t~short8 := ~len~1 < 32; {1411#(= main_~len~1 2)} is VALID [2018-11-14 17:28:35,008 INFO L273 TraceCheckUtils]: 8: Hoare triple {1411#(= main_~len~1 2)} assume #t~short8;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;#t~short8 := #t~nondet7 != 0; {1411#(= main_~len~1 2)} is VALID [2018-11-14 17:28:35,008 INFO L273 TraceCheckUtils]: 9: Hoare triple {1411#(= main_~len~1 2)} assume !#t~short8;havoc #t~short8;havoc #t~nondet7; {1411#(= main_~len~1 2)} is VALID [2018-11-14 17:28:35,008 INFO L256 TraceCheckUtils]: 10: Hoare triple {1411#(= main_~len~1 2)} call #t~ret10.base, #t~ret10.offset := sll_create(~len~1 + 1); {1378#true} is VALID [2018-11-14 17:28:35,008 INFO L273 TraceCheckUtils]: 11: Hoare triple {1378#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {1378#true} is VALID [2018-11-14 17:28:35,009 INFO L273 TraceCheckUtils]: 12: Hoare triple {1378#true} assume true; {1378#true} is VALID [2018-11-14 17:28:35,009 INFO L273 TraceCheckUtils]: 13: Hoare triple {1378#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1378#true} is VALID [2018-11-14 17:28:35,009 INFO L273 TraceCheckUtils]: 14: Hoare triple {1378#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1378#true} is VALID [2018-11-14 17:28:35,009 INFO L273 TraceCheckUtils]: 15: Hoare triple {1378#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 0, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1378#true} is VALID [2018-11-14 17:28:35,010 INFO L273 TraceCheckUtils]: 16: Hoare triple {1378#true} assume true; {1378#true} is VALID [2018-11-14 17:28:35,010 INFO L273 TraceCheckUtils]: 17: Hoare triple {1378#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1378#true} is VALID [2018-11-14 17:28:35,010 INFO L273 TraceCheckUtils]: 18: Hoare triple {1378#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1378#true} is VALID [2018-11-14 17:28:35,011 INFO L273 TraceCheckUtils]: 19: Hoare triple {1378#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 0, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1378#true} is VALID [2018-11-14 17:28:35,011 INFO L273 TraceCheckUtils]: 20: Hoare triple {1378#true} assume true; {1378#true} is VALID [2018-11-14 17:28:35,011 INFO L273 TraceCheckUtils]: 21: Hoare triple {1378#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1378#true} is VALID [2018-11-14 17:28:35,011 INFO L273 TraceCheckUtils]: 22: Hoare triple {1378#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1378#true} is VALID [2018-11-14 17:28:35,011 INFO L273 TraceCheckUtils]: 23: Hoare triple {1378#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 0, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1378#true} is VALID [2018-11-14 17:28:35,012 INFO L273 TraceCheckUtils]: 24: Hoare triple {1378#true} assume true; {1378#true} is VALID [2018-11-14 17:28:35,012 INFO L273 TraceCheckUtils]: 25: Hoare triple {1378#true} assume !(~len > 0); {1378#true} is VALID [2018-11-14 17:28:35,012 INFO L273 TraceCheckUtils]: 26: Hoare triple {1378#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1378#true} is VALID [2018-11-14 17:28:35,012 INFO L273 TraceCheckUtils]: 27: Hoare triple {1378#true} assume true; {1378#true} is VALID [2018-11-14 17:28:35,018 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1378#true} {1411#(= main_~len~1 2)} #106#return; {1411#(= main_~len~1 2)} is VALID [2018-11-14 17:28:35,019 INFO L273 TraceCheckUtils]: 29: Hoare triple {1411#(= main_~len~1 2)} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset; {1411#(= main_~len~1 2)} is VALID [2018-11-14 17:28:35,019 INFO L256 TraceCheckUtils]: 30: Hoare triple {1411#(= main_~len~1 2)} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {1378#true} is VALID [2018-11-14 17:28:35,019 INFO L273 TraceCheckUtils]: 31: Hoare triple {1378#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {1490#(= sll_length_~len~0 0)} is VALID [2018-11-14 17:28:35,019 INFO L273 TraceCheckUtils]: 32: Hoare triple {1490#(= sll_length_~len~0 0)} assume true; {1490#(= sll_length_~len~0 0)} is VALID [2018-11-14 17:28:35,020 INFO L273 TraceCheckUtils]: 33: Hoare triple {1490#(= sll_length_~len~0 0)} assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := #t~post4 + 1;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset + 0, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1497#(= sll_length_~len~0 1)} is VALID [2018-11-14 17:28:35,020 INFO L273 TraceCheckUtils]: 34: Hoare triple {1497#(= sll_length_~len~0 1)} assume true; {1497#(= sll_length_~len~0 1)} is VALID [2018-11-14 17:28:35,021 INFO L273 TraceCheckUtils]: 35: Hoare triple {1497#(= sll_length_~len~0 1)} assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := #t~post4 + 1;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset + 0, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1504#(= sll_length_~len~0 2)} is VALID [2018-11-14 17:28:35,022 INFO L273 TraceCheckUtils]: 36: Hoare triple {1504#(= sll_length_~len~0 2)} assume true; {1504#(= sll_length_~len~0 2)} is VALID [2018-11-14 17:28:35,022 INFO L273 TraceCheckUtils]: 37: Hoare triple {1504#(= sll_length_~len~0 2)} assume !(~head.base != 0 || ~head.offset != 0); {1504#(= sll_length_~len~0 2)} is VALID [2018-11-14 17:28:35,023 INFO L273 TraceCheckUtils]: 38: Hoare triple {1504#(= sll_length_~len~0 2)} #res := ~len~0; {1514#(= |sll_length_#res| 2)} is VALID [2018-11-14 17:28:35,023 INFO L273 TraceCheckUtils]: 39: Hoare triple {1514#(= |sll_length_#res| 2)} assume true; {1514#(= |sll_length_#res| 2)} is VALID [2018-11-14 17:28:35,025 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1514#(= |sll_length_#res| 2)} {1411#(= main_~len~1 2)} #108#return; {1521#(and (= |main_#t~ret11| 2) (= main_~len~1 2))} is VALID [2018-11-14 17:28:35,025 INFO L273 TraceCheckUtils]: 41: Hoare triple {1521#(and (= |main_#t~ret11| 2) (= main_~len~1 2))} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {1521#(and (= |main_#t~ret11| 2) (= main_~len~1 2))} is VALID [2018-11-14 17:28:35,026 INFO L273 TraceCheckUtils]: 42: Hoare triple {1521#(and (= |main_#t~ret11| 2) (= main_~len~1 2))} assume ~len~1 != #t~ret11;havoc #t~ret11; {1379#false} is VALID [2018-11-14 17:28:35,026 INFO L273 TraceCheckUtils]: 43: Hoare triple {1379#false} assume !false; {1379#false} is VALID [2018-11-14 17:28:35,029 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 17:28:35,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:28:35,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 21 [2018-11-14 17:28:35,049 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2018-11-14 17:28:35,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:28:35,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-14 17:28:35,131 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:28:35,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-14 17:28:35,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-14 17:28:35,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-11-14 17:28:35,132 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 21 states. [2018-11-14 17:28:37,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:37,280 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-11-14 17:28:37,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 17:28:37,280 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2018-11-14 17:28:37,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:28:37,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 17:28:37,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 74 transitions. [2018-11-14 17:28:37,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 17:28:37,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 74 transitions. [2018-11-14 17:28:37,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 74 transitions. [2018-11-14 17:28:37,421 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:28:37,424 INFO L225 Difference]: With dead ends: 67 [2018-11-14 17:28:37,424 INFO L226 Difference]: Without dead ends: 60 [2018-11-14 17:28:37,425 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2018-11-14 17:28:37,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-14 17:28:37,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 47. [2018-11-14 17:28:37,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:28:37,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 47 states. [2018-11-14 17:28:37,470 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 47 states. [2018-11-14 17:28:37,470 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 47 states. [2018-11-14 17:28:37,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:37,474 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-11-14 17:28:37,475 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-11-14 17:28:37,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:28:37,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:28:37,476 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 60 states. [2018-11-14 17:28:37,476 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 60 states. [2018-11-14 17:28:37,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:37,479 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-11-14 17:28:37,479 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-11-14 17:28:37,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:28:37,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:28:37,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:28:37,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:28:37,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 17:28:37,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-11-14 17:28:37,481 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 44 [2018-11-14 17:28:37,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:28:37,482 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-11-14 17:28:37,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-14 17:28:37,482 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-11-14 17:28:37,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-14 17:28:37,483 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:28:37,483 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:28:37,483 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:28:37,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:28:37,483 INFO L82 PathProgramCache]: Analyzing trace with hash 2018625608, now seen corresponding path program 4 times [2018-11-14 17:28:37,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:28:37,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:28:37,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:37,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:28:37,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 17:28:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 17:28:37,566 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-14 17:28:37,607 WARN L170 areAnnotationChecker]: exitENTRY has no Hoare annotation [2018-11-14 17:28:37,608 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-14 17:28:37,608 WARN L170 areAnnotationChecker]: sll_destroyENTRY has no Hoare annotation [2018-11-14 17:28:37,608 WARN L170 areAnnotationChecker]: __bswap_32ENTRY has no Hoare annotation [2018-11-14 17:28:37,608 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 17:28:37,608 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 17:28:37,608 WARN L170 areAnnotationChecker]: __bswap_64ENTRY has no Hoare annotation [2018-11-14 17:28:37,608 WARN L170 areAnnotationChecker]: sll_createENTRY has no Hoare annotation [2018-11-14 17:28:37,608 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-14 17:28:37,608 WARN L170 areAnnotationChecker]: sll_lengthENTRY has no Hoare annotation [2018-11-14 17:28:37,609 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 17:28:37,609 WARN L170 areAnnotationChecker]: L585-3 has no Hoare annotation [2018-11-14 17:28:37,609 WARN L170 areAnnotationChecker]: L585-3 has no Hoare annotation [2018-11-14 17:28:37,609 WARN L170 areAnnotationChecker]: __bswap_32FINAL has no Hoare annotation [2018-11-14 17:28:37,609 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 17:28:37,609 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 17:28:37,609 WARN L170 areAnnotationChecker]: __bswap_64FINAL has no Hoare annotation [2018-11-14 17:28:37,609 WARN L170 areAnnotationChecker]: L565-3 has no Hoare annotation [2018-11-14 17:28:37,609 WARN L170 areAnnotationChecker]: L565-3 has no Hoare annotation [2018-11-14 17:28:37,609 WARN L170 areAnnotationChecker]: L593-6 has no Hoare annotation [2018-11-14 17:28:37,610 WARN L170 areAnnotationChecker]: L593-6 has no Hoare annotation [2018-11-14 17:28:37,610 WARN L170 areAnnotationChecker]: L578-3 has no Hoare annotation [2018-11-14 17:28:37,610 WARN L170 areAnnotationChecker]: L578-3 has no Hoare annotation [2018-11-14 17:28:37,610 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 17:28:37,610 WARN L170 areAnnotationChecker]: L585-1 has no Hoare annotation [2018-11-14 17:28:37,610 WARN L170 areAnnotationChecker]: L585-1 has no Hoare annotation [2018-11-14 17:28:37,610 WARN L170 areAnnotationChecker]: L585-4 has no Hoare annotation [2018-11-14 17:28:37,610 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:28:37,610 WARN L170 areAnnotationChecker]: L565-1 has no Hoare annotation [2018-11-14 17:28:37,611 WARN L170 areAnnotationChecker]: L565-1 has no Hoare annotation [2018-11-14 17:28:37,611 WARN L170 areAnnotationChecker]: L565-4 has no Hoare annotation [2018-11-14 17:28:37,611 WARN L170 areAnnotationChecker]: L593-1 has no Hoare annotation [2018-11-14 17:28:37,611 WARN L170 areAnnotationChecker]: L593-7 has no Hoare annotation [2018-11-14 17:28:37,611 WARN L170 areAnnotationChecker]: L593-7 has no Hoare annotation [2018-11-14 17:28:37,611 WARN L170 areAnnotationChecker]: L578-1 has no Hoare annotation [2018-11-14 17:28:37,611 WARN L170 areAnnotationChecker]: L578-1 has no Hoare annotation [2018-11-14 17:28:37,611 WARN L170 areAnnotationChecker]: L578-4 has no Hoare annotation [2018-11-14 17:28:37,611 WARN L170 areAnnotationChecker]: sll_destroyEXIT has no Hoare annotation [2018-11-14 17:28:37,611 WARN L170 areAnnotationChecker]: L567 has no Hoare annotation [2018-11-14 17:28:37,611 WARN L170 areAnnotationChecker]: L567 has no Hoare annotation [2018-11-14 17:28:37,611 WARN L170 areAnnotationChecker]: sll_createFINAL has no Hoare annotation [2018-11-14 17:28:37,611 WARN L170 areAnnotationChecker]: L593-2 has no Hoare annotation [2018-11-14 17:28:37,611 WARN L170 areAnnotationChecker]: L593-2 has no Hoare annotation [2018-11-14 17:28:37,611 WARN L170 areAnnotationChecker]: L596 has no Hoare annotation [2018-11-14 17:28:37,612 WARN L170 areAnnotationChecker]: sll_lengthFINAL has no Hoare annotation [2018-11-14 17:28:37,612 WARN L170 areAnnotationChecker]: L600-1 has no Hoare annotation [2018-11-14 17:28:37,612 WARN L170 areAnnotationChecker]: L568 has no Hoare annotation [2018-11-14 17:28:37,612 WARN L170 areAnnotationChecker]: L568 has no Hoare annotation [2018-11-14 17:28:37,612 WARN L170 areAnnotationChecker]: L567-1 has no Hoare annotation [2018-11-14 17:28:37,612 WARN L170 areAnnotationChecker]: sll_createEXIT has no Hoare annotation [2018-11-14 17:28:37,612 WARN L170 areAnnotationChecker]: L593-4 has no Hoare annotation [2018-11-14 17:28:37,612 WARN L170 areAnnotationChecker]: L593-4 has no Hoare annotation [2018-11-14 17:28:37,612 WARN L170 areAnnotationChecker]: L597 has no Hoare annotation [2018-11-14 17:28:37,612 WARN L170 areAnnotationChecker]: L597 has no Hoare annotation [2018-11-14 17:28:37,612 WARN L170 areAnnotationChecker]: sll_lengthEXIT has no Hoare annotation [2018-11-14 17:28:37,612 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 17:28:37,612 WARN L170 areAnnotationChecker]: L597-1 has no Hoare annotation [2018-11-14 17:28:37,612 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 17:28:37,612 WARN L170 areAnnotationChecker]: L597-2 has no Hoare annotation [2018-11-14 17:28:37,613 WARN L170 areAnnotationChecker]: L597-2 has no Hoare annotation [2018-11-14 17:28:37,613 WARN L170 areAnnotationChecker]: L598 has no Hoare annotation [2018-11-14 17:28:37,613 WARN L170 areAnnotationChecker]: L598 has no Hoare annotation [2018-11-14 17:28:37,613 WARN L170 areAnnotationChecker]: L600 has no Hoare annotation [2018-11-14 17:28:37,613 WARN L170 areAnnotationChecker]: L600 has no Hoare annotation [2018-11-14 17:28:37,613 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 17:28:37,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:28:37 BoogieIcfgContainer [2018-11-14 17:28:37,615 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 17:28:37,617 INFO L168 Benchmark]: Toolchain (without parser) took 13333.47 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 869.3 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -437.9 MB). Peak memory consumption was 431.3 MB. Max. memory is 7.1 GB. [2018-11-14 17:28:37,618 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:28:37,619 INFO L168 Benchmark]: CACSL2BoogieTranslator took 599.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-14 17:28:37,619 INFO L168 Benchmark]: Boogie Preprocessor took 166.81 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -815.4 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2018-11-14 17:28:37,620 INFO L168 Benchmark]: RCFGBuilder took 963.05 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 62.5 MB). Peak memory consumption was 62.5 MB. Max. memory is 7.1 GB. [2018-11-14 17:28:37,621 INFO L168 Benchmark]: TraceAbstraction took 11598.99 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 134.7 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 283.2 MB). Peak memory consumption was 417.9 MB. Max. memory is 7.1 GB. [2018-11-14 17:28:37,625 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 599.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 166.81 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -815.4 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 963.05 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 62.5 MB). Peak memory consumption was 62.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11598.99 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 134.7 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 283.2 MB). Peak memory consumption was 417.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 602]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L592] int len = 2; VAL [len=2] [L593] len < 32 && __VERIFIER_nondet_int() [L593] len < 32 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, len=2, len < 32 && __VERIFIER_nondet_int()=0] [L593] COND FALSE !(len < 32 && __VERIFIER_nondet_int()) [L596] CALL, EXPR sll_create(len + 1) VAL [\old(len)=3] [L564] SLL head = ((void *)0); VAL [\old(len)=3, head={0:0}, len=3] [L565] COND TRUE len > 0 [L566] EXPR, FCALL malloc(sizeof(struct node)) [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={0:0}, len=3, malloc(sizeof(struct node))={6:0}, new_head={6:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={0:0}, len=3, malloc(sizeof(struct node))={6:0}, new_head={6:0}] [L570] FCALL new_head->next = head [L571] head = new_head [L572] len-- VAL [\old(len)=3, head={6:0}, len=2, malloc(sizeof(struct node))={6:0}, new_head={6:0}] [L565] COND TRUE len > 0 [L566] EXPR, FCALL malloc(sizeof(struct node)) [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={6:0}, len=2, malloc(sizeof(struct node))={7:0}, new_head={7:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={6:0}, len=2, malloc(sizeof(struct node))={7:0}, new_head={7:0}] [L570] FCALL new_head->next = head [L571] head = new_head [L572] len-- VAL [\old(len)=3, head={7:0}, len=1, malloc(sizeof(struct node))={7:0}, new_head={7:0}] [L565] COND TRUE len > 0 [L566] EXPR, FCALL malloc(sizeof(struct node)) [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={7:0}, len=1, malloc(sizeof(struct node))={9:0}, new_head={9:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={7:0}, len=1, malloc(sizeof(struct node))={9:0}, new_head={9:0}] [L570] FCALL new_head->next = head [L571] head = new_head [L572] len-- VAL [\old(len)=3, head={9:0}, len=0, malloc(sizeof(struct node))={9:0}, new_head={9:0}] [L565] COND FALSE !(len > 0) VAL [\old(len)=3, head={9:0}, len=0, malloc(sizeof(struct node))={9:0}, new_head={9:0}] [L574] RET return head; VAL [\old(len)=3, \result={9:0}, head={9:0}, len=0, malloc(sizeof(struct node))={9:0}, new_head={9:0}] [L596] EXPR sll_create(len + 1) VAL [len=2, sll_create(len + 1)={9:0}] [L596] SLL s = sll_create(len + 1); [L597] CALL, EXPR sll_length(s) VAL [head={9:0}] [L577] int len = 0; VAL [head={9:0}, head={9:0}, len=0] [L578] COND TRUE \read(head) [L579] len++ [L580] EXPR, FCALL head->next [L580] head = head->next [L578] COND TRUE \read(head) [L579] len++ [L580] EXPR, FCALL head->next [L580] head = head->next [L578] COND TRUE \read(head) [L579] len++ [L580] EXPR, FCALL head->next [L580] head = head->next [L578] COND FALSE !(\read(head)) VAL [head={0:0}, head={9:0}, len=3] [L582] RET return len; VAL [\result=3, head={0:0}, head={9:0}, len=3] [L597] EXPR sll_length(s) VAL [len=2, s={9:0}, sll_length(s)=3] [L597] COND TRUE len != sll_length(s) [L602] __VERIFIER_error() VAL [len=2, s={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 53 locations, 1 error locations. UNSAFE Result, 11.5s OverallTime, 7 OverallIterations, 4 TraceHistogramMax, 7.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 193 SDtfs, 116 SDslu, 1121 SDs, 0 SdLazy, 726 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 192 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 21 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 361 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 306 ConstructedInterpolants, 0 QuantifiedInterpolants, 35231 SizeOfPredicates, 5 NumberOfNonLiveVariables, 427 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 36/78 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...