/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./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-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:33:12,529 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:33:12,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:33:12,544 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:33:12,544 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:33:12,545 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:33:12,547 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:33:12,548 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:33:12,550 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:33:12,551 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:33:12,552 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:33:12,553 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:33:12,553 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:33:12,554 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:33:12,555 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:33:12,557 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:33:12,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:33:12,558 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:33:12,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:33:12,562 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:33:12,564 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:33:12,565 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:33:12,566 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:33:12,567 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:33:12,569 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:33:12,569 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:33:12,570 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:33:12,570 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:33:12,571 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:33:12,572 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:33:12,572 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:33:12,573 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:33:12,574 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:33:12,574 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:33:12,575 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:33:12,576 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:33:12,576 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:33:12,576 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:33:12,577 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:33:12,577 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:33:12,578 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:33:12,579 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:33:12,594 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:33:12,594 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:33:12,595 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:33:12,596 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:33:12,596 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:33:12,596 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:33:12,596 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:33:12,597 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:33:12,597 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:33:12,597 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:33:12,597 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:33:12,597 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:33:12,597 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:33:12,598 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:33:12,598 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:33:12,598 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:33:12,598 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:33:12,598 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:33:12,599 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:33:12,599 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:33:12,599 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:33:12,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:33:12,599 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:33:12,600 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:33:12,600 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:33:12,600 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:33:12,600 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:33:12,600 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:33:12,600 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:33:12,600 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:33:12,877 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:33:12,893 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:33:12,898 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:33:12,899 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:33:12,900 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:33:12,901 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/sll_length_check-1.i [2020-07-17 22:33:12,976 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bed70b298/5e12eb25fbd547c297981798fcde9880/FLAG134169fa7 [2020-07-17 22:33:13,562 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:33:13,562 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_length_check-1.i [2020-07-17 22:33:13,574 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bed70b298/5e12eb25fbd547c297981798fcde9880/FLAG134169fa7 [2020-07-17 22:33:13,813 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bed70b298/5e12eb25fbd547c297981798fcde9880 [2020-07-17 22:33:13,822 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:33:13,825 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:33:13,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:33:13,827 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:33:13,832 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:33:13,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:33:13" (1/1) ... [2020-07-17 22:33:13,837 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b09878f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:33:13, skipping insertion in model container [2020-07-17 22:33:13,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:33:13" (1/1) ... [2020-07-17 22:33:13,845 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:33:13,896 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:33:14,418 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:33:14,429 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:33:14,486 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:33:14,545 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:33:14,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:33:14 WrapperNode [2020-07-17 22:33:14,546 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:33:14,546 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:33:14,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:33:14,547 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:33:14,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:33:14" (1/1) ... [2020-07-17 22:33:14,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:33:14" (1/1) ... [2020-07-17 22:33:14,578 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:33:14" (1/1) ... [2020-07-17 22:33:14,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:33:14" (1/1) ... [2020-07-17 22:33:14,599 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:33:14" (1/1) ... [2020-07-17 22:33:14,605 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:33:14" (1/1) ... [2020-07-17 22:33:14,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:33:14" (1/1) ... [2020-07-17 22:33:14,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:33:14,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:33:14,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:33:14,617 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:33:14,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:33:14" (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 [2020-07-17 22:33:14,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:33:14,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:33:14,687 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-17 22:33:14,687 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-17 22:33:14,687 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-17 22:33:14,687 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2020-07-17 22:33:14,687 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_length [2020-07-17 22:33:14,687 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2020-07-17 22:33:14,687 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:33:14,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:33:14,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:33:14,688 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-17 22:33:14,688 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-17 22:33:14,688 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-17 22:33:14,688 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-17 22:33:14,689 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-17 22:33:14,689 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-17 22:33:14,689 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-17 22:33:14,689 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-17 22:33:14,689 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-17 22:33:14,689 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-17 22:33:14,690 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-17 22:33:14,690 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-17 22:33:14,690 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-17 22:33:14,690 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-17 22:33:14,690 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-17 22:33:14,690 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-17 22:33:14,691 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-17 22:33:14,691 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-17 22:33:14,691 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-17 22:33:14,691 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-17 22:33:14,691 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-17 22:33:14,691 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-17 22:33:14,691 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-17 22:33:14,692 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-17 22:33:14,692 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-17 22:33:14,692 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-17 22:33:14,692 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-17 22:33:14,692 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-17 22:33:14,692 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-17 22:33:14,692 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-17 22:33:14,693 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-17 22:33:14,693 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-17 22:33:14,693 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-17 22:33:14,693 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-17 22:33:14,693 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-17 22:33:14,693 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-17 22:33:14,694 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-17 22:33:14,694 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-17 22:33:14,694 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-17 22:33:14,694 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-17 22:33:14,694 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-17 22:33:14,694 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-17 22:33:14,695 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-17 22:33:14,695 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-17 22:33:14,695 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-17 22:33:14,695 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-17 22:33:14,695 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-17 22:33:14,695 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-17 22:33:14,696 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-17 22:33:14,696 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-17 22:33:14,696 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-17 22:33:14,696 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-17 22:33:14,696 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 22:33:14,696 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-17 22:33:14,696 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-17 22:33:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-17 22:33:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-17 22:33:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-17 22:33:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-17 22:33:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-17 22:33:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-17 22:33:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:33:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-17 22:33:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-17 22:33:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-17 22:33:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-17 22:33:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-17 22:33:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-17 22:33:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-17 22:33:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-17 22:33:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-17 22:33:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-17 22:33:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-17 22:33:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-17 22:33:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-17 22:33:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-17 22:33:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-17 22:33:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-17 22:33:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-17 22:33:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-17 22:33:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-17 22:33:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-17 22:33:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-17 22:33:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-17 22:33:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-17 22:33:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-17 22:33:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-17 22:33:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-17 22:33:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-17 22:33:14,702 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-17 22:33:14,702 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-17 22:33:14,702 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-17 22:33:14,702 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-17 22:33:14,702 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-17 22:33:14,702 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-17 22:33:14,703 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-17 22:33:14,703 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-17 22:33:14,703 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-17 22:33:14,703 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-17 22:33:14,703 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-17 22:33:14,703 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-17 22:33:14,703 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-17 22:33:14,703 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-17 22:33:14,703 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-17 22:33:14,703 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-17 22:33:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-17 22:33:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2020-07-17 22:33:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 22:33:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-17 22:33:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure sll_length [2020-07-17 22:33:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-17 22:33:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2020-07-17 22:33:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:33:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:33:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:33:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:33:15,072 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-17 22:33:15,314 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:33:15,315 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-17 22:33:15,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:33:15 BoogieIcfgContainer [2020-07-17 22:33:15,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:33:15,320 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:33:15,321 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:33:15,324 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:33:15,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:33:13" (1/3) ... [2020-07-17 22:33:15,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ed80f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:33:15, skipping insertion in model container [2020-07-17 22:33:15,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:33:14" (2/3) ... [2020-07-17 22:33:15,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ed80f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:33:15, skipping insertion in model container [2020-07-17 22:33:15,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:33:15" (3/3) ... [2020-07-17 22:33:15,329 INFO L109 eAbstractionObserver]: Analyzing ICFG sll_length_check-1.i [2020-07-17 22:33:15,340 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:33:15,349 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:33:15,365 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:33:15,391 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:33:15,391 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:33:15,392 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:33:15,392 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:33:15,392 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:33:15,393 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:33:15,393 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:33:15,393 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:33:15,414 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2020-07-17 22:33:15,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:33:15,422 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:33:15,424 INFO L422 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] [2020-07-17 22:33:15,424 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:33:15,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:33:15,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1666427650, now seen corresponding path program 1 times [2020-07-17 22:33:15,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:33:15,444 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629078599] [2020-07-17 22:33:15,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:33:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:15,662 INFO L280 TraceCheckUtils]: 0: Hoare triple {59#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {44#true} is VALID [2020-07-17 22:33:15,663 INFO L280 TraceCheckUtils]: 1: Hoare triple {44#true} assume true; {44#true} is VALID [2020-07-17 22:33:15,664 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {44#true} {44#true} #109#return; {44#true} is VALID [2020-07-17 22:33:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:15,702 INFO L280 TraceCheckUtils]: 0: Hoare triple {60#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {44#true} is VALID [2020-07-17 22:33:15,704 INFO L280 TraceCheckUtils]: 1: Hoare triple {44#true} assume !true; {45#false} is VALID [2020-07-17 22:33:15,704 INFO L280 TraceCheckUtils]: 2: Hoare triple {45#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {45#false} is VALID [2020-07-17 22:33:15,705 INFO L280 TraceCheckUtils]: 3: Hoare triple {45#false} assume true; {45#false} is VALID [2020-07-17 22:33:15,705 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {45#false} {45#false} #103#return; {45#false} is VALID [2020-07-17 22:33:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:15,719 INFO L280 TraceCheckUtils]: 0: Hoare triple {44#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {44#true} is VALID [2020-07-17 22:33:15,720 INFO L280 TraceCheckUtils]: 1: Hoare triple {44#true} assume !true; {45#false} is VALID [2020-07-17 22:33:15,720 INFO L280 TraceCheckUtils]: 2: Hoare triple {45#false} #res := ~len~0; {45#false} is VALID [2020-07-17 22:33:15,721 INFO L280 TraceCheckUtils]: 3: Hoare triple {45#false} assume true; {45#false} is VALID [2020-07-17 22:33:15,721 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {45#false} {45#false} #105#return; {45#false} is VALID [2020-07-17 22:33:15,723 INFO L263 TraceCheckUtils]: 0: Hoare triple {44#true} call ULTIMATE.init(); {59#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:33:15,724 INFO L280 TraceCheckUtils]: 1: Hoare triple {59#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {44#true} is VALID [2020-07-17 22:33:15,724 INFO L280 TraceCheckUtils]: 2: Hoare triple {44#true} assume true; {44#true} is VALID [2020-07-17 22:33:15,725 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {44#true} {44#true} #109#return; {44#true} is VALID [2020-07-17 22:33:15,725 INFO L263 TraceCheckUtils]: 4: Hoare triple {44#true} call #t~ret12 := main(); {44#true} is VALID [2020-07-17 22:33:15,725 INFO L280 TraceCheckUtils]: 5: Hoare triple {44#true} ~len~1 := 2; {44#true} is VALID [2020-07-17 22:33:15,751 INFO L280 TraceCheckUtils]: 6: Hoare triple {44#true} assume !true; {45#false} is VALID [2020-07-17 22:33:15,751 INFO L263 TraceCheckUtils]: 7: Hoare triple {45#false} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {60#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:33:15,751 INFO L280 TraceCheckUtils]: 8: Hoare triple {60#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {44#true} is VALID [2020-07-17 22:33:15,752 INFO L280 TraceCheckUtils]: 9: Hoare triple {44#true} assume !true; {45#false} is VALID [2020-07-17 22:33:15,753 INFO L280 TraceCheckUtils]: 10: Hoare triple {45#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {45#false} is VALID [2020-07-17 22:33:15,753 INFO L280 TraceCheckUtils]: 11: Hoare triple {45#false} assume true; {45#false} is VALID [2020-07-17 22:33:15,753 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {45#false} {45#false} #103#return; {45#false} is VALID [2020-07-17 22:33:15,754 INFO L280 TraceCheckUtils]: 13: Hoare triple {45#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset; {45#false} is VALID [2020-07-17 22:33:15,754 INFO L263 TraceCheckUtils]: 14: Hoare triple {45#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {44#true} is VALID [2020-07-17 22:33:15,754 INFO L280 TraceCheckUtils]: 15: Hoare triple {44#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {44#true} is VALID [2020-07-17 22:33:15,757 INFO L280 TraceCheckUtils]: 16: Hoare triple {44#true} assume !true; {45#false} is VALID [2020-07-17 22:33:15,758 INFO L280 TraceCheckUtils]: 17: Hoare triple {45#false} #res := ~len~0; {45#false} is VALID [2020-07-17 22:33:15,758 INFO L280 TraceCheckUtils]: 18: Hoare triple {45#false} assume true; {45#false} is VALID [2020-07-17 22:33:15,759 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {45#false} {45#false} #105#return; {45#false} is VALID [2020-07-17 22:33:15,759 INFO L280 TraceCheckUtils]: 20: Hoare triple {45#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {45#false} is VALID [2020-07-17 22:33:15,759 INFO L280 TraceCheckUtils]: 21: Hoare triple {45#false} assume ~len~1 != #t~ret11;havoc #t~ret11; {45#false} is VALID [2020-07-17 22:33:15,760 INFO L280 TraceCheckUtils]: 22: Hoare triple {45#false} assume !false; {45#false} is VALID [2020-07-17 22:33:15,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:33:15,765 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629078599] [2020-07-17 22:33:15,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:33:15,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:33:15,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62208756] [2020-07-17 22:33:15,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-07-17 22:33:15,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:33:15,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:33:15,824 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:15,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:33:15,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:33:15,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:33:15,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:33:15,838 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 4 states. [2020-07-17 22:33:16,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:16,357 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2020-07-17 22:33:16,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:33:16,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-07-17 22:33:16,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:33:16,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:33:16,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2020-07-17 22:33:16,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:33:16,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2020-07-17 22:33:16,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 120 transitions. [2020-07-17 22:33:16,634 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:16,648 INFO L225 Difference]: With dead ends: 90 [2020-07-17 22:33:16,648 INFO L226 Difference]: Without dead ends: 38 [2020-07-17 22:33:16,653 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:33:16,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-17 22:33:16,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2020-07-17 22:33:16,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:33:16,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 28 states. [2020-07-17 22:33:16,719 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 28 states. [2020-07-17 22:33:16,719 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 28 states. [2020-07-17 22:33:16,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:16,725 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-17 22:33:16,726 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-17 22:33:16,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:16,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:16,727 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 38 states. [2020-07-17 22:33:16,727 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 38 states. [2020-07-17 22:33:16,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:16,732 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-17 22:33:16,732 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-17 22:33:16,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:16,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:16,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:33:16,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:33:16,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-17 22:33:16,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2020-07-17 22:33:16,738 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 23 [2020-07-17 22:33:16,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:33:16,739 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2020-07-17 22:33:16,739 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:33:16,739 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-17 22:33:16,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-17 22:33:16,741 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:33:16,741 INFO L422 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] [2020-07-17 22:33:16,741 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:33:16,742 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:33:16,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:33:16,742 INFO L82 PathProgramCache]: Analyzing trace with hash -29727073, now seen corresponding path program 1 times [2020-07-17 22:33:16,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:33:16,743 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126438434] [2020-07-17 22:33:16,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:33:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:16,859 INFO L280 TraceCheckUtils]: 0: Hoare triple {324#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {308#true} is VALID [2020-07-17 22:33:16,860 INFO L280 TraceCheckUtils]: 1: Hoare triple {308#true} assume true; {308#true} is VALID [2020-07-17 22:33:16,860 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {308#true} {308#true} #109#return; {308#true} is VALID [2020-07-17 22:33:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:16,954 INFO L280 TraceCheckUtils]: 0: Hoare triple {325#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {326#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-17 22:33:16,955 INFO L280 TraceCheckUtils]: 1: Hoare triple {326#(= |sll_create_#in~len| sll_create_~len)} assume !(~len > 0); {327#(<= |sll_create_#in~len| 0)} is VALID [2020-07-17 22:33:16,955 INFO L280 TraceCheckUtils]: 2: Hoare triple {327#(<= |sll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {327#(<= |sll_create_#in~len| 0)} is VALID [2020-07-17 22:33:16,956 INFO L280 TraceCheckUtils]: 3: Hoare triple {327#(<= |sll_create_#in~len| 0)} assume true; {327#(<= |sll_create_#in~len| 0)} is VALID [2020-07-17 22:33:16,958 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {327#(<= |sll_create_#in~len| 0)} {313#(<= 2 main_~len~1)} #103#return; {309#false} is VALID [2020-07-17 22:33:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:16,967 INFO L280 TraceCheckUtils]: 0: Hoare triple {308#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {308#true} is VALID [2020-07-17 22:33:16,967 INFO L280 TraceCheckUtils]: 1: Hoare triple {308#true} assume !(~head.base != 0 || ~head.offset != 0); {308#true} is VALID [2020-07-17 22:33:16,968 INFO L280 TraceCheckUtils]: 2: Hoare triple {308#true} #res := ~len~0; {308#true} is VALID [2020-07-17 22:33:16,968 INFO L280 TraceCheckUtils]: 3: Hoare triple {308#true} assume true; {308#true} is VALID [2020-07-17 22:33:16,968 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {308#true} {309#false} #105#return; {309#false} is VALID [2020-07-17 22:33:16,969 INFO L263 TraceCheckUtils]: 0: Hoare triple {308#true} call ULTIMATE.init(); {324#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:33:16,970 INFO L280 TraceCheckUtils]: 1: Hoare triple {324#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {308#true} is VALID [2020-07-17 22:33:16,970 INFO L280 TraceCheckUtils]: 2: Hoare triple {308#true} assume true; {308#true} is VALID [2020-07-17 22:33:16,970 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {308#true} {308#true} #109#return; {308#true} is VALID [2020-07-17 22:33:16,971 INFO L263 TraceCheckUtils]: 4: Hoare triple {308#true} call #t~ret12 := main(); {308#true} is VALID [2020-07-17 22:33:16,972 INFO L280 TraceCheckUtils]: 5: Hoare triple {308#true} ~len~1 := 2; {313#(<= 2 main_~len~1)} is VALID [2020-07-17 22:33:16,972 INFO L280 TraceCheckUtils]: 6: Hoare triple {313#(<= 2 main_~len~1)} #t~short8 := ~len~1 < 32; {313#(<= 2 main_~len~1)} is VALID [2020-07-17 22:33:16,973 INFO L280 TraceCheckUtils]: 7: Hoare triple {313#(<= 2 main_~len~1)} assume #t~short8;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;#t~short8 := 0 != #t~nondet7; {313#(<= 2 main_~len~1)} is VALID [2020-07-17 22:33:16,974 INFO L280 TraceCheckUtils]: 8: Hoare triple {313#(<= 2 main_~len~1)} assume !#t~short8;havoc #t~nondet7;havoc #t~short8; {313#(<= 2 main_~len~1)} is VALID [2020-07-17 22:33:16,975 INFO L263 TraceCheckUtils]: 9: Hoare triple {313#(<= 2 main_~len~1)} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {325#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:33:16,976 INFO L280 TraceCheckUtils]: 10: Hoare triple {325#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {326#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-17 22:33:16,977 INFO L280 TraceCheckUtils]: 11: Hoare triple {326#(= |sll_create_#in~len| sll_create_~len)} assume !(~len > 0); {327#(<= |sll_create_#in~len| 0)} is VALID [2020-07-17 22:33:16,978 INFO L280 TraceCheckUtils]: 12: Hoare triple {327#(<= |sll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {327#(<= |sll_create_#in~len| 0)} is VALID [2020-07-17 22:33:16,978 INFO L280 TraceCheckUtils]: 13: Hoare triple {327#(<= |sll_create_#in~len| 0)} assume true; {327#(<= |sll_create_#in~len| 0)} is VALID [2020-07-17 22:33:16,980 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {327#(<= |sll_create_#in~len| 0)} {313#(<= 2 main_~len~1)} #103#return; {309#false} is VALID [2020-07-17 22:33:16,980 INFO L280 TraceCheckUtils]: 15: Hoare triple {309#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset; {309#false} is VALID [2020-07-17 22:33:16,981 INFO L263 TraceCheckUtils]: 16: Hoare triple {309#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {308#true} is VALID [2020-07-17 22:33:16,981 INFO L280 TraceCheckUtils]: 17: Hoare triple {308#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {308#true} is VALID [2020-07-17 22:33:16,981 INFO L280 TraceCheckUtils]: 18: Hoare triple {308#true} assume !(~head.base != 0 || ~head.offset != 0); {308#true} is VALID [2020-07-17 22:33:16,982 INFO L280 TraceCheckUtils]: 19: Hoare triple {308#true} #res := ~len~0; {308#true} is VALID [2020-07-17 22:33:16,982 INFO L280 TraceCheckUtils]: 20: Hoare triple {308#true} assume true; {308#true} is VALID [2020-07-17 22:33:16,982 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {308#true} {309#false} #105#return; {309#false} is VALID [2020-07-17 22:33:16,982 INFO L280 TraceCheckUtils]: 22: Hoare triple {309#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {309#false} is VALID [2020-07-17 22:33:16,983 INFO L280 TraceCheckUtils]: 23: Hoare triple {309#false} assume ~len~1 != #t~ret11;havoc #t~ret11; {309#false} is VALID [2020-07-17 22:33:16,983 INFO L280 TraceCheckUtils]: 24: Hoare triple {309#false} assume !false; {309#false} is VALID [2020-07-17 22:33:16,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:33:16,985 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126438434] [2020-07-17 22:33:16,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:33:16,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-17 22:33:16,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683013624] [2020-07-17 22:33:16,987 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-07-17 22:33:16,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:33:16,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:33:17,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:17,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:33:17,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:33:17,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:33:17,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:33:17,022 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 7 states. [2020-07-17 22:33:17,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:17,491 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2020-07-17 22:33:17,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:33:17,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-07-17 22:33:17,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:33:17,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:33:17,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2020-07-17 22:33:17,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:33:17,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2020-07-17 22:33:17,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2020-07-17 22:33:17,572 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:17,575 INFO L225 Difference]: With dead ends: 45 [2020-07-17 22:33:17,575 INFO L226 Difference]: Without dead ends: 31 [2020-07-17 22:33:17,578 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:33:17,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-17 22:33:17,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2020-07-17 22:33:17,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:33:17,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 29 states. [2020-07-17 22:33:17,615 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 29 states. [2020-07-17 22:33:17,615 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 29 states. [2020-07-17 22:33:17,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:17,620 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2020-07-17 22:33:17,620 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-07-17 22:33:17,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:17,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:17,622 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 31 states. [2020-07-17 22:33:17,622 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 31 states. [2020-07-17 22:33:17,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:17,626 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2020-07-17 22:33:17,626 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-07-17 22:33:17,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:17,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:17,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:33:17,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:33:17,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-17 22:33:17,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2020-07-17 22:33:17,633 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 25 [2020-07-17 22:33:17,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:33:17,633 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2020-07-17 22:33:17,633 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:33:17,634 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2020-07-17 22:33:17,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-17 22:33:17,636 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:33:17,637 INFO L422 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] [2020-07-17 22:33:17,637 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:33:17,638 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:33:17,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:33:17,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1680455870, now seen corresponding path program 1 times [2020-07-17 22:33:17,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:33:17,639 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853958281] [2020-07-17 22:33:17,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:33:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:17,773 INFO L280 TraceCheckUtils]: 0: Hoare triple {524#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {505#true} is VALID [2020-07-17 22:33:17,774 INFO L280 TraceCheckUtils]: 1: Hoare triple {505#true} assume true; {505#true} is VALID [2020-07-17 22:33:17,774 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {505#true} {505#true} #109#return; {505#true} is VALID [2020-07-17 22:33:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:17,898 INFO L280 TraceCheckUtils]: 0: Hoare triple {525#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {526#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-17 22:33:17,899 INFO L280 TraceCheckUtils]: 1: Hoare triple {526#(= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {526#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-17 22:33:17,900 INFO L280 TraceCheckUtils]: 2: Hoare triple {526#(= |sll_create_#in~len| sll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {526#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-17 22:33:17,901 INFO L280 TraceCheckUtils]: 3: Hoare triple {526#(= |sll_create_#in~len| sll_create_~len)} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 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; {527#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-17 22:33:17,902 INFO L280 TraceCheckUtils]: 4: Hoare triple {527#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(~len > 0); {528#(<= |sll_create_#in~len| 1)} is VALID [2020-07-17 22:33:17,903 INFO L280 TraceCheckUtils]: 5: Hoare triple {528#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {528#(<= |sll_create_#in~len| 1)} is VALID [2020-07-17 22:33:17,904 INFO L280 TraceCheckUtils]: 6: Hoare triple {528#(<= |sll_create_#in~len| 1)} assume true; {528#(<= |sll_create_#in~len| 1)} is VALID [2020-07-17 22:33:17,905 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {528#(<= |sll_create_#in~len| 1)} {510#(<= 2 main_~len~1)} #103#return; {506#false} is VALID [2020-07-17 22:33:17,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:17,919 INFO L280 TraceCheckUtils]: 0: Hoare triple {505#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {505#true} is VALID [2020-07-17 22:33:17,919 INFO L280 TraceCheckUtils]: 1: Hoare triple {505#true} assume !(~head.base != 0 || ~head.offset != 0); {505#true} is VALID [2020-07-17 22:33:17,920 INFO L280 TraceCheckUtils]: 2: Hoare triple {505#true} #res := ~len~0; {505#true} is VALID [2020-07-17 22:33:17,920 INFO L280 TraceCheckUtils]: 3: Hoare triple {505#true} assume true; {505#true} is VALID [2020-07-17 22:33:17,920 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {505#true} {506#false} #105#return; {506#false} is VALID [2020-07-17 22:33:17,922 INFO L263 TraceCheckUtils]: 0: Hoare triple {505#true} call ULTIMATE.init(); {524#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:33:17,922 INFO L280 TraceCheckUtils]: 1: Hoare triple {524#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {505#true} is VALID [2020-07-17 22:33:17,922 INFO L280 TraceCheckUtils]: 2: Hoare triple {505#true} assume true; {505#true} is VALID [2020-07-17 22:33:17,923 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {505#true} {505#true} #109#return; {505#true} is VALID [2020-07-17 22:33:17,923 INFO L263 TraceCheckUtils]: 4: Hoare triple {505#true} call #t~ret12 := main(); {505#true} is VALID [2020-07-17 22:33:17,926 INFO L280 TraceCheckUtils]: 5: Hoare triple {505#true} ~len~1 := 2; {510#(<= 2 main_~len~1)} is VALID [2020-07-17 22:33:17,927 INFO L280 TraceCheckUtils]: 6: Hoare triple {510#(<= 2 main_~len~1)} #t~short8 := ~len~1 < 32; {510#(<= 2 main_~len~1)} is VALID [2020-07-17 22:33:17,927 INFO L280 TraceCheckUtils]: 7: Hoare triple {510#(<= 2 main_~len~1)} assume #t~short8;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;#t~short8 := 0 != #t~nondet7; {510#(<= 2 main_~len~1)} is VALID [2020-07-17 22:33:17,928 INFO L280 TraceCheckUtils]: 8: Hoare triple {510#(<= 2 main_~len~1)} assume !#t~short8;havoc #t~nondet7;havoc #t~short8; {510#(<= 2 main_~len~1)} is VALID [2020-07-17 22:33:17,929 INFO L263 TraceCheckUtils]: 9: Hoare triple {510#(<= 2 main_~len~1)} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {525#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:33:17,930 INFO L280 TraceCheckUtils]: 10: Hoare triple {525#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {526#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-17 22:33:17,931 INFO L280 TraceCheckUtils]: 11: Hoare triple {526#(= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {526#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-17 22:33:17,932 INFO L280 TraceCheckUtils]: 12: Hoare triple {526#(= |sll_create_#in~len| sll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {526#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-17 22:33:17,938 INFO L280 TraceCheckUtils]: 13: Hoare triple {526#(= |sll_create_#in~len| sll_create_~len)} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 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; {527#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-17 22:33:17,939 INFO L280 TraceCheckUtils]: 14: Hoare triple {527#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(~len > 0); {528#(<= |sll_create_#in~len| 1)} is VALID [2020-07-17 22:33:17,941 INFO L280 TraceCheckUtils]: 15: Hoare triple {528#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {528#(<= |sll_create_#in~len| 1)} is VALID [2020-07-17 22:33:17,941 INFO L280 TraceCheckUtils]: 16: Hoare triple {528#(<= |sll_create_#in~len| 1)} assume true; {528#(<= |sll_create_#in~len| 1)} is VALID [2020-07-17 22:33:17,943 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {528#(<= |sll_create_#in~len| 1)} {510#(<= 2 main_~len~1)} #103#return; {506#false} is VALID [2020-07-17 22:33:17,943 INFO L280 TraceCheckUtils]: 18: Hoare triple {506#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset; {506#false} is VALID [2020-07-17 22:33:17,943 INFO L263 TraceCheckUtils]: 19: Hoare triple {506#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {505#true} is VALID [2020-07-17 22:33:17,943 INFO L280 TraceCheckUtils]: 20: Hoare triple {505#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {505#true} is VALID [2020-07-17 22:33:17,944 INFO L280 TraceCheckUtils]: 21: Hoare triple {505#true} assume !(~head.base != 0 || ~head.offset != 0); {505#true} is VALID [2020-07-17 22:33:17,944 INFO L280 TraceCheckUtils]: 22: Hoare triple {505#true} #res := ~len~0; {505#true} is VALID [2020-07-17 22:33:17,944 INFO L280 TraceCheckUtils]: 23: Hoare triple {505#true} assume true; {505#true} is VALID [2020-07-17 22:33:17,944 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {505#true} {506#false} #105#return; {506#false} is VALID [2020-07-17 22:33:17,945 INFO L280 TraceCheckUtils]: 25: Hoare triple {506#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {506#false} is VALID [2020-07-17 22:33:17,945 INFO L280 TraceCheckUtils]: 26: Hoare triple {506#false} assume ~len~1 != #t~ret11;havoc #t~ret11; {506#false} is VALID [2020-07-17 22:33:17,945 INFO L280 TraceCheckUtils]: 27: Hoare triple {506#false} assume !false; {506#false} is VALID [2020-07-17 22:33:17,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:33:17,947 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853958281] [2020-07-17 22:33:17,947 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960380872] [2020-07-17 22:33:17,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:33:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:18,054 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-17 22:33:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:18,075 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:33:18,175 INFO L263 TraceCheckUtils]: 0: Hoare triple {505#true} call ULTIMATE.init(); {505#true} is VALID [2020-07-17 22:33:18,175 INFO L280 TraceCheckUtils]: 1: Hoare triple {505#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {505#true} is VALID [2020-07-17 22:33:18,176 INFO L280 TraceCheckUtils]: 2: Hoare triple {505#true} assume true; {505#true} is VALID [2020-07-17 22:33:18,176 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {505#true} {505#true} #109#return; {505#true} is VALID [2020-07-17 22:33:18,176 INFO L263 TraceCheckUtils]: 4: Hoare triple {505#true} call #t~ret12 := main(); {505#true} is VALID [2020-07-17 22:33:18,177 INFO L280 TraceCheckUtils]: 5: Hoare triple {505#true} ~len~1 := 2; {510#(<= 2 main_~len~1)} is VALID [2020-07-17 22:33:18,178 INFO L280 TraceCheckUtils]: 6: Hoare triple {510#(<= 2 main_~len~1)} #t~short8 := ~len~1 < 32; {510#(<= 2 main_~len~1)} is VALID [2020-07-17 22:33:18,178 INFO L280 TraceCheckUtils]: 7: Hoare triple {510#(<= 2 main_~len~1)} assume #t~short8;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;#t~short8 := 0 != #t~nondet7; {510#(<= 2 main_~len~1)} is VALID [2020-07-17 22:33:18,179 INFO L280 TraceCheckUtils]: 8: Hoare triple {510#(<= 2 main_~len~1)} assume !#t~short8;havoc #t~nondet7;havoc #t~short8; {510#(<= 2 main_~len~1)} is VALID [2020-07-17 22:33:18,179 INFO L263 TraceCheckUtils]: 9: Hoare triple {510#(<= 2 main_~len~1)} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {505#true} is VALID [2020-07-17 22:33:18,180 INFO L280 TraceCheckUtils]: 10: Hoare triple {505#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {562#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-17 22:33:18,181 INFO L280 TraceCheckUtils]: 11: Hoare triple {562#(<= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {562#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-17 22:33:18,181 INFO L280 TraceCheckUtils]: 12: Hoare triple {562#(<= |sll_create_#in~len| sll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {562#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-17 22:33:18,183 INFO L280 TraceCheckUtils]: 13: Hoare triple {562#(<= |sll_create_#in~len| sll_create_~len)} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 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; {527#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-17 22:33:18,184 INFO L280 TraceCheckUtils]: 14: Hoare triple {527#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(~len > 0); {528#(<= |sll_create_#in~len| 1)} is VALID [2020-07-17 22:33:18,184 INFO L280 TraceCheckUtils]: 15: Hoare triple {528#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {528#(<= |sll_create_#in~len| 1)} is VALID [2020-07-17 22:33:18,185 INFO L280 TraceCheckUtils]: 16: Hoare triple {528#(<= |sll_create_#in~len| 1)} assume true; {528#(<= |sll_create_#in~len| 1)} is VALID [2020-07-17 22:33:18,187 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {528#(<= |sll_create_#in~len| 1)} {510#(<= 2 main_~len~1)} #103#return; {506#false} is VALID [2020-07-17 22:33:18,187 INFO L280 TraceCheckUtils]: 18: Hoare triple {506#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset; {506#false} is VALID [2020-07-17 22:33:18,187 INFO L263 TraceCheckUtils]: 19: Hoare triple {506#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {506#false} is VALID [2020-07-17 22:33:18,187 INFO L280 TraceCheckUtils]: 20: Hoare triple {506#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {506#false} is VALID [2020-07-17 22:33:18,188 INFO L280 TraceCheckUtils]: 21: Hoare triple {506#false} assume !(~head.base != 0 || ~head.offset != 0); {506#false} is VALID [2020-07-17 22:33:18,188 INFO L280 TraceCheckUtils]: 22: Hoare triple {506#false} #res := ~len~0; {506#false} is VALID [2020-07-17 22:33:18,188 INFO L280 TraceCheckUtils]: 23: Hoare triple {506#false} assume true; {506#false} is VALID [2020-07-17 22:33:18,188 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {506#false} {506#false} #105#return; {506#false} is VALID [2020-07-17 22:33:18,189 INFO L280 TraceCheckUtils]: 25: Hoare triple {506#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {506#false} is VALID [2020-07-17 22:33:18,189 INFO L280 TraceCheckUtils]: 26: Hoare triple {506#false} assume ~len~1 != #t~ret11;havoc #t~ret11; {506#false} is VALID [2020-07-17 22:33:18,189 INFO L280 TraceCheckUtils]: 27: Hoare triple {506#false} assume !false; {506#false} is VALID [2020-07-17 22:33:18,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:33:18,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:33:18,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2020-07-17 22:33:18,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013793072] [2020-07-17 22:33:18,192 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2020-07-17 22:33:18,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:33:18,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-17 22:33:18,255 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:18,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 22:33:18,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:33:18,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 22:33:18,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:33:18,256 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 9 states. [2020-07-17 22:33:18,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:18,759 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2020-07-17 22:33:18,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 22:33:18,759 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2020-07-17 22:33:18,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:33:18,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:33:18,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 52 transitions. [2020-07-17 22:33:18,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:33:18,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 52 transitions. [2020-07-17 22:33:18,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 52 transitions. [2020-07-17 22:33:18,842 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:18,844 INFO L225 Difference]: With dead ends: 48 [2020-07-17 22:33:18,844 INFO L226 Difference]: Without dead ends: 34 [2020-07-17 22:33:18,845 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2020-07-17 22:33:18,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-17 22:33:18,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-07-17 22:33:18,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:33:18,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2020-07-17 22:33:18,881 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2020-07-17 22:33:18,881 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2020-07-17 22:33:18,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:18,884 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2020-07-17 22:33:18,884 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2020-07-17 22:33:18,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:18,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:18,885 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2020-07-17 22:33:18,885 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2020-07-17 22:33:18,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:18,893 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2020-07-17 22:33:18,893 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2020-07-17 22:33:18,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:18,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:18,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:33:18,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:33:18,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-17 22:33:18,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2020-07-17 22:33:18,898 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 28 [2020-07-17 22:33:18,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:33:18,900 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2020-07-17 22:33:18,900 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 22:33:18,900 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-07-17 22:33:18,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-17 22:33:18,901 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:33:18,901 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-17 22:33:19,102 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-17 22:33:19,103 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:33:19,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:33:19,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1166508097, now seen corresponding path program 2 times [2020-07-17 22:33:19,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:33:19,104 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395154528] [2020-07-17 22:33:19,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:33:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:19,240 INFO L280 TraceCheckUtils]: 0: Hoare triple {824#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {802#true} is VALID [2020-07-17 22:33:19,241 INFO L280 TraceCheckUtils]: 1: Hoare triple {802#true} assume true; {802#true} is VALID [2020-07-17 22:33:19,241 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {802#true} {802#true} #109#return; {802#true} is VALID [2020-07-17 22:33:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:19,347 INFO L280 TraceCheckUtils]: 0: Hoare triple {825#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {826#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-17 22:33:19,348 INFO L280 TraceCheckUtils]: 1: Hoare triple {826#(= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {826#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-17 22:33:19,349 INFO L280 TraceCheckUtils]: 2: Hoare triple {826#(= |sll_create_#in~len| sll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {826#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-17 22:33:19,350 INFO L280 TraceCheckUtils]: 3: Hoare triple {826#(= |sll_create_#in~len| sll_create_~len)} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 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; {827#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-17 22:33:19,350 INFO L280 TraceCheckUtils]: 4: Hoare triple {827#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {827#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-17 22:33:19,351 INFO L280 TraceCheckUtils]: 5: Hoare triple {827#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {827#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-17 22:33:19,352 INFO L280 TraceCheckUtils]: 6: Hoare triple {827#(<= |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, 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; {828#(<= |sll_create_#in~len| (+ sll_create_~len 2))} is VALID [2020-07-17 22:33:19,353 INFO L280 TraceCheckUtils]: 7: Hoare triple {828#(<= |sll_create_#in~len| (+ sll_create_~len 2))} assume !(~len > 0); {829#(<= |sll_create_#in~len| 2)} is VALID [2020-07-17 22:33:19,354 INFO L280 TraceCheckUtils]: 8: Hoare triple {829#(<= |sll_create_#in~len| 2)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {829#(<= |sll_create_#in~len| 2)} is VALID [2020-07-17 22:33:19,355 INFO L280 TraceCheckUtils]: 9: Hoare triple {829#(<= |sll_create_#in~len| 2)} assume true; {829#(<= |sll_create_#in~len| 2)} is VALID [2020-07-17 22:33:19,359 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {829#(<= |sll_create_#in~len| 2)} {807#(<= 2 main_~len~1)} #103#return; {803#false} is VALID [2020-07-17 22:33:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:19,366 INFO L280 TraceCheckUtils]: 0: Hoare triple {802#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {802#true} is VALID [2020-07-17 22:33:19,367 INFO L280 TraceCheckUtils]: 1: Hoare triple {802#true} assume !(~head.base != 0 || ~head.offset != 0); {802#true} is VALID [2020-07-17 22:33:19,367 INFO L280 TraceCheckUtils]: 2: Hoare triple {802#true} #res := ~len~0; {802#true} is VALID [2020-07-17 22:33:19,367 INFO L280 TraceCheckUtils]: 3: Hoare triple {802#true} assume true; {802#true} is VALID [2020-07-17 22:33:19,367 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {802#true} {803#false} #105#return; {803#false} is VALID [2020-07-17 22:33:19,369 INFO L263 TraceCheckUtils]: 0: Hoare triple {802#true} call ULTIMATE.init(); {824#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:33:19,369 INFO L280 TraceCheckUtils]: 1: Hoare triple {824#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {802#true} is VALID [2020-07-17 22:33:19,369 INFO L280 TraceCheckUtils]: 2: Hoare triple {802#true} assume true; {802#true} is VALID [2020-07-17 22:33:19,369 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {802#true} {802#true} #109#return; {802#true} is VALID [2020-07-17 22:33:19,370 INFO L263 TraceCheckUtils]: 4: Hoare triple {802#true} call #t~ret12 := main(); {802#true} is VALID [2020-07-17 22:33:19,370 INFO L280 TraceCheckUtils]: 5: Hoare triple {802#true} ~len~1 := 2; {807#(<= 2 main_~len~1)} is VALID [2020-07-17 22:33:19,371 INFO L280 TraceCheckUtils]: 6: Hoare triple {807#(<= 2 main_~len~1)} #t~short8 := ~len~1 < 32; {807#(<= 2 main_~len~1)} is VALID [2020-07-17 22:33:19,371 INFO L280 TraceCheckUtils]: 7: Hoare triple {807#(<= 2 main_~len~1)} assume #t~short8;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;#t~short8 := 0 != #t~nondet7; {807#(<= 2 main_~len~1)} is VALID [2020-07-17 22:33:19,372 INFO L280 TraceCheckUtils]: 8: Hoare triple {807#(<= 2 main_~len~1)} assume !#t~short8;havoc #t~nondet7;havoc #t~short8; {807#(<= 2 main_~len~1)} is VALID [2020-07-17 22:33:19,373 INFO L263 TraceCheckUtils]: 9: Hoare triple {807#(<= 2 main_~len~1)} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {825#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:33:19,374 INFO L280 TraceCheckUtils]: 10: Hoare triple {825#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {826#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-17 22:33:19,374 INFO L280 TraceCheckUtils]: 11: Hoare triple {826#(= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {826#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-17 22:33:19,376 INFO L280 TraceCheckUtils]: 12: Hoare triple {826#(= |sll_create_#in~len| sll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {826#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-17 22:33:19,376 INFO L280 TraceCheckUtils]: 13: Hoare triple {826#(= |sll_create_#in~len| sll_create_~len)} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 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; {827#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-17 22:33:19,377 INFO L280 TraceCheckUtils]: 14: Hoare triple {827#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {827#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-17 22:33:19,377 INFO L280 TraceCheckUtils]: 15: Hoare triple {827#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {827#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-17 22:33:19,378 INFO L280 TraceCheckUtils]: 16: Hoare triple {827#(<= |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, 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; {828#(<= |sll_create_#in~len| (+ sll_create_~len 2))} is VALID [2020-07-17 22:33:19,379 INFO L280 TraceCheckUtils]: 17: Hoare triple {828#(<= |sll_create_#in~len| (+ sll_create_~len 2))} assume !(~len > 0); {829#(<= |sll_create_#in~len| 2)} is VALID [2020-07-17 22:33:19,380 INFO L280 TraceCheckUtils]: 18: Hoare triple {829#(<= |sll_create_#in~len| 2)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {829#(<= |sll_create_#in~len| 2)} is VALID [2020-07-17 22:33:19,380 INFO L280 TraceCheckUtils]: 19: Hoare triple {829#(<= |sll_create_#in~len| 2)} assume true; {829#(<= |sll_create_#in~len| 2)} is VALID [2020-07-17 22:33:19,381 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {829#(<= |sll_create_#in~len| 2)} {807#(<= 2 main_~len~1)} #103#return; {803#false} is VALID [2020-07-17 22:33:19,381 INFO L280 TraceCheckUtils]: 21: Hoare triple {803#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset; {803#false} is VALID [2020-07-17 22:33:19,382 INFO L263 TraceCheckUtils]: 22: Hoare triple {803#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {802#true} is VALID [2020-07-17 22:33:19,382 INFO L280 TraceCheckUtils]: 23: Hoare triple {802#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {802#true} is VALID [2020-07-17 22:33:19,382 INFO L280 TraceCheckUtils]: 24: Hoare triple {802#true} assume !(~head.base != 0 || ~head.offset != 0); {802#true} is VALID [2020-07-17 22:33:19,382 INFO L280 TraceCheckUtils]: 25: Hoare triple {802#true} #res := ~len~0; {802#true} is VALID [2020-07-17 22:33:19,382 INFO L280 TraceCheckUtils]: 26: Hoare triple {802#true} assume true; {802#true} is VALID [2020-07-17 22:33:19,383 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {802#true} {803#false} #105#return; {803#false} is VALID [2020-07-17 22:33:19,383 INFO L280 TraceCheckUtils]: 28: Hoare triple {803#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {803#false} is VALID [2020-07-17 22:33:19,383 INFO L280 TraceCheckUtils]: 29: Hoare triple {803#false} assume ~len~1 != #t~ret11;havoc #t~ret11; {803#false} is VALID [2020-07-17 22:33:19,383 INFO L280 TraceCheckUtils]: 30: Hoare triple {803#false} assume !false; {803#false} is VALID [2020-07-17 22:33:19,385 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:33:19,386 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395154528] [2020-07-17 22:33:19,386 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078260237] [2020-07-17 22:33:19,386 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:33:19,475 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:33:19,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:33:19,476 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:33:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:19,490 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:33:19,585 INFO L263 TraceCheckUtils]: 0: Hoare triple {802#true} call ULTIMATE.init(); {802#true} is VALID [2020-07-17 22:33:19,586 INFO L280 TraceCheckUtils]: 1: Hoare triple {802#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {802#true} is VALID [2020-07-17 22:33:19,586 INFO L280 TraceCheckUtils]: 2: Hoare triple {802#true} assume true; {802#true} is VALID [2020-07-17 22:33:19,586 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {802#true} {802#true} #109#return; {802#true} is VALID [2020-07-17 22:33:19,586 INFO L263 TraceCheckUtils]: 4: Hoare triple {802#true} call #t~ret12 := main(); {802#true} is VALID [2020-07-17 22:33:19,588 INFO L280 TraceCheckUtils]: 5: Hoare triple {802#true} ~len~1 := 2; {807#(<= 2 main_~len~1)} is VALID [2020-07-17 22:33:19,588 INFO L280 TraceCheckUtils]: 6: Hoare triple {807#(<= 2 main_~len~1)} #t~short8 := ~len~1 < 32; {807#(<= 2 main_~len~1)} is VALID [2020-07-17 22:33:19,589 INFO L280 TraceCheckUtils]: 7: Hoare triple {807#(<= 2 main_~len~1)} assume #t~short8;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;#t~short8 := 0 != #t~nondet7; {807#(<= 2 main_~len~1)} is VALID [2020-07-17 22:33:19,589 INFO L280 TraceCheckUtils]: 8: Hoare triple {807#(<= 2 main_~len~1)} assume !#t~short8;havoc #t~nondet7;havoc #t~short8; {807#(<= 2 main_~len~1)} is VALID [2020-07-17 22:33:19,589 INFO L263 TraceCheckUtils]: 9: Hoare triple {807#(<= 2 main_~len~1)} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {802#true} is VALID [2020-07-17 22:33:19,590 INFO L280 TraceCheckUtils]: 10: Hoare triple {802#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {863#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-17 22:33:19,590 INFO L280 TraceCheckUtils]: 11: Hoare triple {863#(<= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {863#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-17 22:33:19,591 INFO L280 TraceCheckUtils]: 12: Hoare triple {863#(<= |sll_create_#in~len| sll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {863#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-17 22:33:19,592 INFO L280 TraceCheckUtils]: 13: Hoare triple {863#(<= |sll_create_#in~len| sll_create_~len)} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 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; {827#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-17 22:33:19,592 INFO L280 TraceCheckUtils]: 14: Hoare triple {827#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {827#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-17 22:33:19,593 INFO L280 TraceCheckUtils]: 15: Hoare triple {827#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {827#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-17 22:33:19,594 INFO L280 TraceCheckUtils]: 16: Hoare triple {827#(<= |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, 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; {828#(<= |sll_create_#in~len| (+ sll_create_~len 2))} is VALID [2020-07-17 22:33:19,595 INFO L280 TraceCheckUtils]: 17: Hoare triple {828#(<= |sll_create_#in~len| (+ sll_create_~len 2))} assume !(~len > 0); {829#(<= |sll_create_#in~len| 2)} is VALID [2020-07-17 22:33:19,596 INFO L280 TraceCheckUtils]: 18: Hoare triple {829#(<= |sll_create_#in~len| 2)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {829#(<= |sll_create_#in~len| 2)} is VALID [2020-07-17 22:33:19,596 INFO L280 TraceCheckUtils]: 19: Hoare triple {829#(<= |sll_create_#in~len| 2)} assume true; {829#(<= |sll_create_#in~len| 2)} is VALID [2020-07-17 22:33:19,597 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {829#(<= |sll_create_#in~len| 2)} {807#(<= 2 main_~len~1)} #103#return; {803#false} is VALID [2020-07-17 22:33:19,598 INFO L280 TraceCheckUtils]: 21: Hoare triple {803#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset; {803#false} is VALID [2020-07-17 22:33:19,598 INFO L263 TraceCheckUtils]: 22: Hoare triple {803#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {803#false} is VALID [2020-07-17 22:33:19,598 INFO L280 TraceCheckUtils]: 23: Hoare triple {803#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {803#false} is VALID [2020-07-17 22:33:19,598 INFO L280 TraceCheckUtils]: 24: Hoare triple {803#false} assume !(~head.base != 0 || ~head.offset != 0); {803#false} is VALID [2020-07-17 22:33:19,599 INFO L280 TraceCheckUtils]: 25: Hoare triple {803#false} #res := ~len~0; {803#false} is VALID [2020-07-17 22:33:19,599 INFO L280 TraceCheckUtils]: 26: Hoare triple {803#false} assume true; {803#false} is VALID [2020-07-17 22:33:19,599 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {803#false} {803#false} #105#return; {803#false} is VALID [2020-07-17 22:33:19,599 INFO L280 TraceCheckUtils]: 28: Hoare triple {803#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {803#false} is VALID [2020-07-17 22:33:19,599 INFO L280 TraceCheckUtils]: 29: Hoare triple {803#false} assume ~len~1 != #t~ret11;havoc #t~ret11; {803#false} is VALID [2020-07-17 22:33:19,600 INFO L280 TraceCheckUtils]: 30: Hoare triple {803#false} assume !false; {803#false} is VALID [2020-07-17 22:33:19,601 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:33:19,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:33:19,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2020-07-17 22:33:19,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972094748] [2020-07-17 22:33:19,602 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-07-17 22:33:19,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:33:19,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-17 22:33:19,653 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:19,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 22:33:19,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:33:19,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 22:33:19,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:33:19,655 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 10 states. [2020-07-17 22:33:20,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:20,232 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2020-07-17 22:33:20,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:33:20,233 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-07-17 22:33:20,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:33:20,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:33:20,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 55 transitions. [2020-07-17 22:33:20,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:33:20,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 55 transitions. [2020-07-17 22:33:20,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 55 transitions. [2020-07-17 22:33:20,329 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:20,331 INFO L225 Difference]: With dead ends: 51 [2020-07-17 22:33:20,331 INFO L226 Difference]: Without dead ends: 37 [2020-07-17 22:33:20,332 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2020-07-17 22:33:20,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-17 22:33:20,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2020-07-17 22:33:20,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:33:20,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 35 states. [2020-07-17 22:33:20,368 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 35 states. [2020-07-17 22:33:20,368 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 35 states. [2020-07-17 22:33:20,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:20,371 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-07-17 22:33:20,371 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2020-07-17 22:33:20,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:20,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:20,372 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 37 states. [2020-07-17 22:33:20,373 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 37 states. [2020-07-17 22:33:20,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:20,375 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-07-17 22:33:20,375 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2020-07-17 22:33:20,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:20,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:20,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:33:20,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:33:20,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-17 22:33:20,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2020-07-17 22:33:20,378 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 31 [2020-07-17 22:33:20,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:33:20,379 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2020-07-17 22:33:20,379 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 22:33:20,379 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-17 22:33:20,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-17 22:33:20,380 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:33:20,380 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-17 22:33:20,588 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:33:20,590 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:33:20,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:33:20,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1706812894, now seen corresponding path program 3 times [2020-07-17 22:33:20,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:33:20,591 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060041385] [2020-07-17 22:33:20,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:33:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:20,689 INFO L280 TraceCheckUtils]: 0: Hoare triple {1152#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1126#true} is VALID [2020-07-17 22:33:20,690 INFO L280 TraceCheckUtils]: 1: Hoare triple {1126#true} assume true; {1126#true} is VALID [2020-07-17 22:33:20,690 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1126#true} {1126#true} #109#return; {1126#true} is VALID [2020-07-17 22:33:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:20,763 INFO L280 TraceCheckUtils]: 0: Hoare triple {1153#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {1126#true} is VALID [2020-07-17 22:33:20,763 INFO L280 TraceCheckUtils]: 1: Hoare triple {1126#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1126#true} is VALID [2020-07-17 22:33:20,764 INFO L280 TraceCheckUtils]: 2: Hoare triple {1126#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1126#true} is VALID [2020-07-17 22:33:20,764 INFO L280 TraceCheckUtils]: 3: Hoare triple {1126#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 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; {1126#true} is VALID [2020-07-17 22:33:20,764 INFO L280 TraceCheckUtils]: 4: Hoare triple {1126#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1126#true} is VALID [2020-07-17 22:33:20,764 INFO L280 TraceCheckUtils]: 5: Hoare triple {1126#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1126#true} is VALID [2020-07-17 22:33:20,765 INFO L280 TraceCheckUtils]: 6: Hoare triple {1126#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 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; {1126#true} is VALID [2020-07-17 22:33:20,766 INFO L280 TraceCheckUtils]: 7: Hoare triple {1126#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1154#(not (= 0 sll_create_~new_head~0.base))} is VALID [2020-07-17 22:33:20,766 INFO L280 TraceCheckUtils]: 8: Hoare triple {1154#(not (= 0 sll_create_~new_head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1154#(not (= 0 sll_create_~new_head~0.base))} is VALID [2020-07-17 22:33:20,767 INFO L280 TraceCheckUtils]: 9: Hoare triple {1154#(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, 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; {1155#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-17 22:33:20,768 INFO L280 TraceCheckUtils]: 10: Hoare triple {1155#(not (= 0 sll_create_~head~0.base))} assume !(~len > 0); {1155#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-17 22:33:20,769 INFO L280 TraceCheckUtils]: 11: Hoare triple {1155#(not (= 0 sll_create_~head~0.base))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1156#(not (= 0 |sll_create_#res.base|))} is VALID [2020-07-17 22:33:20,769 INFO L280 TraceCheckUtils]: 12: Hoare triple {1156#(not (= 0 |sll_create_#res.base|))} assume true; {1156#(not (= 0 |sll_create_#res.base|))} is VALID [2020-07-17 22:33:20,771 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1156#(not (= 0 |sll_create_#res.base|))} {1126#true} #103#return; {1145#(not (= 0 |main_#t~ret10.base|))} is VALID [2020-07-17 22:33:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:20,803 INFO L280 TraceCheckUtils]: 0: Hoare triple {1126#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {1157#(= |sll_length_#in~head.base| sll_length_~head.base)} is VALID [2020-07-17 22:33:20,804 INFO L280 TraceCheckUtils]: 1: Hoare triple {1157#(= |sll_length_#in~head.base| sll_length_~head.base)} assume !(~head.base != 0 || ~head.offset != 0); {1158#(= 0 |sll_length_#in~head.base|)} is VALID [2020-07-17 22:33:20,804 INFO L280 TraceCheckUtils]: 2: Hoare triple {1158#(= 0 |sll_length_#in~head.base|)} #res := ~len~0; {1158#(= 0 |sll_length_#in~head.base|)} is VALID [2020-07-17 22:33:20,805 INFO L280 TraceCheckUtils]: 3: Hoare triple {1158#(= 0 |sll_length_#in~head.base|)} assume true; {1158#(= 0 |sll_length_#in~head.base|)} is VALID [2020-07-17 22:33:20,806 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1158#(= 0 |sll_length_#in~head.base|)} {1146#(not (= 0 main_~s~0.base))} #105#return; {1127#false} is VALID [2020-07-17 22:33:20,806 INFO L263 TraceCheckUtils]: 0: Hoare triple {1126#true} call ULTIMATE.init(); {1152#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:33:20,807 INFO L280 TraceCheckUtils]: 1: Hoare triple {1152#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1126#true} is VALID [2020-07-17 22:33:20,807 INFO L280 TraceCheckUtils]: 2: Hoare triple {1126#true} assume true; {1126#true} is VALID [2020-07-17 22:33:20,807 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1126#true} {1126#true} #109#return; {1126#true} is VALID [2020-07-17 22:33:20,807 INFO L263 TraceCheckUtils]: 4: Hoare triple {1126#true} call #t~ret12 := main(); {1126#true} is VALID [2020-07-17 22:33:20,808 INFO L280 TraceCheckUtils]: 5: Hoare triple {1126#true} ~len~1 := 2; {1126#true} is VALID [2020-07-17 22:33:20,808 INFO L280 TraceCheckUtils]: 6: Hoare triple {1126#true} #t~short8 := ~len~1 < 32; {1126#true} is VALID [2020-07-17 22:33:20,808 INFO L280 TraceCheckUtils]: 7: Hoare triple {1126#true} assume #t~short8;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;#t~short8 := 0 != #t~nondet7; {1126#true} is VALID [2020-07-17 22:33:20,808 INFO L280 TraceCheckUtils]: 8: Hoare triple {1126#true} assume !#t~short8;havoc #t~nondet7;havoc #t~short8; {1126#true} is VALID [2020-07-17 22:33:20,813 INFO L263 TraceCheckUtils]: 9: Hoare triple {1126#true} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {1153#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:33:20,814 INFO L280 TraceCheckUtils]: 10: Hoare triple {1153#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {1126#true} is VALID [2020-07-17 22:33:20,814 INFO L280 TraceCheckUtils]: 11: Hoare triple {1126#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1126#true} is VALID [2020-07-17 22:33:20,814 INFO L280 TraceCheckUtils]: 12: Hoare triple {1126#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1126#true} is VALID [2020-07-17 22:33:20,814 INFO L280 TraceCheckUtils]: 13: Hoare triple {1126#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 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; {1126#true} is VALID [2020-07-17 22:33:20,815 INFO L280 TraceCheckUtils]: 14: Hoare triple {1126#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1126#true} is VALID [2020-07-17 22:33:20,815 INFO L280 TraceCheckUtils]: 15: Hoare triple {1126#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1126#true} is VALID [2020-07-17 22:33:20,815 INFO L280 TraceCheckUtils]: 16: Hoare triple {1126#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 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; {1126#true} is VALID [2020-07-17 22:33:20,819 INFO L280 TraceCheckUtils]: 17: Hoare triple {1126#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1154#(not (= 0 sll_create_~new_head~0.base))} is VALID [2020-07-17 22:33:20,820 INFO L280 TraceCheckUtils]: 18: Hoare triple {1154#(not (= 0 sll_create_~new_head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1154#(not (= 0 sll_create_~new_head~0.base))} is VALID [2020-07-17 22:33:20,820 INFO L280 TraceCheckUtils]: 19: Hoare triple {1154#(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, 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; {1155#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-17 22:33:20,821 INFO L280 TraceCheckUtils]: 20: Hoare triple {1155#(not (= 0 sll_create_~head~0.base))} assume !(~len > 0); {1155#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-17 22:33:20,827 INFO L280 TraceCheckUtils]: 21: Hoare triple {1155#(not (= 0 sll_create_~head~0.base))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1156#(not (= 0 |sll_create_#res.base|))} is VALID [2020-07-17 22:33:20,829 INFO L280 TraceCheckUtils]: 22: Hoare triple {1156#(not (= 0 |sll_create_#res.base|))} assume true; {1156#(not (= 0 |sll_create_#res.base|))} is VALID [2020-07-17 22:33:20,835 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1156#(not (= 0 |sll_create_#res.base|))} {1126#true} #103#return; {1145#(not (= 0 |main_#t~ret10.base|))} is VALID [2020-07-17 22:33:20,842 INFO L280 TraceCheckUtils]: 24: Hoare triple {1145#(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; {1146#(not (= 0 main_~s~0.base))} is VALID [2020-07-17 22:33:20,842 INFO L263 TraceCheckUtils]: 25: Hoare triple {1146#(not (= 0 main_~s~0.base))} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {1126#true} is VALID [2020-07-17 22:33:20,843 INFO L280 TraceCheckUtils]: 26: Hoare triple {1126#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {1157#(= |sll_length_#in~head.base| sll_length_~head.base)} is VALID [2020-07-17 22:33:20,844 INFO L280 TraceCheckUtils]: 27: Hoare triple {1157#(= |sll_length_#in~head.base| sll_length_~head.base)} assume !(~head.base != 0 || ~head.offset != 0); {1158#(= 0 |sll_length_#in~head.base|)} is VALID [2020-07-17 22:33:20,844 INFO L280 TraceCheckUtils]: 28: Hoare triple {1158#(= 0 |sll_length_#in~head.base|)} #res := ~len~0; {1158#(= 0 |sll_length_#in~head.base|)} is VALID [2020-07-17 22:33:20,845 INFO L280 TraceCheckUtils]: 29: Hoare triple {1158#(= 0 |sll_length_#in~head.base|)} assume true; {1158#(= 0 |sll_length_#in~head.base|)} is VALID [2020-07-17 22:33:20,846 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1158#(= 0 |sll_length_#in~head.base|)} {1146#(not (= 0 main_~s~0.base))} #105#return; {1127#false} is VALID [2020-07-17 22:33:20,846 INFO L280 TraceCheckUtils]: 31: Hoare triple {1127#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {1127#false} is VALID [2020-07-17 22:33:20,847 INFO L280 TraceCheckUtils]: 32: Hoare triple {1127#false} assume ~len~1 != #t~ret11;havoc #t~ret11; {1127#false} is VALID [2020-07-17 22:33:20,847 INFO L280 TraceCheckUtils]: 33: Hoare triple {1127#false} assume !false; {1127#false} is VALID [2020-07-17 22:33:20,848 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-17 22:33:20,849 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060041385] [2020-07-17 22:33:20,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:33:20,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-17 22:33:20,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541755050] [2020-07-17 22:33:20,850 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2020-07-17 22:33:20,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:33:20,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-17 22:33:20,889 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:20,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 22:33:20,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:33:20,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 22:33:20,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:33:20,890 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 11 states. [2020-07-17 22:33:21,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:21,637 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2020-07-17 22:33:21,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:33:21,637 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2020-07-17 22:33:21,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:33:21,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:33:21,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2020-07-17 22:33:21,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:33:21,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2020-07-17 22:33:21,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2020-07-17 22:33:21,718 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:21,719 INFO L225 Difference]: With dead ends: 43 [2020-07-17 22:33:21,719 INFO L226 Difference]: Without dead ends: 36 [2020-07-17 22:33:21,720 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-07-17 22:33:21,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-17 22:33:21,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-17 22:33:21,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:33:21,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2020-07-17 22:33:21,753 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-17 22:33:21,754 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-17 22:33:21,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:21,756 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2020-07-17 22:33:21,756 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2020-07-17 22:33:21,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:21,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:21,757 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-17 22:33:21,757 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-17 22:33:21,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:21,759 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2020-07-17 22:33:21,759 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2020-07-17 22:33:21,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:21,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:21,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:33:21,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:33:21,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-17 22:33:21,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2020-07-17 22:33:21,762 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 34 [2020-07-17 22:33:21,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:33:21,763 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2020-07-17 22:33:21,763 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 22:33:21,763 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2020-07-17 22:33:21,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-17 22:33:21,764 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:33:21,764 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-17 22:33:21,764 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 22:33:21,764 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:33:21,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:33:21,765 INFO L82 PathProgramCache]: Analyzing trace with hash 991320762, now seen corresponding path program 1 times [2020-07-17 22:33:21,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:33:21,765 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846306782] [2020-07-17 22:33:21,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:33:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:21,845 INFO L280 TraceCheckUtils]: 0: Hoare triple {1384#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1357#true} is VALID [2020-07-17 22:33:21,846 INFO L280 TraceCheckUtils]: 1: Hoare triple {1357#true} assume true; {1357#true} is VALID [2020-07-17 22:33:21,846 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1357#true} {1357#true} #109#return; {1357#true} is VALID [2020-07-17 22:33:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:21,953 INFO L280 TraceCheckUtils]: 0: Hoare triple {1385#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {1357#true} is VALID [2020-07-17 22:33:21,954 INFO L280 TraceCheckUtils]: 1: Hoare triple {1357#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1357#true} is VALID [2020-07-17 22:33:21,954 INFO L280 TraceCheckUtils]: 2: Hoare triple {1357#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1357#true} is VALID [2020-07-17 22:33:21,954 INFO L280 TraceCheckUtils]: 3: Hoare triple {1357#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 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; {1357#true} is VALID [2020-07-17 22:33:21,955 INFO L280 TraceCheckUtils]: 4: Hoare triple {1357#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1386#(not (= 0 sll_create_~new_head~0.base))} is VALID [2020-07-17 22:33:21,956 INFO L280 TraceCheckUtils]: 5: Hoare triple {1386#(not (= 0 sll_create_~new_head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1386#(not (= 0 sll_create_~new_head~0.base))} is VALID [2020-07-17 22:33:21,957 INFO L280 TraceCheckUtils]: 6: Hoare triple {1386#(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, 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; {1387#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-17 22:33:21,957 INFO L280 TraceCheckUtils]: 7: Hoare triple {1387#(not (= 0 sll_create_~head~0.base))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1387#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-17 22:33:21,958 INFO L280 TraceCheckUtils]: 8: Hoare triple {1387#(not (= 0 sll_create_~head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1387#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-17 22:33:21,959 INFO L280 TraceCheckUtils]: 9: Hoare triple {1387#(not (= 0 sll_create_~head~0.base))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 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; {1388#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2020-07-17 22:33:21,960 INFO L280 TraceCheckUtils]: 10: Hoare triple {1388#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} assume !(~len > 0); {1388#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2020-07-17 22:33:21,961 INFO L280 TraceCheckUtils]: 11: Hoare triple {1388#(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; {1389#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} is VALID [2020-07-17 22:33:21,961 INFO L280 TraceCheckUtils]: 12: Hoare triple {1389#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} assume true; {1389#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} is VALID [2020-07-17 22:33:21,963 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1389#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} {1357#true} #103#return; {1376#(not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~ret10.base|) |main_#t~ret10.offset|)))} is VALID [2020-07-17 22:33:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:22,055 INFO L280 TraceCheckUtils]: 0: Hoare triple {1357#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {1390#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} is VALID [2020-07-17 22:33:22,056 INFO L280 TraceCheckUtils]: 1: Hoare triple {1390#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1391#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base)} is VALID [2020-07-17 22:33:22,057 INFO L280 TraceCheckUtils]: 2: Hoare triple {1391#(= (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); {1392#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} is VALID [2020-07-17 22:33:22,057 INFO L280 TraceCheckUtils]: 3: Hoare triple {1392#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} #res := ~len~0; {1392#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} is VALID [2020-07-17 22:33:22,058 INFO L280 TraceCheckUtils]: 4: Hoare triple {1392#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} assume true; {1392#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} is VALID [2020-07-17 22:33:22,059 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1392#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} {1377#(not (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)))} #105#return; {1358#false} is VALID [2020-07-17 22:33:22,061 INFO L263 TraceCheckUtils]: 0: Hoare triple {1357#true} call ULTIMATE.init(); {1384#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:33:22,061 INFO L280 TraceCheckUtils]: 1: Hoare triple {1384#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1357#true} is VALID [2020-07-17 22:33:22,061 INFO L280 TraceCheckUtils]: 2: Hoare triple {1357#true} assume true; {1357#true} is VALID [2020-07-17 22:33:22,062 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1357#true} {1357#true} #109#return; {1357#true} is VALID [2020-07-17 22:33:22,062 INFO L263 TraceCheckUtils]: 4: Hoare triple {1357#true} call #t~ret12 := main(); {1357#true} is VALID [2020-07-17 22:33:22,062 INFO L280 TraceCheckUtils]: 5: Hoare triple {1357#true} ~len~1 := 2; {1357#true} is VALID [2020-07-17 22:33:22,062 INFO L280 TraceCheckUtils]: 6: Hoare triple {1357#true} #t~short8 := ~len~1 < 32; {1357#true} is VALID [2020-07-17 22:33:22,062 INFO L280 TraceCheckUtils]: 7: Hoare triple {1357#true} assume #t~short8;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;#t~short8 := 0 != #t~nondet7; {1357#true} is VALID [2020-07-17 22:33:22,063 INFO L280 TraceCheckUtils]: 8: Hoare triple {1357#true} assume !#t~short8;havoc #t~nondet7;havoc #t~short8; {1357#true} is VALID [2020-07-17 22:33:22,070 INFO L263 TraceCheckUtils]: 9: Hoare triple {1357#true} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {1385#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:33:22,070 INFO L280 TraceCheckUtils]: 10: Hoare triple {1385#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {1357#true} is VALID [2020-07-17 22:33:22,071 INFO L280 TraceCheckUtils]: 11: Hoare triple {1357#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1357#true} is VALID [2020-07-17 22:33:22,071 INFO L280 TraceCheckUtils]: 12: Hoare triple {1357#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1357#true} is VALID [2020-07-17 22:33:22,071 INFO L280 TraceCheckUtils]: 13: Hoare triple {1357#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 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; {1357#true} is VALID [2020-07-17 22:33:22,072 INFO L280 TraceCheckUtils]: 14: Hoare triple {1357#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1386#(not (= 0 sll_create_~new_head~0.base))} is VALID [2020-07-17 22:33:22,073 INFO L280 TraceCheckUtils]: 15: Hoare triple {1386#(not (= 0 sll_create_~new_head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1386#(not (= 0 sll_create_~new_head~0.base))} is VALID [2020-07-17 22:33:22,074 INFO L280 TraceCheckUtils]: 16: Hoare triple {1386#(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, 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; {1387#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-17 22:33:22,075 INFO L280 TraceCheckUtils]: 17: Hoare triple {1387#(not (= 0 sll_create_~head~0.base))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1387#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-17 22:33:22,075 INFO L280 TraceCheckUtils]: 18: Hoare triple {1387#(not (= 0 sll_create_~head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1387#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-17 22:33:22,077 INFO L280 TraceCheckUtils]: 19: Hoare triple {1387#(not (= 0 sll_create_~head~0.base))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 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; {1388#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2020-07-17 22:33:22,077 INFO L280 TraceCheckUtils]: 20: Hoare triple {1388#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} assume !(~len > 0); {1388#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2020-07-17 22:33:22,079 INFO L280 TraceCheckUtils]: 21: Hoare triple {1388#(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; {1389#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} is VALID [2020-07-17 22:33:22,081 INFO L280 TraceCheckUtils]: 22: Hoare triple {1389#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} assume true; {1389#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} is VALID [2020-07-17 22:33:22,083 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1389#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} {1357#true} #103#return; {1376#(not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~ret10.base|) |main_#t~ret10.offset|)))} is VALID [2020-07-17 22:33:22,084 INFO L280 TraceCheckUtils]: 24: Hoare triple {1376#(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; {1377#(not (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)))} is VALID [2020-07-17 22:33:22,084 INFO L263 TraceCheckUtils]: 25: Hoare triple {1377#(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); {1357#true} is VALID [2020-07-17 22:33:22,085 INFO L280 TraceCheckUtils]: 26: Hoare triple {1357#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {1390#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} is VALID [2020-07-17 22:33:22,086 INFO L280 TraceCheckUtils]: 27: Hoare triple {1390#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1391#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base)} is VALID [2020-07-17 22:33:22,088 INFO L280 TraceCheckUtils]: 28: Hoare triple {1391#(= (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); {1392#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} is VALID [2020-07-17 22:33:22,089 INFO L280 TraceCheckUtils]: 29: Hoare triple {1392#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} #res := ~len~0; {1392#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} is VALID [2020-07-17 22:33:22,090 INFO L280 TraceCheckUtils]: 30: Hoare triple {1392#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} assume true; {1392#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} is VALID [2020-07-17 22:33:22,091 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1392#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} {1377#(not (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)))} #105#return; {1358#false} is VALID [2020-07-17 22:33:22,092 INFO L280 TraceCheckUtils]: 32: Hoare triple {1358#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {1358#false} is VALID [2020-07-17 22:33:22,092 INFO L280 TraceCheckUtils]: 33: Hoare triple {1358#false} assume ~len~1 != #t~ret11;havoc #t~ret11; {1358#false} is VALID [2020-07-17 22:33:22,092 INFO L280 TraceCheckUtils]: 34: Hoare triple {1358#false} assume !false; {1358#false} is VALID [2020-07-17 22:33:22,095 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:33:22,095 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846306782] [2020-07-17 22:33:22,096 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302882073] [2020-07-17 22:33:22,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:33:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:22,216 INFO L264 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 40 conjunts are in the unsatisfiable core [2020-07-17 22:33:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:22,233 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:33:22,362 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-17 22:33:22,362 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:33:22,371 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:33:22,372 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:33:22,373 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2020-07-17 22:33:22,377 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:33:22,377 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_9|, v_sll_create_~head~0.base_5]. (and (= 0 sll_create_~head~0.offset) (not (= 0 v_sll_create_~head~0.base_5)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_9| sll_create_~head~0.base (store (select |v_#memory_$Pointer$.base_9| sll_create_~head~0.base) sll_create_~head~0.offset v_sll_create_~head~0.base_5)))) [2020-07-17 22:33:22,378 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset))) (= 0 sll_create_~head~0.offset)) [2020-07-17 22:33:22,760 INFO L263 TraceCheckUtils]: 0: Hoare triple {1357#true} call ULTIMATE.init(); {1357#true} is VALID [2020-07-17 22:33:22,761 INFO L280 TraceCheckUtils]: 1: Hoare triple {1357#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1357#true} is VALID [2020-07-17 22:33:22,761 INFO L280 TraceCheckUtils]: 2: Hoare triple {1357#true} assume true; {1357#true} is VALID [2020-07-17 22:33:22,761 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1357#true} {1357#true} #109#return; {1357#true} is VALID [2020-07-17 22:33:22,761 INFO L263 TraceCheckUtils]: 4: Hoare triple {1357#true} call #t~ret12 := main(); {1357#true} is VALID [2020-07-17 22:33:22,761 INFO L280 TraceCheckUtils]: 5: Hoare triple {1357#true} ~len~1 := 2; {1357#true} is VALID [2020-07-17 22:33:22,761 INFO L280 TraceCheckUtils]: 6: Hoare triple {1357#true} #t~short8 := ~len~1 < 32; {1357#true} is VALID [2020-07-17 22:33:22,762 INFO L280 TraceCheckUtils]: 7: Hoare triple {1357#true} assume #t~short8;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;#t~short8 := 0 != #t~nondet7; {1357#true} is VALID [2020-07-17 22:33:22,762 INFO L280 TraceCheckUtils]: 8: Hoare triple {1357#true} assume !#t~short8;havoc #t~nondet7;havoc #t~short8; {1357#true} is VALID [2020-07-17 22:33:22,762 INFO L263 TraceCheckUtils]: 9: Hoare triple {1357#true} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {1357#true} is VALID [2020-07-17 22:33:22,762 INFO L280 TraceCheckUtils]: 10: Hoare triple {1357#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {1357#true} is VALID [2020-07-17 22:33:22,762 INFO L280 TraceCheckUtils]: 11: Hoare triple {1357#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1357#true} is VALID [2020-07-17 22:33:22,762 INFO L280 TraceCheckUtils]: 12: Hoare triple {1357#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1357#true} is VALID [2020-07-17 22:33:22,763 INFO L280 TraceCheckUtils]: 13: Hoare triple {1357#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 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; {1357#true} is VALID [2020-07-17 22:33:22,763 INFO L280 TraceCheckUtils]: 14: Hoare triple {1357#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1438#(= sll_create_~new_head~0.offset 0)} is VALID [2020-07-17 22:33:22,764 INFO L280 TraceCheckUtils]: 15: Hoare triple {1438#(= sll_create_~new_head~0.offset 0)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1386#(not (= 0 sll_create_~new_head~0.base))} is VALID [2020-07-17 22:33:22,765 INFO L280 TraceCheckUtils]: 16: Hoare triple {1386#(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, 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; {1387#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-17 22:33:22,765 INFO L280 TraceCheckUtils]: 17: Hoare triple {1387#(not (= 0 sll_create_~head~0.base))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1448#(and (not (= 0 sll_create_~head~0.base)) (= sll_create_~new_head~0.offset 0))} is VALID [2020-07-17 22:33:22,766 INFO L280 TraceCheckUtils]: 18: Hoare triple {1448#(and (not (= 0 sll_create_~head~0.base)) (= sll_create_~new_head~0.offset 0))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1448#(and (not (= 0 sll_create_~head~0.base)) (= sll_create_~new_head~0.offset 0))} is VALID [2020-07-17 22:33:22,767 INFO L280 TraceCheckUtils]: 19: Hoare triple {1448#(and (not (= 0 sll_create_~head~0.base)) (= sll_create_~new_head~0.offset 0))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 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; {1455#(and (not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset))) (= 0 sll_create_~head~0.offset))} is VALID [2020-07-17 22:33:22,768 INFO L280 TraceCheckUtils]: 20: Hoare triple {1455#(and (not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset))) (= 0 sll_create_~head~0.offset))} assume !(~len > 0); {1455#(and (not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset))) (= 0 sll_create_~head~0.offset))} is VALID [2020-07-17 22:33:22,769 INFO L280 TraceCheckUtils]: 21: Hoare triple {1455#(and (not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset))) (= 0 sll_create_~head~0.offset))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1462#(and (not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|))) (= 0 |sll_create_#res.offset|))} is VALID [2020-07-17 22:33:22,769 INFO L280 TraceCheckUtils]: 22: Hoare triple {1462#(and (not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|))) (= 0 |sll_create_#res.offset|))} assume true; {1462#(and (not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|))) (= 0 |sll_create_#res.offset|))} is VALID [2020-07-17 22:33:22,770 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1462#(and (not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|))) (= 0 |sll_create_#res.offset|))} {1357#true} #103#return; {1469#(and (= |main_#t~ret10.offset| 0) (not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~ret10.base|) |main_#t~ret10.offset|))))} is VALID [2020-07-17 22:33:22,771 INFO L280 TraceCheckUtils]: 24: Hoare triple {1469#(and (= |main_#t~ret10.offset| 0) (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; {1473#(and (= 0 main_~s~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) 0))))} is VALID [2020-07-17 22:33:22,772 INFO L263 TraceCheckUtils]: 25: Hoare triple {1473#(and (= 0 main_~s~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) 0))))} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {1477#(exists ((v_main_~s~0.base_BEFORE_CALL_1 Int)) (not (= 0 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) 0))))} is VALID [2020-07-17 22:33:22,773 INFO L280 TraceCheckUtils]: 26: Hoare triple {1477#(exists ((v_main_~s~0.base_BEFORE_CALL_1 Int)) (not (= 0 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) 0))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {1481#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (exists ((v_main_~s~0.base_BEFORE_CALL_1 Int)) (not (= 0 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) 0)))) (= |sll_length_#in~head.base| sll_length_~head.base))} is VALID [2020-07-17 22:33:22,775 INFO L280 TraceCheckUtils]: 27: Hoare triple {1481#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (exists ((v_main_~s~0.base_BEFORE_CALL_1 Int)) (not (= 0 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) 0)))) (= |sll_length_#in~head.base| sll_length_~head.base))} assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1485#(and (exists ((v_main_~s~0.base_BEFORE_CALL_1 Int)) (not (= 0 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) 0)))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base))} is VALID [2020-07-17 22:33:22,776 INFO L280 TraceCheckUtils]: 28: Hoare triple {1485#(and (exists ((v_main_~s~0.base_BEFORE_CALL_1 Int)) (not (= 0 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) 0)))) (= (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); {1489#(and (exists ((v_main_~s~0.base_BEFORE_CALL_1 Int)) (not (= 0 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) 0)))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0))} is VALID [2020-07-17 22:33:22,777 INFO L280 TraceCheckUtils]: 29: Hoare triple {1489#(and (exists ((v_main_~s~0.base_BEFORE_CALL_1 Int)) (not (= 0 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) 0)))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0))} #res := ~len~0; {1489#(and (exists ((v_main_~s~0.base_BEFORE_CALL_1 Int)) (not (= 0 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) 0)))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0))} is VALID [2020-07-17 22:33:22,778 INFO L280 TraceCheckUtils]: 30: Hoare triple {1489#(and (exists ((v_main_~s~0.base_BEFORE_CALL_1 Int)) (not (= 0 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) 0)))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0))} assume true; {1489#(and (exists ((v_main_~s~0.base_BEFORE_CALL_1 Int)) (not (= 0 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) 0)))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0))} is VALID [2020-07-17 22:33:22,779 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1489#(and (exists ((v_main_~s~0.base_BEFORE_CALL_1 Int)) (not (= 0 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) 0)))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0))} {1473#(and (= 0 main_~s~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) 0))))} #105#return; {1358#false} is VALID [2020-07-17 22:33:22,779 INFO L280 TraceCheckUtils]: 32: Hoare triple {1358#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {1358#false} is VALID [2020-07-17 22:33:22,779 INFO L280 TraceCheckUtils]: 33: Hoare triple {1358#false} assume ~len~1 != #t~ret11;havoc #t~ret11; {1358#false} is VALID [2020-07-17 22:33:22,779 INFO L280 TraceCheckUtils]: 34: Hoare triple {1358#false} assume !false; {1358#false} is VALID [2020-07-17 22:33:22,783 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:33:22,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:33:22,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 23 [2020-07-17 22:33:22,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367356544] [2020-07-17 22:33:22,785 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 35 [2020-07-17 22:33:22,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:33:22,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2020-07-17 22:33:22,854 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:22,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-07-17 22:33:22,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:33:22,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-17 22:33:22,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2020-07-17 22:33:22,855 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 23 states. [2020-07-17 22:33:38,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:38,550 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2020-07-17 22:33:38,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-17 22:33:38,550 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 35 [2020-07-17 22:33:38,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:33:38,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-17 22:33:38,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 46 transitions. [2020-07-17 22:33:38,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-17 22:33:38,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 46 transitions. [2020-07-17 22:33:38,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 46 transitions. [2020-07-17 22:33:38,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:38,640 INFO L225 Difference]: With dead ends: 44 [2020-07-17 22:33:38,640 INFO L226 Difference]: Without dead ends: 37 [2020-07-17 22:33:38,642 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2020-07-17 22:33:38,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-17 22:33:38,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-17 22:33:38,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:33:38,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2020-07-17 22:33:38,689 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2020-07-17 22:33:38,689 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2020-07-17 22:33:38,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:38,692 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-07-17 22:33:38,692 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2020-07-17 22:33:38,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:38,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:38,693 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2020-07-17 22:33:38,693 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2020-07-17 22:33:38,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:38,695 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-07-17 22:33:38,695 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2020-07-17 22:33:38,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:38,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:38,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:33:38,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:33:38,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-17 22:33:38,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2020-07-17 22:33:38,697 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 35 [2020-07-17 22:33:38,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:33:38,698 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2020-07-17 22:33:38,698 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-07-17 22:33:38,698 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2020-07-17 22:33:38,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-17 22:33:38,699 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:33:38,699 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-17 22:33:38,908 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:33:38,909 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:33:38,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:33:38,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1265881822, now seen corresponding path program 2 times [2020-07-17 22:33:38,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:33:38,911 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706997670] [2020-07-17 22:33:38,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:33:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:39,026 INFO L280 TraceCheckUtils]: 0: Hoare triple {1746#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1718#true} is VALID [2020-07-17 22:33:39,026 INFO L280 TraceCheckUtils]: 1: Hoare triple {1718#true} assume true; {1718#true} is VALID [2020-07-17 22:33:39,026 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1718#true} {1718#true} #109#return; {1718#true} is VALID [2020-07-17 22:33:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:39,080 INFO L280 TraceCheckUtils]: 0: Hoare triple {1747#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {1718#true} is VALID [2020-07-17 22:33:39,080 INFO L280 TraceCheckUtils]: 1: Hoare triple {1718#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1718#true} is VALID [2020-07-17 22:33:39,080 INFO L280 TraceCheckUtils]: 2: Hoare triple {1718#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1718#true} is VALID [2020-07-17 22:33:39,081 INFO L280 TraceCheckUtils]: 3: Hoare triple {1718#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 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; {1718#true} is VALID [2020-07-17 22:33:39,081 INFO L280 TraceCheckUtils]: 4: Hoare triple {1718#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1718#true} is VALID [2020-07-17 22:33:39,081 INFO L280 TraceCheckUtils]: 5: Hoare triple {1718#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1718#true} is VALID [2020-07-17 22:33:39,081 INFO L280 TraceCheckUtils]: 6: Hoare triple {1718#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 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; {1718#true} is VALID [2020-07-17 22:33:39,082 INFO L280 TraceCheckUtils]: 7: Hoare triple {1718#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1718#true} is VALID [2020-07-17 22:33:39,082 INFO L280 TraceCheckUtils]: 8: Hoare triple {1718#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1718#true} is VALID [2020-07-17 22:33:39,082 INFO L280 TraceCheckUtils]: 9: Hoare triple {1718#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 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; {1718#true} is VALID [2020-07-17 22:33:39,082 INFO L280 TraceCheckUtils]: 10: Hoare triple {1718#true} assume !(~len > 0); {1718#true} is VALID [2020-07-17 22:33:39,082 INFO L280 TraceCheckUtils]: 11: Hoare triple {1718#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1718#true} is VALID [2020-07-17 22:33:39,083 INFO L280 TraceCheckUtils]: 12: Hoare triple {1718#true} assume true; {1718#true} is VALID [2020-07-17 22:33:39,084 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1718#true} {1723#(and (<= main_~len~1 2) (<= 2 main_~len~1))} #103#return; {1723#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-17 22:33:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:39,165 INFO L280 TraceCheckUtils]: 0: Hoare triple {1718#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {1748#(and (<= 0 sll_length_~len~0) (<= sll_length_~len~0 0))} is VALID [2020-07-17 22:33:39,167 INFO L280 TraceCheckUtils]: 1: Hoare triple {1748#(and (<= 0 sll_length_~len~0) (<= sll_length_~len~0 0))} assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1749#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} is VALID [2020-07-17 22:33:39,168 INFO L280 TraceCheckUtils]: 2: Hoare triple {1749#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1750#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2020-07-17 22:33:39,169 INFO L280 TraceCheckUtils]: 3: Hoare triple {1750#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} assume !(~head.base != 0 || ~head.offset != 0); {1750#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2020-07-17 22:33:39,170 INFO L280 TraceCheckUtils]: 4: Hoare triple {1750#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} #res := ~len~0; {1751#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} is VALID [2020-07-17 22:33:39,170 INFO L280 TraceCheckUtils]: 5: Hoare triple {1751#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} assume true; {1751#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} is VALID [2020-07-17 22:33:39,172 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1751#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} {1723#(and (<= main_~len~1 2) (<= 2 main_~len~1))} #105#return; {1745#(and (<= |main_#t~ret11| main_~len~1) (<= main_~len~1 |main_#t~ret11|))} is VALID [2020-07-17 22:33:39,175 INFO L263 TraceCheckUtils]: 0: Hoare triple {1718#true} call ULTIMATE.init(); {1746#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:33:39,176 INFO L280 TraceCheckUtils]: 1: Hoare triple {1746#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1718#true} is VALID [2020-07-17 22:33:39,176 INFO L280 TraceCheckUtils]: 2: Hoare triple {1718#true} assume true; {1718#true} is VALID [2020-07-17 22:33:39,176 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1718#true} {1718#true} #109#return; {1718#true} is VALID [2020-07-17 22:33:39,176 INFO L263 TraceCheckUtils]: 4: Hoare triple {1718#true} call #t~ret12 := main(); {1718#true} is VALID [2020-07-17 22:33:39,179 INFO L280 TraceCheckUtils]: 5: Hoare triple {1718#true} ~len~1 := 2; {1723#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-17 22:33:39,181 INFO L280 TraceCheckUtils]: 6: Hoare triple {1723#(and (<= main_~len~1 2) (<= 2 main_~len~1))} #t~short8 := ~len~1 < 32; {1723#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-17 22:33:39,182 INFO L280 TraceCheckUtils]: 7: Hoare triple {1723#(and (<= main_~len~1 2) (<= 2 main_~len~1))} assume #t~short8;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;#t~short8 := 0 != #t~nondet7; {1723#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-17 22:33:39,183 INFO L280 TraceCheckUtils]: 8: Hoare triple {1723#(and (<= main_~len~1 2) (<= 2 main_~len~1))} assume !#t~short8;havoc #t~nondet7;havoc #t~short8; {1723#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-17 22:33:39,183 INFO L263 TraceCheckUtils]: 9: Hoare triple {1723#(and (<= main_~len~1 2) (<= 2 main_~len~1))} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {1747#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:33:39,184 INFO L280 TraceCheckUtils]: 10: Hoare triple {1747#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {1718#true} is VALID [2020-07-17 22:33:39,184 INFO L280 TraceCheckUtils]: 11: Hoare triple {1718#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1718#true} is VALID [2020-07-17 22:33:39,184 INFO L280 TraceCheckUtils]: 12: Hoare triple {1718#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1718#true} is VALID [2020-07-17 22:33:39,184 INFO L280 TraceCheckUtils]: 13: Hoare triple {1718#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 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; {1718#true} is VALID [2020-07-17 22:33:39,184 INFO L280 TraceCheckUtils]: 14: Hoare triple {1718#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1718#true} is VALID [2020-07-17 22:33:39,184 INFO L280 TraceCheckUtils]: 15: Hoare triple {1718#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1718#true} is VALID [2020-07-17 22:33:39,184 INFO L280 TraceCheckUtils]: 16: Hoare triple {1718#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 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; {1718#true} is VALID [2020-07-17 22:33:39,185 INFO L280 TraceCheckUtils]: 17: Hoare triple {1718#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1718#true} is VALID [2020-07-17 22:33:39,185 INFO L280 TraceCheckUtils]: 18: Hoare triple {1718#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1718#true} is VALID [2020-07-17 22:33:39,185 INFO L280 TraceCheckUtils]: 19: Hoare triple {1718#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 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; {1718#true} is VALID [2020-07-17 22:33:39,185 INFO L280 TraceCheckUtils]: 20: Hoare triple {1718#true} assume !(~len > 0); {1718#true} is VALID [2020-07-17 22:33:39,186 INFO L280 TraceCheckUtils]: 21: Hoare triple {1718#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1718#true} is VALID [2020-07-17 22:33:39,186 INFO L280 TraceCheckUtils]: 22: Hoare triple {1718#true} assume true; {1718#true} is VALID [2020-07-17 22:33:39,188 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1718#true} {1723#(and (<= main_~len~1 2) (<= 2 main_~len~1))} #103#return; {1723#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-17 22:33:39,189 INFO L280 TraceCheckUtils]: 24: Hoare triple {1723#(and (<= main_~len~1 2) (<= 2 main_~len~1))} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset; {1723#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-17 22:33:39,189 INFO L263 TraceCheckUtils]: 25: Hoare triple {1723#(and (<= main_~len~1 2) (<= 2 main_~len~1))} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {1718#true} is VALID [2020-07-17 22:33:39,189 INFO L280 TraceCheckUtils]: 26: Hoare triple {1718#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {1748#(and (<= 0 sll_length_~len~0) (<= sll_length_~len~0 0))} is VALID [2020-07-17 22:33:39,190 INFO L280 TraceCheckUtils]: 27: Hoare triple {1748#(and (<= 0 sll_length_~len~0) (<= sll_length_~len~0 0))} assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1749#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} is VALID [2020-07-17 22:33:39,192 INFO L280 TraceCheckUtils]: 28: Hoare triple {1749#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1750#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2020-07-17 22:33:39,192 INFO L280 TraceCheckUtils]: 29: Hoare triple {1750#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} assume !(~head.base != 0 || ~head.offset != 0); {1750#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2020-07-17 22:33:39,193 INFO L280 TraceCheckUtils]: 30: Hoare triple {1750#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} #res := ~len~0; {1751#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} is VALID [2020-07-17 22:33:39,193 INFO L280 TraceCheckUtils]: 31: Hoare triple {1751#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} assume true; {1751#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} is VALID [2020-07-17 22:33:39,195 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1751#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} {1723#(and (<= main_~len~1 2) (<= 2 main_~len~1))} #105#return; {1745#(and (<= |main_#t~ret11| main_~len~1) (<= main_~len~1 |main_#t~ret11|))} is VALID [2020-07-17 22:33:39,195 INFO L280 TraceCheckUtils]: 33: Hoare triple {1745#(and (<= |main_#t~ret11| main_~len~1) (<= main_~len~1 |main_#t~ret11|))} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {1745#(and (<= |main_#t~ret11| main_~len~1) (<= main_~len~1 |main_#t~ret11|))} is VALID [2020-07-17 22:33:39,196 INFO L280 TraceCheckUtils]: 34: Hoare triple {1745#(and (<= |main_#t~ret11| main_~len~1) (<= main_~len~1 |main_#t~ret11|))} assume ~len~1 != #t~ret11;havoc #t~ret11; {1719#false} is VALID [2020-07-17 22:33:39,196 INFO L280 TraceCheckUtils]: 35: Hoare triple {1719#false} assume !false; {1719#false} is VALID [2020-07-17 22:33:39,199 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-17 22:33:39,199 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706997670] [2020-07-17 22:33:39,199 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66780672] [2020-07-17 22:33:39,200 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:33:39,290 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:33:39,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:33:39,292 INFO L264 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-17 22:33:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:39,309 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:33:39,455 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:33:39,469 INFO L263 TraceCheckUtils]: 0: Hoare triple {1718#true} call ULTIMATE.init(); {1718#true} is VALID [2020-07-17 22:33:39,470 INFO L280 TraceCheckUtils]: 1: Hoare triple {1718#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1718#true} is VALID [2020-07-17 22:33:39,470 INFO L280 TraceCheckUtils]: 2: Hoare triple {1718#true} assume true; {1718#true} is VALID [2020-07-17 22:33:39,470 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1718#true} {1718#true} #109#return; {1718#true} is VALID [2020-07-17 22:33:39,470 INFO L263 TraceCheckUtils]: 4: Hoare triple {1718#true} call #t~ret12 := main(); {1718#true} is VALID [2020-07-17 22:33:39,471 INFO L280 TraceCheckUtils]: 5: Hoare triple {1718#true} ~len~1 := 2; {1723#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-17 22:33:39,471 INFO L280 TraceCheckUtils]: 6: Hoare triple {1723#(and (<= main_~len~1 2) (<= 2 main_~len~1))} #t~short8 := ~len~1 < 32; {1723#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-17 22:33:39,472 INFO L280 TraceCheckUtils]: 7: Hoare triple {1723#(and (<= main_~len~1 2) (<= 2 main_~len~1))} assume #t~short8;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;#t~short8 := 0 != #t~nondet7; {1723#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-17 22:33:39,472 INFO L280 TraceCheckUtils]: 8: Hoare triple {1723#(and (<= main_~len~1 2) (<= 2 main_~len~1))} assume !#t~short8;havoc #t~nondet7;havoc #t~short8; {1723#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-17 22:33:39,473 INFO L263 TraceCheckUtils]: 9: Hoare triple {1723#(and (<= main_~len~1 2) (<= 2 main_~len~1))} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {1718#true} is VALID [2020-07-17 22:33:39,473 INFO L280 TraceCheckUtils]: 10: Hoare triple {1718#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {1718#true} is VALID [2020-07-17 22:33:39,473 INFO L280 TraceCheckUtils]: 11: Hoare triple {1718#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1718#true} is VALID [2020-07-17 22:33:39,473 INFO L280 TraceCheckUtils]: 12: Hoare triple {1718#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1718#true} is VALID [2020-07-17 22:33:39,473 INFO L280 TraceCheckUtils]: 13: Hoare triple {1718#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 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; {1718#true} is VALID [2020-07-17 22:33:39,473 INFO L280 TraceCheckUtils]: 14: Hoare triple {1718#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1718#true} is VALID [2020-07-17 22:33:39,474 INFO L280 TraceCheckUtils]: 15: Hoare triple {1718#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1718#true} is VALID [2020-07-17 22:33:39,474 INFO L280 TraceCheckUtils]: 16: Hoare triple {1718#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 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; {1718#true} is VALID [2020-07-17 22:33:39,475 INFO L280 TraceCheckUtils]: 17: Hoare triple {1718#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1718#true} is VALID [2020-07-17 22:33:39,475 INFO L280 TraceCheckUtils]: 18: Hoare triple {1718#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1718#true} is VALID [2020-07-17 22:33:39,475 INFO L280 TraceCheckUtils]: 19: Hoare triple {1718#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 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; {1718#true} is VALID [2020-07-17 22:33:39,476 INFO L280 TraceCheckUtils]: 20: Hoare triple {1718#true} assume !(~len > 0); {1718#true} is VALID [2020-07-17 22:33:39,476 INFO L280 TraceCheckUtils]: 21: Hoare triple {1718#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1718#true} is VALID [2020-07-17 22:33:39,476 INFO L280 TraceCheckUtils]: 22: Hoare triple {1718#true} assume true; {1718#true} is VALID [2020-07-17 22:33:39,480 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1718#true} {1723#(and (<= main_~len~1 2) (<= 2 main_~len~1))} #103#return; {1723#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-17 22:33:39,484 INFO L280 TraceCheckUtils]: 24: Hoare triple {1723#(and (<= main_~len~1 2) (<= 2 main_~len~1))} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset; {1723#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-17 22:33:39,484 INFO L263 TraceCheckUtils]: 25: Hoare triple {1723#(and (<= main_~len~1 2) (<= 2 main_~len~1))} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {1718#true} is VALID [2020-07-17 22:33:39,485 INFO L280 TraceCheckUtils]: 26: Hoare triple {1718#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {1748#(and (<= 0 sll_length_~len~0) (<= sll_length_~len~0 0))} is VALID [2020-07-17 22:33:39,491 INFO L280 TraceCheckUtils]: 27: Hoare triple {1748#(and (<= 0 sll_length_~len~0) (<= sll_length_~len~0 0))} assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1749#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} is VALID [2020-07-17 22:33:39,492 INFO L280 TraceCheckUtils]: 28: Hoare triple {1749#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1750#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2020-07-17 22:33:39,493 INFO L280 TraceCheckUtils]: 29: Hoare triple {1750#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} assume !(~head.base != 0 || ~head.offset != 0); {1750#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2020-07-17 22:33:39,494 INFO L280 TraceCheckUtils]: 30: Hoare triple {1750#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} #res := ~len~0; {1751#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} is VALID [2020-07-17 22:33:39,495 INFO L280 TraceCheckUtils]: 31: Hoare triple {1751#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} assume true; {1751#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} is VALID [2020-07-17 22:33:39,496 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1751#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} {1723#(and (<= main_~len~1 2) (<= 2 main_~len~1))} #105#return; {1851#(and (<= main_~len~1 2) (<= |main_#t~ret11| 2) (<= 2 |main_#t~ret11|) (<= 2 main_~len~1))} is VALID [2020-07-17 22:33:39,497 INFO L280 TraceCheckUtils]: 33: Hoare triple {1851#(and (<= main_~len~1 2) (<= |main_#t~ret11| 2) (<= 2 |main_#t~ret11|) (<= 2 main_~len~1))} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {1851#(and (<= main_~len~1 2) (<= |main_#t~ret11| 2) (<= 2 |main_#t~ret11|) (<= 2 main_~len~1))} is VALID [2020-07-17 22:33:39,497 INFO L280 TraceCheckUtils]: 34: Hoare triple {1851#(and (<= main_~len~1 2) (<= |main_#t~ret11| 2) (<= 2 |main_#t~ret11|) (<= 2 main_~len~1))} assume ~len~1 != #t~ret11;havoc #t~ret11; {1719#false} is VALID [2020-07-17 22:33:39,498 INFO L280 TraceCheckUtils]: 35: Hoare triple {1719#false} assume !false; {1719#false} is VALID [2020-07-17 22:33:39,499 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-17 22:33:39,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:33:39,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2020-07-17 22:33:39,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984229139] [2020-07-17 22:33:39,501 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2020-07-17 22:33:39,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:33:39,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-17 22:33:39,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:39,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 22:33:39,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:33:39,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 22:33:39,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:33:39,542 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 11 states. [2020-07-17 22:33:40,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:40,406 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2020-07-17 22:33:40,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:33:40,406 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2020-07-17 22:33:40,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:33:40,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:33:40,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2020-07-17 22:33:40,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:33:40,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2020-07-17 22:33:40,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 56 transitions. [2020-07-17 22:33:40,500 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:40,504 INFO L225 Difference]: With dead ends: 55 [2020-07-17 22:33:40,505 INFO L226 Difference]: Without dead ends: 51 [2020-07-17 22:33:40,506 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2020-07-17 22:33:40,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-17 22:33:40,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2020-07-17 22:33:40,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:33:40,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 47 states. [2020-07-17 22:33:40,573 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 47 states. [2020-07-17 22:33:40,573 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 47 states. [2020-07-17 22:33:40,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:40,578 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2020-07-17 22:33:40,579 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-07-17 22:33:40,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:40,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:40,579 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 51 states. [2020-07-17 22:33:40,579 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 51 states. [2020-07-17 22:33:40,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:40,582 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2020-07-17 22:33:40,582 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-07-17 22:33:40,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:40,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:40,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:33:40,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:33:40,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-17 22:33:40,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2020-07-17 22:33:40,588 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 36 [2020-07-17 22:33:40,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:33:40,588 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2020-07-17 22:33:40,588 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 22:33:40,588 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-17 22:33:40,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-17 22:33:40,589 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:33:40,589 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-17 22:33:40,790 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:33:40,791 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:33:40,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:33:40,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1775282106, now seen corresponding path program 3 times [2020-07-17 22:33:40,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:33:40,792 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669307037] [2020-07-17 22:33:40,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:33:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:33:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:33:40,901 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:33:40,901 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:33:40,901 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 22:33:40,974 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:33:40,974 WARN L170 areAnnotationChecker]: myexitENTRY has no Hoare annotation [2020-07-17 22:33:40,974 WARN L170 areAnnotationChecker]: sll_destroyENTRY has no Hoare annotation [2020-07-17 22:33:40,974 WARN L170 areAnnotationChecker]: __bswap_32ENTRY has no Hoare annotation [2020-07-17 22:33:40,975 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:33:40,975 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:33:40,975 WARN L170 areAnnotationChecker]: __bswap_64ENTRY has no Hoare annotation [2020-07-17 22:33:40,975 WARN L170 areAnnotationChecker]: sll_createENTRY has no Hoare annotation [2020-07-17 22:33:40,975 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:33:40,975 WARN L170 areAnnotationChecker]: sll_lengthENTRY has no Hoare annotation [2020-07-17 22:33:40,975 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:33:40,975 WARN L170 areAnnotationChecker]: L561 has no Hoare annotation [2020-07-17 22:33:40,975 WARN L170 areAnnotationChecker]: L585-2 has no Hoare annotation [2020-07-17 22:33:40,975 WARN L170 areAnnotationChecker]: L585-2 has no Hoare annotation [2020-07-17 22:33:40,976 WARN L170 areAnnotationChecker]: L585-2 has no Hoare annotation [2020-07-17 22:33:40,976 WARN L170 areAnnotationChecker]: __bswap_32FINAL has no Hoare annotation [2020-07-17 22:33:40,976 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:33:40,976 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:33:40,976 WARN L170 areAnnotationChecker]: __bswap_64FINAL has no Hoare annotation [2020-07-17 22:33:40,976 WARN L170 areAnnotationChecker]: L565-2 has no Hoare annotation [2020-07-17 22:33:40,976 WARN L170 areAnnotationChecker]: L565-2 has no Hoare annotation [2020-07-17 22:33:40,976 WARN L170 areAnnotationChecker]: L565-2 has no Hoare annotation [2020-07-17 22:33:40,976 WARN L170 areAnnotationChecker]: L593-5 has no Hoare annotation [2020-07-17 22:33:40,976 WARN L170 areAnnotationChecker]: L593-5 has no Hoare annotation [2020-07-17 22:33:40,977 WARN L170 areAnnotationChecker]: L578-2 has no Hoare annotation [2020-07-17 22:33:40,977 WARN L170 areAnnotationChecker]: L578-2 has no Hoare annotation [2020-07-17 22:33:40,977 WARN L170 areAnnotationChecker]: L578-2 has no Hoare annotation [2020-07-17 22:33:40,977 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:33:40,977 WARN L170 areAnnotationChecker]: L585-3 has no Hoare annotation [2020-07-17 22:33:40,977 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:33:40,977 WARN L170 areAnnotationChecker]: L565-3 has no Hoare annotation [2020-07-17 22:33:40,977 WARN L170 areAnnotationChecker]: L567 has no Hoare annotation [2020-07-17 22:33:40,977 WARN L170 areAnnotationChecker]: L567 has no Hoare annotation [2020-07-17 22:33:40,977 WARN L170 areAnnotationChecker]: L593-6 has no Hoare annotation [2020-07-17 22:33:40,977 WARN L170 areAnnotationChecker]: L593-6 has no Hoare annotation [2020-07-17 22:33:40,978 WARN L170 areAnnotationChecker]: L593-1 has no Hoare annotation [2020-07-17 22:33:40,978 WARN L170 areAnnotationChecker]: L593-1 has no Hoare annotation [2020-07-17 22:33:40,978 WARN L170 areAnnotationChecker]: L578-3 has no Hoare annotation [2020-07-17 22:33:40,978 WARN L170 areAnnotationChecker]: sll_destroyEXIT has no Hoare annotation [2020-07-17 22:33:40,978 WARN L170 areAnnotationChecker]: sll_createFINAL has no Hoare annotation [2020-07-17 22:33:40,978 WARN L170 areAnnotationChecker]: L568 has no Hoare annotation [2020-07-17 22:33:40,978 WARN L170 areAnnotationChecker]: L568 has no Hoare annotation [2020-07-17 22:33:40,978 WARN L170 areAnnotationChecker]: L567-1 has no Hoare annotation [2020-07-17 22:33:40,978 WARN L170 areAnnotationChecker]: L596 has no Hoare annotation [2020-07-17 22:33:40,979 WARN L170 areAnnotationChecker]: L593-3 has no Hoare annotation [2020-07-17 22:33:40,979 WARN L170 areAnnotationChecker]: L593-3 has no Hoare annotation [2020-07-17 22:33:40,979 WARN L170 areAnnotationChecker]: sll_lengthFINAL has no Hoare annotation [2020-07-17 22:33:40,979 WARN L170 areAnnotationChecker]: L600-1 has no Hoare annotation [2020-07-17 22:33:40,979 WARN L170 areAnnotationChecker]: sll_createEXIT has no Hoare annotation [2020-07-17 22:33:40,979 WARN L170 areAnnotationChecker]: L597 has no Hoare annotation [2020-07-17 22:33:40,979 WARN L170 areAnnotationChecker]: L597 has no Hoare annotation [2020-07-17 22:33:40,979 WARN L170 areAnnotationChecker]: sll_lengthEXIT has no Hoare annotation [2020-07-17 22:33:40,979 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:33:40,979 WARN L170 areAnnotationChecker]: L597-1 has no Hoare annotation [2020-07-17 22:33:40,980 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:33:40,980 WARN L170 areAnnotationChecker]: L597-2 has no Hoare annotation [2020-07-17 22:33:40,980 WARN L170 areAnnotationChecker]: L597-2 has no Hoare annotation [2020-07-17 22:33:40,980 WARN L170 areAnnotationChecker]: L598 has no Hoare annotation [2020-07-17 22:33:40,980 WARN L170 areAnnotationChecker]: L598 has no Hoare annotation [2020-07-17 22:33:40,980 WARN L170 areAnnotationChecker]: L600 has no Hoare annotation [2020-07-17 22:33:40,980 WARN L170 areAnnotationChecker]: L600 has no Hoare annotation [2020-07-17 22:33:40,980 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. [2020-07-17 22:33:40,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:33:40 BoogieIcfgContainer [2020-07-17 22:33:40,984 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:33:40,987 INFO L168 Benchmark]: Toolchain (without parser) took 27162.68 ms. Allocated memory was 145.2 MB in the beginning and 336.6 MB in the end (delta: 191.4 MB). Free memory was 102.0 MB in the beginning and 217.9 MB in the end (delta: -115.8 MB). Peak memory consumption was 75.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:33:40,987 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:33:40,988 INFO L168 Benchmark]: CACSL2BoogieTranslator took 719.40 ms. Allocated memory was 145.2 MB in the beginning and 205.5 MB in the end (delta: 60.3 MB). Free memory was 101.6 MB in the beginning and 171.4 MB in the end (delta: -69.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:33:40,988 INFO L168 Benchmark]: Boogie Preprocessor took 70.16 ms. Allocated memory is still 205.5 MB. Free memory was 171.4 MB in the beginning and 168.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:33:40,994 INFO L168 Benchmark]: RCFGBuilder took 702.27 ms. Allocated memory is still 205.5 MB. Free memory was 168.0 MB in the beginning and 115.0 MB in the end (delta: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:33:40,994 INFO L168 Benchmark]: TraceAbstraction took 25663.24 ms. Allocated memory was 205.5 MB in the beginning and 336.6 MB in the end (delta: 131.1 MB). Free memory was 115.0 MB in the beginning and 217.9 MB in the end (delta: -102.8 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:33:40,998 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 719.40 ms. Allocated memory was 145.2 MB in the beginning and 205.5 MB in the end (delta: 60.3 MB). Free memory was 101.6 MB in the beginning and 171.4 MB in the end (delta: -69.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 70.16 ms. Allocated memory is still 205.5 MB. Free memory was 171.4 MB in the beginning and 168.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 702.27 ms. Allocated memory is still 205.5 MB. Free memory was 168.0 MB in the beginning and 115.0 MB in the end (delta: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25663.24 ms. Allocated memory was 205.5 MB in the beginning and 336.6 MB in the end (delta: 131.1 MB). Free memory was 115.0 MB in the beginning and 217.9 MB in the end (delta: -102.8 MB). Peak memory consumption was 28.2 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] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={0:0}, len=3, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={0:0}, len=3, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L570] new_head->next = head [L571] head = new_head [L572] len-- VAL [\old(len)=3, head={-1:0}, len=2, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L565] COND TRUE len > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={-1:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={-1:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L570] new_head->next = head [L571] head = new_head [L572] len-- VAL [\old(len)=3, head={-2:0}, len=1, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L565] COND TRUE len > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={-2:0}, len=1, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={-2:0}, len=1, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L570] new_head->next = head [L571] head = new_head [L572] len-- VAL [\old(len)=3, head={-3:0}, len=0, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L565] COND FALSE !(len > 0) VAL [\old(len)=3, head={-3:0}, len=0, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L574] return head; VAL [\old(len)=3, \result={-3:0}, head={-3:0}, len=0, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L596] RET, EXPR sll_create(len + 1) VAL [len=2, sll_create(len + 1)={-3:0}] [L596] SLL s = sll_create(len + 1); [L597] CALL, EXPR sll_length(s) VAL [head={-3:0}] [L577] int len = 0; VAL [head={-3:0}, head={-3:0}, len=0] [L578] COND TRUE \read(head) [L579] len++ [L580] EXPR head->next [L580] head = head->next [L578] COND TRUE \read(head) [L579] len++ [L580] EXPR head->next [L580] head = head->next [L578] COND TRUE \read(head) [L579] len++ [L580] EXPR head->next [L580] head = head->next [L578] COND FALSE !(\read(head)) VAL [head={-3:0}, head={0:0}, len=3] [L582] return len; VAL [\result=3, head={-3:0}, head={0:0}, len=3] [L597] RET, EXPR sll_length(s) VAL [len=2, s={-3:0}, sll_length(s)=3] [L597] COND TRUE len != sll_length(s) [L602] __VERIFIER_error() VAL [len=2, s={-3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 25.5s, OverallIterations: 8, TraceHistogramMax: 3, AutomataDifference: 20.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 183 SDtfs, 316 SDslu, 527 SDs, 0 SdLazy, 952 SolverSat, 99 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 7.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 255 GetRequests, 159 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 20 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 379 NumberOfCodeBlocks, 379 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 331 ConstructedInterpolants, 6 QuantifiedInterpolants, 34578 SizeOfPredicates, 18 NumberOfNonLiveVariables, 591 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 55/80 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...