java -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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/list-simple/sll2n_update_all.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:28:14,463 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:28:14,467 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:28:14,486 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:28:14,486 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:28:14,488 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:28:14,490 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:28:14,499 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:28:14,504 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:28:14,507 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:28:14,508 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:28:14,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:28:14,510 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:28:14,512 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:28:14,514 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:28:14,515 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:28:14,517 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:28:14,517 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:28:14,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:28:14,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:28:14,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:28:14,524 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:28:14,525 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:28:14,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:28:14,528 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:28:14,528 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:28:14,528 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:28:14,529 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:28:14,529 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:28:14,530 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:28:14,531 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:28:14,532 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:28:14,533 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:28:14,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:28:14,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:28:14,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:28:14,537 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:28:14,537 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:28:14,537 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:28:14,538 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:28:14,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:28:14,540 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 [2019-10-07 13:28:14,571 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:28:14,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:28:14,576 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:28:14,576 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:28:14,576 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:28:14,577 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:28:14,577 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:28:14,579 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:28:14,579 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:28:14,579 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:28:14,579 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:28:14,580 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:28:14,580 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:28:14,580 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:28:14,581 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:28:14,581 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:28:14,581 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:28:14,582 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:28:14,582 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:28:14,582 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:28:14,582 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:28:14,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:28:14,583 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:28:14,583 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:28:14,583 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:28:14,584 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:28:14,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:28:14,584 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:28:14,584 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 13:28:14,879 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:28:14,892 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:28:14,895 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:28:14,897 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:28:14,897 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:28:14,898 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_update_all.i [2019-10-07 13:28:14,960 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15b2ac4e7/068169ba163542c99b2832486e2babc1/FLAG435951c21 [2019-10-07 13:28:15,497 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:28:15,498 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_update_all.i [2019-10-07 13:28:15,520 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15b2ac4e7/068169ba163542c99b2832486e2babc1/FLAG435951c21 [2019-10-07 13:28:15,801 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15b2ac4e7/068169ba163542c99b2832486e2babc1 [2019-10-07 13:28:15,813 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:28:15,814 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:28:15,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:28:15,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:28:15,819 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:28:15,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:28:15" (1/1) ... [2019-10-07 13:28:15,823 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bd5e051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:15, skipping insertion in model container [2019-10-07 13:28:15,823 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:28:15" (1/1) ... [2019-10-07 13:28:15,830 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:28:15,877 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:28:16,349 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:28:16,370 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:28:16,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:28:16,483 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:28:16,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:16 WrapperNode [2019-10-07 13:28:16,484 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:28:16,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:28:16,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:28:16,486 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:28:16,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:16" (1/1) ... [2019-10-07 13:28:16,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:16" (1/1) ... [2019-10-07 13:28:16,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:16" (1/1) ... [2019-10-07 13:28:16,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:16" (1/1) ... [2019-10-07 13:28:16,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:16" (1/1) ... [2019-10-07 13:28:16,541 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:16" (1/1) ... [2019-10-07 13:28:16,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:16" (1/1) ... [2019-10-07 13:28:16,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:28:16,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:28:16,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:28:16,553 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:28:16,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:16" (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 [2019-10-07 13:28:16,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:28:16,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:28:16,607 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-07 13:28:16,608 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-07 13:28:16,608 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-07 13:28:16,609 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-10-07 13:28:16,609 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-10-07 13:28:16,609 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2019-10-07 13:28:16,610 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2019-10-07 13:28:16,610 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2019-10-07 13:28:16,610 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:28:16,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:28:16,611 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-07 13:28:16,612 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-07 13:28:16,612 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-07 13:28:16,612 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-07 13:28:16,614 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-07 13:28:16,614 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-07 13:28:16,615 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-07 13:28:16,615 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-07 13:28:16,615 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-07 13:28:16,616 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-07 13:28:16,616 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-07 13:28:16,616 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-07 13:28:16,616 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-07 13:28:16,618 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-07 13:28:16,618 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-07 13:28:16,618 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-07 13:28:16,618 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-07 13:28:16,618 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-07 13:28:16,618 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-07 13:28:16,619 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-07 13:28:16,619 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-07 13:28:16,619 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-07 13:28:16,619 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-07 13:28:16,620 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-07 13:28:16,620 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-07 13:28:16,620 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-07 13:28:16,620 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-07 13:28:16,621 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-07 13:28:16,621 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-07 13:28:16,621 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-07 13:28:16,621 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-07 13:28:16,621 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-07 13:28:16,621 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-07 13:28:16,621 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-07 13:28:16,622 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-07 13:28:16,622 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-07 13:28:16,622 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-07 13:28:16,622 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-07 13:28:16,622 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-07 13:28:16,622 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-07 13:28:16,622 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-07 13:28:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-07 13:28:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-07 13:28:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-07 13:28:16,624 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-07 13:28:16,624 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-07 13:28:16,624 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-07 13:28:16,624 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-07 13:28:16,625 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-07 13:28:16,625 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-07 13:28:16,625 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-07 13:28:16,625 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-07 13:28:16,626 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 13:28:16,626 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-07 13:28:16,626 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-07 13:28:16,626 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-07 13:28:16,627 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-07 13:28:16,627 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-07 13:28:16,627 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-07 13:28:16,627 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-07 13:28:16,628 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-07 13:28:16,628 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-07 13:28:16,629 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-07 13:28:16,629 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-07 13:28:16,629 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-07 13:28:16,629 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 13:28:16,630 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-07 13:28:16,630 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-07 13:28:16,631 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-07 13:28:16,631 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-07 13:28:16,632 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-07 13:28:16,632 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-07 13:28:16,632 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-07 13:28:16,632 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-07 13:28:16,632 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-07 13:28:16,632 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-07 13:28:16,633 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-07 13:28:16,633 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-07 13:28:16,633 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-07 13:28:16,633 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-07 13:28:16,633 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-07 13:28:16,633 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-07 13:28:16,633 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-07 13:28:16,634 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-07 13:28:16,634 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-07 13:28:16,634 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-07 13:28:16,634 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-07 13:28:16,634 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-07 13:28:16,634 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-07 13:28:16,634 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-07 13:28:16,635 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-07 13:28:16,635 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-07 13:28:16,635 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-07 13:28:16,635 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-07 13:28:16,635 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-07 13:28:16,635 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-07 13:28:16,635 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-07 13:28:16,636 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-07 13:28:16,636 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-07 13:28:16,636 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-07 13:28:16,636 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-07 13:28:16,636 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-07 13:28:16,636 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-07 13:28:16,636 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-07 13:28:16,637 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-07 13:28:16,637 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-07 13:28:16,637 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-10-07 13:28:16,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 13:28:16,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 13:28:16,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 13:28:16,638 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-10-07 13:28:16,639 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2019-10-07 13:28:16,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 13:28:16,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 13:28:16,639 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2019-10-07 13:28:16,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 13:28:16,639 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2019-10-07 13:28:16,640 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:28:16,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:28:16,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:28:17,100 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-07 13:28:17,305 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:28:17,305 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-07 13:28:17,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:28:17 BoogieIcfgContainer [2019-10-07 13:28:17,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:28:17,308 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:28:17,308 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:28:17,311 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:28:17,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:28:15" (1/3) ... [2019-10-07 13:28:17,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@361481bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:28:17, skipping insertion in model container [2019-10-07 13:28:17,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:16" (2/3) ... [2019-10-07 13:28:17,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@361481bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:28:17, skipping insertion in model container [2019-10-07 13:28:17,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:28:17" (3/3) ... [2019-10-07 13:28:17,315 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.i [2019-10-07 13:28:17,325 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:28:17,334 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:28:17,345 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:28:17,368 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:28:17,369 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:28:17,369 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:28:17,369 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:28:17,369 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:28:17,370 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:28:17,370 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:28:17,370 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:28:17,386 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2019-10-07 13:28:17,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-07 13:28:17,393 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:17,394 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:17,396 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:17,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:17,400 INFO L82 PathProgramCache]: Analyzing trace with hash -489949846, now seen corresponding path program 1 times [2019-10-07 13:28:17,408 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:17,408 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:17,409 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:17,409 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:17,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:17,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:17,642 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:17,643 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:17,643 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:28:17,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:28:17,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:28:17,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:28:17,683 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 5 states. [2019-10-07 13:28:17,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:17,783 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2019-10-07 13:28:17,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:28:17,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-10-07 13:28:17,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:17,795 INFO L225 Difference]: With dead ends: 72 [2019-10-07 13:28:17,796 INFO L226 Difference]: Without dead ends: 34 [2019-10-07 13:28:17,799 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:28:17,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-07 13:28:17,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-10-07 13:28:17,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-07 13:28:17,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-10-07 13:28:17,849 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2019-10-07 13:28:17,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:17,849 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-10-07 13:28:17,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:28:17,850 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-10-07 13:28:17,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-07 13:28:17,851 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:17,851 INFO L385 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] [2019-10-07 13:28:17,851 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:17,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:17,852 INFO L82 PathProgramCache]: Analyzing trace with hash -550726152, now seen corresponding path program 1 times [2019-10-07 13:28:17,852 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:17,852 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:17,852 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:17,853 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:17,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:17,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:17,984 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:17,984 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:28:17,984 INFO L95 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 [2019-10-07 13:28:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:18,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-07 13:28:18,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:28:18,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:18,162 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:28:18,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:18,310 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:28:18,354 INFO L162 IcfgInterpreter]: Started Sifa with 26 locations of interest [2019-10-07 13:28:18,355 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:28:18,363 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:28:18,376 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:28:18,377 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:28:18,540 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-07 13:28:18,681 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:19,722 INFO L199 IcfgInterpreter]: Interpreting procedure sll_get_data_at with input of size 1 for LOIs [2019-10-07 13:28:19,731 INFO L199 IcfgInterpreter]: Interpreting procedure sll_create with input of size 33 for LOIs [2019-10-07 13:28:20,935 INFO L199 IcfgInterpreter]: Interpreting procedure node_create with input of size 29 for LOIs [2019-10-07 13:28:20,984 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:28:20,987 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:28:20,988 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:28:20,988 INFO L193 IcfgInterpreter]: Reachable states at location sll_get_data_atEXIT satisfy 273#false [2019-10-07 13:28:20,988 INFO L193 IcfgInterpreter]: Reachable states at location L574-3 satisfy 342#(and (or (and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 1 sll_create_~data) (<= 2 |sll_create_#in~len|) (<= 1 |sll_create_#in~data|) (<= 0 |#NULL.base|) (<= |sll_create_#in~data| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= sll_create_~data 1) (<= sll_create_~len 2) (= |sll_create_#in~len| 2) (<= 0 sll_create_~head~0.offset) (<= |sll_create_#in~len| 2) (= |#NULL.offset| 0) (= |sll_create_#in~data| 1)) (and (= 0 |#NULL.base|) (<= 1 sll_create_~data) (<= 2 sll_create_~len) (<= 2 |sll_create_#in~len|) (<= 1 |sll_create_#in~data|) (<= 0 |#NULL.base|) (<= |sll_create_#in~data| 1) (<= 0 |#NULL.offset|) (<= sll_create_~data 1) (= |sll_create_#in~len| sll_create_~len) (<= |sll_create_#in~len| 2) (= 0 sll_create_~head~0.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (<= sll_create_~head~0.base 0) (= |sll_create_#in~data| 1) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= sll_create_~head~0.base 0) (<= |#NULL.base| 0) (= |sll_create_#in~data| sll_create_~data) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= sll_create_~len 2) (= |#valid| |old(#valid)|) (= |sll_create_#in~len| 2) (<= 0 sll_create_~head~0.offset) (= |#memory_int| |old(#memory_int)|) (<= 0 sll_create_~head~0.base) (= |#NULL.offset| 0))) (<= sll_create_~head~0.offset 0)) [2019-10-07 13:28:20,989 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:28:20,989 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 13:28:20,989 INFO L193 IcfgInterpreter]: Reachable states at location L589-2 satisfy 268#false [2019-10-07 13:28:20,989 INFO L193 IcfgInterpreter]: Reachable states at location L613 satisfy 243#false [2019-10-07 13:28:20,990 INFO L193 IcfgInterpreter]: Reachable states at location L565-1 satisfy 379#(and (<= 0 node_create_~temp~0.offset) (<= |node_create_#t~malloc2.offset| 0) (<= node_create_~temp~0.offset 0) (<= node_create_~data 1) (<= 1 node_create_~data) (<= 0 |node_create_#t~malloc2.offset|) (or (and (= |#NULL.base| 0) (not (= node_create_~temp~0.offset 0)) (<= |#NULL.base| 0) (<= |node_create_#in~data| 1) (= (store |old(#length)| |node_create_#t~malloc2.base| 8) |#length|) (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= node_create_~data |node_create_#in~data|) (= |node_create_#t~malloc2.base| node_create_~temp~0.base) (<= 0 |#NULL.base|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= node_create_~temp~0.offset |node_create_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |node_create_#t~malloc2.offset| 0) (<= 1 |node_create_#in~data|) (not (= |node_create_#t~malloc2.base| 0)) (= |#memory_int| |old(#memory_int)|) (< |#StackHeapBarrier| |node_create_#t~malloc2.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= |node_create_#in~data| 1) (= (store |old(#length)| |node_create_#t~malloc2.base| 8) |#length|) (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= node_create_~data |node_create_#in~data|) (= |node_create_#t~malloc2.base| node_create_~temp~0.base) (<= 0 |#NULL.base|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= node_create_~temp~0.offset |node_create_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (not (= 0 node_create_~temp~0.base)) (= |node_create_#t~malloc2.offset| 0) (<= 1 |node_create_#in~data|) (not (= |node_create_#t~malloc2.base| 0)) (= |#memory_int| |old(#memory_int)|) (< |#StackHeapBarrier| |node_create_#t~malloc2.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))) [2019-10-07 13:28:20,990 INFO L193 IcfgInterpreter]: Reachable states at location L613-1 satisfy 2#false [2019-10-07 13:28:20,990 INFO L193 IcfgInterpreter]: Reachable states at location L565 satisfy 374#(and (<= |node_create_#in~data| 1) (= (store |old(#length)| |node_create_#t~malloc2.base| 8) |#length|) (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= |node_create_#t~malloc2.base| node_create_~temp~0.base) (<= 0 |#NULL.base|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= node_create_~temp~0.offset |node_create_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (= |node_create_#t~malloc2.offset| 0) (<= node_create_~data 1) (not (= |node_create_#t~malloc2.base| 0)) (<= 1 node_create_~data) (<= 0 |node_create_#t~malloc2.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |#NULL.base| 0) (<= |#NULL.base| 0) (= node_create_~data |node_create_#in~data|) (<= 0 node_create_~temp~0.offset) (<= |node_create_#t~malloc2.offset| 0) (<= |#NULL.offset| 0) (<= node_create_~temp~0.offset 0) (<= 1 |node_create_#in~data|) (= |#memory_int| |old(#memory_int)|) (< |#StackHeapBarrier| |node_create_#t~malloc2.base|) (= |#NULL.offset| 0)) [2019-10-07 13:28:20,990 INFO L193 IcfgInterpreter]: Reachable states at location L613-2 satisfy 2#false [2019-10-07 13:28:20,990 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 2#false [2019-10-07 13:28:20,991 INFO L193 IcfgInterpreter]: Reachable states at location sll_createEXIT satisfy 347#(and (= |#NULL.base| 0) (<= sll_create_~len 0) (= |sll_create_#res.offset| sll_create_~head~0.offset) (<= |#NULL.base| 0) (<= 1 sll_create_~data) (not (< 0 sll_create_~len)) (<= 2 |sll_create_#in~len|) (<= 1 |sll_create_#in~data|) (<= 0 |sll_create_#res.offset|) (<= 0 |#NULL.base|) (<= |sll_create_#in~data| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= sll_create_~data 1) (<= sll_create_~len 2) (= |sll_create_#in~len| 2) (<= 0 sll_create_~head~0.offset) (<= |sll_create_#in~len| 2) (<= |sll_create_#res.offset| 0) (= sll_create_~head~0.base |sll_create_#res.base|) (= |#NULL.offset| 0) (<= sll_create_~head~0.offset 0) (= |sll_create_#in~data| 1)) [2019-10-07 13:28:20,991 INFO L193 IcfgInterpreter]: Reachable states at location node_createENTRY satisfy 369#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= |node_create_#in~data| 1) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| |old(#valid)|) (<= 1 |node_create_#in~data|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 13:28:20,991 INFO L193 IcfgInterpreter]: Reachable states at location L611-3 satisfy 253#false [2019-10-07 13:28:20,991 INFO L193 IcfgInterpreter]: Reachable states at location sll_createENTRY satisfy 277#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 2 |sll_create_#in~len|) (<= 1 |sll_create_#in~data|) (<= 0 |#NULL.base|) (<= |sll_create_#in~data| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= |#valid| |old(#valid)|) (= |sll_create_#in~len| 2) (<= |sll_create_#in~len| 2) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= |sll_create_#in~data| 1) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 13:28:20,992 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 388#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:28:20,992 INFO L193 IcfgInterpreter]: Reachable states at location L575-1 satisfy 365#(and (<= 0 sll_create_~len) (or (and (= (select (select |#memory_$Pointer$.base| |sll_create_#t~ret4.base|) 4) 0) (= (select |#length| |sll_create_#t~ret4.base|) 8) (<= 1 sll_create_~data) (<= 2 |sll_create_#in~len|) (<= 1 |sll_create_#in~data|) (< 0 sll_create_~len) (<= 0 |#NULL.base|) (not (= 0 |sll_create_#t~ret4.base|)) (<= |sll_create_#in~data| 1) (<= 0 |#NULL.offset|) (<= sll_create_~data 1) (= 0 (select (select |#memory_$Pointer$.offset| |sll_create_#t~ret4.base|) 4)) (= (select (select |#memory_int| |sll_create_#t~ret4.base|) 0) sll_create_~data) (= |sll_create_#in~data| 1) (= |#NULL.base| 0) (= 1 (select |#valid| |sll_create_#t~ret4.base|)) (<= |#NULL.base| 0) (= 0 |sll_create_#t~ret4.offset|) (<= 0 |sll_create_#t~ret4.offset|) (<= |sll_create_#t~ret4.offset| 0) (< |#StackHeapBarrier| |sll_create_#t~ret4.base|) (<= |#NULL.offset| 0) (<= sll_create_~len 2) (= |sll_create_#in~len| 2) (= |#NULL.offset| 0)) (and (= (select |#length| |sll_create_#t~ret4.base|) 8) (<= 1 sll_create_~data) (<= 2 |sll_create_#in~len|) (<= 1 |sll_create_#in~data|) (< 0 sll_create_~len) (<= 0 |#NULL.base|) (not (= 0 |sll_create_#t~ret4.base|)) (<= |sll_create_#in~data| 1) (<= 0 |#NULL.offset|) (<= sll_create_~data 1) (= |sll_create_#in~data| 1) (= |#NULL.base| 0) (= 1 (select |#valid| |sll_create_#t~ret4.base|)) (= 0 |sll_create_#t~ret4.offset|) (<= |#NULL.base| 0) (<= |sll_create_#t~ret4.offset| 0) (<= 0 |sll_create_#t~ret4.offset|) (< |#StackHeapBarrier| |sll_create_#t~ret4.base|) (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#t~ret4.base|) (+ |sll_create_#t~ret4.offset| 4))) (<= |#NULL.offset| 0) (<= sll_create_~len 2) (= |sll_create_#in~len| 2) (= 0 (select (select |#memory_$Pointer$.offset| |sll_create_#t~ret4.base|) (+ |sll_create_#t~ret4.offset| 4))) (= |#NULL.offset| 0) (= (select (select |#memory_int| |sll_create_#t~ret4.base|) |sll_create_#t~ret4.offset|) sll_create_~data))) (<= 0 sll_create_~head~0.offset) (<= |sll_create_#in~len| 2) (<= sll_create_~head~0.offset 0)) [2019-10-07 13:28:20,992 INFO L193 IcfgInterpreter]: Reachable states at location L605 satisfy 38#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= main_~data~0 1) (<= main_~len~0 2) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (= |#valid| |old(#valid)|) (<= main_~data~0 1) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= main_~len~0 2) (<= 2 main_~len~0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 13:28:20,992 INFO L193 IcfgInterpreter]: Reachable states at location L607-2 satisfy 258#(and (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 main_~s~0.offset) (<= 0 |#NULL.base|) (= main_~data~0 1) (<= main_~len~0 2) (<= main_~i~0 0) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= main_~data~0 1) (= |#NULL.offset| 0) (<= main_~s~0.offset 0) (= main_~len~0 2) (<= 2 main_~len~0) (= main_~i~0 0)) [2019-10-07 13:28:20,993 INFO L193 IcfgInterpreter]: Reachable states at location sll_get_data_atENTRY satisfy 263#false [2019-10-07 13:28:20,993 INFO L193 IcfgInterpreter]: Reachable states at location L605-1 satisfy 120#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= |main_#t~ret11.offset| 0) (<= 0 |#NULL.base|) (= main_~data~0 1) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= main_~data~0 1) (<= 0 |main_#t~ret11.offset|) (= |#NULL.offset| 0) (= main_~len~0 2) (<= 2 main_~len~0)) [2019-10-07 13:28:20,993 INFO L193 IcfgInterpreter]: Reachable states at location L614 satisfy 2#false [2019-10-07 13:28:20,993 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 393#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:28:20,994 INFO L193 IcfgInterpreter]: Reachable states at location node_createEXIT satisfy 384#(exists ((v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (or (and (= |#NULL.base| 0) (<= |node_create_#in~data| 1) (= (store |old(#length)| |node_create_#t~malloc2.base| 8) |#length|) (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (<= |#NULL.base| 0) (= node_create_~data |node_create_#in~data|) (= |node_create_#t~malloc2.base| node_create_~temp~0.base) (<= 0 |#NULL.base|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= node_create_~temp~0.offset |node_create_#t~malloc2.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (<= 0 |#NULL.offset|) (not (= 0 node_create_~temp~0.base)) (<= |#NULL.offset| 0) (= |#memory_int| (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) v_DerPreprocessor_1) node_create_~temp~0.offset node_create_~data))) (= |node_create_#t~malloc2.offset| 0) (<= 1 |node_create_#in~data|) (= node_create_~temp~0.offset |node_create_#res.offset|) (= node_create_~temp~0.base |node_create_#res.base|) (not (= |node_create_#t~malloc2.base| 0)) (= (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|) (< |#StackHeapBarrier| |node_create_#t~malloc2.base|) (= |#NULL.offset| 0)) (and (not (= node_create_~temp~0.offset 0)) (= |#NULL.base| 0) (<= |node_create_#in~data| 1) (= (store |old(#length)| |node_create_#t~malloc2.base| 8) |#length|) (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (<= |#NULL.base| 0) (= node_create_~data |node_create_#in~data|) (= |node_create_#t~malloc2.base| node_create_~temp~0.base) (<= 0 |#NULL.base|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= node_create_~temp~0.offset |node_create_#t~malloc2.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |node_create_#t~malloc2.offset| 0) (<= 1 |node_create_#in~data|) (= node_create_~temp~0.offset |node_create_#res.offset|) (= node_create_~temp~0.base |node_create_#res.base|) (not (= |node_create_#t~malloc2.base| 0)) (= (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|) (= (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) v_DerPreprocessor_2) node_create_~temp~0.offset node_create_~data)) |#memory_int|) (< |#StackHeapBarrier| |node_create_#t~malloc2.base|) (= |#NULL.offset| 0)))) [2019-10-07 13:28:20,994 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:28:20,994 INFO L193 IcfgInterpreter]: Reachable states at location L575 satisfy 352#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 1 sll_create_~data) (<= 0 sll_create_~len) (<= 2 |sll_create_#in~len|) (<= 1 |sll_create_#in~data|) (< 0 sll_create_~len) (<= 0 |#NULL.base|) (<= |sll_create_#in~data| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= sll_create_~data 1) (<= sll_create_~len 2) (= |sll_create_#in~len| 2) (<= 0 sll_create_~head~0.offset) (<= |sll_create_#in~len| 2) (= |#NULL.offset| 0) (<= sll_create_~head~0.offset 0) (= |sll_create_#in~data| 1)) [2019-10-07 13:28:21,633 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-10-07 13:28:21,835 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-10-07 13:28:22,004 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2019-10-07 13:28:22,145 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-07 13:28:22,145 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [6, 6, 6] total 22 [2019-10-07 13:28:22,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-07 13:28:22,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-07 13:28:22,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2019-10-07 13:28:22,151 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 16 states. [2019-10-07 13:28:22,622 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-10-07 13:28:22,816 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-10-07 13:28:22,970 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-10-07 13:28:23,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:23,606 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2019-10-07 13:28:23,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-07 13:28:23,606 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-10-07 13:28:23,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:23,609 INFO L225 Difference]: With dead ends: 45 [2019-10-07 13:28:23,609 INFO L226 Difference]: Without dead ends: 36 [2019-10-07 13:28:23,611 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2019-10-07 13:28:23,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-07 13:28:23,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-10-07 13:28:23,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-07 13:28:23,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-07 13:28:23,619 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 26 [2019-10-07 13:28:23,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:23,620 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-07 13:28:23,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-07 13:28:23,620 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-07 13:28:23,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-07 13:28:23,621 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:23,621 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:23,830 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:28:23,830 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:23,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:23,831 INFO L82 PathProgramCache]: Analyzing trace with hash 531961720, now seen corresponding path program 1 times [2019-10-07 13:28:23,831 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:23,831 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:23,831 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:23,831 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:23,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:23,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 13:28:23,969 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:23,969 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:28:23,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-10-07 13:28:24,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:24,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-07 13:28:24,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:28:24,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 13:28:24,121 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:28:24,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 13:28:24,208 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:28:24,210 INFO L162 IcfgInterpreter]: Started Sifa with 31 locations of interest [2019-10-07 13:28:24,210 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:28:24,210 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:28:24,211 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:28:24,211 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:28:24,240 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-07 13:28:24,306 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:24,777 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:24,796 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:24,853 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:24,875 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:25,036 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:25,054 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:25,109 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:25,140 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:25,278 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:25,295 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:25,384 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:25,412 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:25,541 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:25,554 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:25,600 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:25,621 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:25,728 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:25,741 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:25,783 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:25,806 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:25,916 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:25,930 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:25,992 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:26,011 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:26,128 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:26,141 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:26,183 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:26,204 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:26,291 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:26,303 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:26,343 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:26,363 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:26,953 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:26,965 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:27,077 INFO L199 IcfgInterpreter]: Interpreting procedure sll_get_data_at with input of size 1 for LOIs [2019-10-07 13:28:27,079 INFO L199 IcfgInterpreter]: Interpreting procedure sll_create with input of size 33 for LOIs [2019-10-07 13:28:27,857 INFO L199 IcfgInterpreter]: Interpreting procedure node_create with input of size 29 for LOIs [2019-10-07 13:28:27,902 INFO L199 IcfgInterpreter]: Interpreting procedure sll_update_at with input of size 28 for LOIs [2019-10-07 13:28:27,923 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:28:27,926 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:28:27,926 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:28:27,927 INFO L193 IcfgInterpreter]: Reachable states at location sll_get_data_atEXIT satisfy 1143#false [2019-10-07 13:28:27,927 INFO L193 IcfgInterpreter]: Reachable states at location L574-3 satisfy 1216#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 1 sll_create_~data) (<= 2 |sll_create_#in~len|) (<= 1 |sll_create_#in~data|) (<= 0 |#NULL.base|) (<= |sll_create_#in~data| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= sll_create_~data 1) (<= sll_create_~len 2) (= |sll_create_#in~len| 2) (<= 0 sll_create_~head~0.offset) (<= |sll_create_#in~len| 2) (= |#NULL.offset| 0) (<= sll_create_~head~0.offset 0) (= |sll_create_#in~data| 1)) [2019-10-07 13:28:27,927 INFO L193 IcfgInterpreter]: Reachable states at location sll_update_atEXIT satisfy 1278#(and (= |#NULL.base| 0) (<= sll_update_at_~index 0) (<= |#NULL.base| 0) (= |sll_update_at_#in~head.base| sll_update_at_~head.base) (<= 0 sll_update_at_~head.offset) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= |sll_update_at_#in~index| sll_update_at_~index) (<= |sll_update_at_#in~index| 2) (<= 0 |#NULL.base|) (not (< 0 sll_update_at_~index)) (<= |sll_update_at_#in~index| 0) (= |#memory_int| (store |old(#memory_int)| sll_update_at_~head.base (store (select |old(#memory_int)| sll_update_at_~head.base) sll_update_at_~head.offset sll_update_at_~data))) (<= sll_update_at_~head.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |sll_update_at_#in~head.offset| 0) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| sll_update_at_~head.base (store (select |old(#memory_$Pointer$.offset)| sll_update_at_~head.base) sll_update_at_~head.offset (select (select |#memory_$Pointer$.offset| sll_update_at_~head.base) sll_update_at_~head.offset)))) (<= sll_update_at_~data 4) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_update_at_~head.base (store (select |old(#memory_$Pointer$.base)| sll_update_at_~head.base) sll_update_at_~head.offset (select (select |#memory_$Pointer$.base| sll_update_at_~head.base) sll_update_at_~head.offset)))) (= sll_update_at_~data |sll_update_at_#in~data|) (= |#NULL.offset| 0) (<= 0 |sll_update_at_#in~head.offset|) (<= |sll_update_at_#in~data| 4)) [2019-10-07 13:28:27,928 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:28:27,928 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 13:28:27,928 INFO L193 IcfgInterpreter]: Reachable states at location L589-2 satisfy 1138#false [2019-10-07 13:28:27,929 INFO L193 IcfgInterpreter]: Reachable states at location L613 satisfy 1109#false [2019-10-07 13:28:27,929 INFO L193 IcfgInterpreter]: Reachable states at location L565-1 satisfy 1259#(and (<= 0 node_create_~temp~0.offset) (or (and (= |#NULL.base| 0) (not (= node_create_~temp~0.offset 0)) (<= |#NULL.base| 0) (<= |node_create_#in~data| 1) (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (store |old(#length)| |node_create_#t~malloc2.base| 8) |#length|) (= node_create_~data |node_create_#in~data|) (= |node_create_#t~malloc2.base| node_create_~temp~0.base) (<= 0 |#NULL.base|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= node_create_~temp~0.offset |node_create_#t~malloc2.offset|) (= |node_create_#t~malloc2.offset| 0) (not (= |node_create_#t~malloc2.base| 0)) (= |#memory_int| |old(#memory_int)|) (< |#StackHeapBarrier| |node_create_#t~malloc2.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= |node_create_#in~data| 1) (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (store |old(#length)| |node_create_#t~malloc2.base| 8) |#length|) (= node_create_~data |node_create_#in~data|) (= |node_create_#t~malloc2.base| node_create_~temp~0.base) (<= 0 |#NULL.base|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= node_create_~temp~0.offset |node_create_#t~malloc2.offset|) (not (= 0 node_create_~temp~0.base)) (= |node_create_#t~malloc2.offset| 0) (not (= |node_create_#t~malloc2.base| 0)) (= |#memory_int| |old(#memory_int)|) (< |#StackHeapBarrier| |node_create_#t~malloc2.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (<= |node_create_#t~malloc2.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= node_create_~temp~0.offset 0) (<= 1 |node_create_#in~data|) (<= node_create_~data 1) (<= 1 node_create_~data) (<= 0 |node_create_#t~malloc2.offset|)) [2019-10-07 13:28:27,929 INFO L193 IcfgInterpreter]: Reachable states at location L613-1 satisfy 2#false [2019-10-07 13:28:27,929 INFO L193 IcfgInterpreter]: Reachable states at location L596-2 satisfy 1273#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (= |sll_update_at_#in~head.base| sll_update_at_~head.base) (<= 0 sll_update_at_~head.offset) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= |sll_update_at_#in~index| sll_update_at_~index) (<= |sll_update_at_#in~index| 2) (<= 0 |#NULL.base|) (<= sll_update_at_~head.offset 0) (<= sll_update_at_~index 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |sll_update_at_#in~head.offset| 0) (<= sll_update_at_~data 4) (= sll_update_at_~data |sll_update_at_#in~data|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (<= 0 |sll_update_at_#in~head.offset|) (<= |sll_update_at_#in~data| 4) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 13:28:27,930 INFO L193 IcfgInterpreter]: Reachable states at location L565 satisfy 1254#(and (<= |node_create_#in~data| 1) (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (store |old(#length)| |node_create_#t~malloc2.base| 8) |#length|) (= |node_create_#t~malloc2.base| node_create_~temp~0.base) (<= 0 |#NULL.base|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= node_create_~temp~0.offset |node_create_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (= |node_create_#t~malloc2.offset| 0) (<= node_create_~data 1) (not (= |node_create_#t~malloc2.base| 0)) (<= 1 node_create_~data) (<= 0 |node_create_#t~malloc2.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |#NULL.base| 0) (<= |#NULL.base| 0) (= node_create_~data |node_create_#in~data|) (<= 0 node_create_~temp~0.offset) (<= |node_create_#t~malloc2.offset| 0) (<= |#NULL.offset| 0) (<= node_create_~temp~0.offset 0) (<= 1 |node_create_#in~data|) (= |#memory_int| |old(#memory_int)|) (< |#StackHeapBarrier| |node_create_#t~malloc2.base|) (= |#NULL.offset| 0)) [2019-10-07 13:28:27,930 INFO L193 IcfgInterpreter]: Reachable states at location L613-2 satisfy 2#false [2019-10-07 13:28:27,930 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 2#false [2019-10-07 13:28:27,931 INFO L193 IcfgInterpreter]: Reachable states at location sll_createEXIT satisfy 1221#(and (or (and (<= sll_create_~len 0) (<= sll_create_~new_head~0.offset 0) (<= 0 |sll_create_#res.offset|) (<= |sll_create_#res.offset| 0) (<= 0 sll_create_~new_head~0.offset)) (and (<= sll_create_~len 0) (<= |sll_create_#res.base| 0) (<= 0 |sll_create_#res.offset|) (<= 0 |sll_create_#res.base|) (<= |sll_create_#res.offset| 0) (<= 0 sll_create_~head~0.base) (<= sll_create_~head~0.base 0))) (or (and (= |#NULL.base| 0) (= sll_create_~head~0.base 0) (= |sll_create_#res.offset| sll_create_~head~0.offset) (<= |#NULL.base| 0) (<= 1 sll_create_~data) (not (< 0 sll_create_~len)) (<= 2 |sll_create_#in~len|) (<= 1 |sll_create_#in~data|) (<= 0 |#NULL.base|) (<= |sll_create_#in~data| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= sll_create_~data 1) (= sll_create_~head~0.offset 0) (<= sll_create_~len 2) (= |sll_create_#in~len| 2) (<= 0 sll_create_~head~0.offset) (<= |sll_create_#in~len| 2) (= |#NULL.offset| 0) (= sll_create_~head~0.base |sll_create_#res.base|) (<= sll_create_~head~0.offset 0) (= |sll_create_#in~data| 1)) (and (= |#NULL.base| 0) (= sll_create_~new_head~0.offset 0) (= |sll_create_#res.offset| sll_create_~head~0.offset) (<= |#NULL.base| 0) (<= 1 sll_create_~data) (not (< 0 sll_create_~len)) (<= 2 |sll_create_#in~len|) (<= 1 |sll_create_#in~data|) (<= 0 |#NULL.base|) (<= |sll_create_#in~data| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= sll_create_~data 1) (<= sll_create_~len 2) (= |sll_create_#in~len| 2) (<= 0 sll_create_~head~0.offset) (<= |sll_create_#in~len| 2) (= |#NULL.offset| 0) (= sll_create_~head~0.base |sll_create_#res.base|) (<= sll_create_~head~0.offset 0) (= |sll_create_#in~data| 1)))) [2019-10-07 13:28:27,931 INFO L193 IcfgInterpreter]: Reachable states at location node_createENTRY satisfy 1249#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= |node_create_#in~data| 1) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 |node_create_#in~data|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 13:28:27,932 INFO L193 IcfgInterpreter]: Reachable states at location L609 satisfy 1090#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= main_~i~0 2) (<= 0 main_~s~0.offset) (<= 0 |#NULL.base|) (= main_~data~0 1) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= main_~data~0 1) (= |#NULL.offset| 0) (<= main_~new_data~0 4) (= main_~len~0 2) (<= main_~s~0.offset 0) (<= 2 main_~len~0)) [2019-10-07 13:28:27,932 INFO L193 IcfgInterpreter]: Reachable states at location L609-1 satisfy 1038#(and (<= 0 main_~i~0) (<= 2 main_~new_data~0) (<= main_~new_data~0 2) (or (and (= 0 |#NULL.base|) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= 1 main_~i~0) (= 1 main_~i~0) (= (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) main_~new_data~0) (<= main_~i~0 1) (< main_~i~0 (+ main_~len~0 1)) (< main_~i~0 main_~len~0) (<= main_~new_data~0 4) (= main_~len~0 2) (<= (+ main_~i~0 main_~len~0) 3) (<= |#NULL.base| 0) (<= main_~i~0 2) (<= 0 main_~s~0.offset) (<= main_~i~0 0) (= main_~data~0 1) (<= main_~len~0 2) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 1 main_~data~0) (= (+ main_~i~0 main_~len~0) main_~new_data~0) (<= main_~data~0 1) (= |#NULL.offset| 0) (<= 3 (+ main_~i~0 main_~len~0))) (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 main_~s~0.offset) (<= 0 |#NULL.base|) (<= main_~i~0 0) (= main_~data~0 1) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 1 main_~data~0) (= (+ main_~i~0 main_~len~0) main_~new_data~0) (<= main_~data~0 1) (= (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) main_~new_data~0) (< main_~i~0 main_~len~0) (= |#NULL.offset| 0) (= main_~len~0 2) (= main_~i~0 0))) (<= main_~s~0.offset 0) (<= 2 main_~len~0)) [2019-10-07 13:28:27,932 INFO L193 IcfgInterpreter]: Reachable states at location L611-3 satisfy 1123#false [2019-10-07 13:28:27,933 INFO L193 IcfgInterpreter]: Reachable states at location sll_createENTRY satisfy 1147#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 2 |sll_create_#in~len|) (<= 1 |sll_create_#in~data|) (<= 0 |#NULL.base|) (<= |sll_create_#in~data| 1) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| |old(#valid)|) (= |sll_create_#in~len| 2) (<= |sll_create_#in~len| 2) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= |sll_create_#in~data| 1) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 13:28:27,933 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 1282#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:28:27,933 INFO L193 IcfgInterpreter]: Reachable states at location L575-1 satisfy 1245#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 1 sll_create_~data) (<= 0 sll_create_~len) (<= 0 |sll_create_#t~ret4.offset|) (<= |sll_create_#t~ret4.offset| 0) (<= 2 |sll_create_#in~len|) (<= 1 |sll_create_#in~data|) (<= 0 |#NULL.base|) (<= |sll_create_#in~data| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= sll_create_~data 1) (<= sll_create_~len 2) (= |sll_create_#t~ret4.offset| 0) (= |sll_create_#in~len| 2) (<= 0 sll_create_~head~0.offset) (<= |sll_create_#in~len| 2) (= |#NULL.offset| 0) (<= sll_create_~head~0.offset 0) (= |sll_create_#in~data| 1)) [2019-10-07 13:28:27,934 INFO L193 IcfgInterpreter]: Reachable states at location L605 satisfy 38#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= main_~data~0 1) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 1 main_~data~0) (= |#valid| |old(#valid)|) (<= main_~data~0 1) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= main_~len~0 2) (<= 2 main_~len~0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 13:28:27,934 INFO L193 IcfgInterpreter]: Reachable states at location L607-2 satisfy 1128#(and (<= 0 main_~i~0) (<= main_~i~0 1) (or (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~s~0.offset) (= main_~data~0 1) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 1 main_~data~0) (<= main_~data~0 1) (= |#NULL.offset| 0) (<= main_~s~0.offset 0) (= main_~len~0 2) (<= 2 main_~len~0) (= main_~i~0 0)) (and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 0 main_~s~0.offset) (<= 0 |#NULL.base|) (= main_~data~0 1) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= main_~data~0 1) (= |#NULL.offset| 0) (= main_~len~0 2) (<= main_~s~0.offset 0) (<= 2 main_~len~0)))) [2019-10-07 13:28:27,934 INFO L193 IcfgInterpreter]: Reachable states at location sll_get_data_atENTRY satisfy 1133#false [2019-10-07 13:28:27,934 INFO L193 IcfgInterpreter]: Reachable states at location L605-1 satisfy 98#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= |main_#t~ret11.offset| 0) (<= 0 |#NULL.base|) (= main_~data~0 1) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 1 main_~data~0) (<= main_~data~0 1) (<= 0 |main_#t~ret11.offset|) (= |#NULL.offset| 0) (= main_~len~0 2) (<= 2 main_~len~0)) [2019-10-07 13:28:27,935 INFO L193 IcfgInterpreter]: Reachable states at location L614 satisfy 2#false [2019-10-07 13:28:27,935 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 1287#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:28:27,935 INFO L193 IcfgInterpreter]: Reachable states at location node_createEXIT satisfy 1264#(exists ((v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int)) (or (and (not (= node_create_~temp~0.offset 0)) (= |#NULL.base| 0) (<= |node_create_#in~data| 1) (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (store |old(#length)| |node_create_#t~malloc2.base| 8) |#length|) (<= |#NULL.base| 0) (= (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) v_DerPreprocessor_4) node_create_~temp~0.offset node_create_~data)) |#memory_int|) (= node_create_~data |node_create_#in~data|) (= |node_create_#t~malloc2.base| node_create_~temp~0.base) (<= 0 |#NULL.base|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= node_create_~temp~0.offset |node_create_#t~malloc2.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |node_create_#t~malloc2.offset| 0) (<= 1 |node_create_#in~data|) (= node_create_~temp~0.offset |node_create_#res.offset|) (= node_create_~temp~0.base |node_create_#res.base|) (not (= |node_create_#t~malloc2.base| 0)) (= (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|) (< |#StackHeapBarrier| |node_create_#t~malloc2.base|) (= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (<= |node_create_#in~data| 1) (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (store |old(#length)| |node_create_#t~malloc2.base| 8) |#length|) (<= |#NULL.base| 0) (= node_create_~data |node_create_#in~data|) (= |node_create_#t~malloc2.base| node_create_~temp~0.base) (<= 0 |#NULL.base|) (= (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) v_DerPreprocessor_3) node_create_~temp~0.offset node_create_~data)) |#memory_int|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= node_create_~temp~0.offset |node_create_#t~malloc2.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (<= 0 |#NULL.offset|) (not (= 0 node_create_~temp~0.base)) (<= |#NULL.offset| 0) (= |node_create_#t~malloc2.offset| 0) (<= 1 |node_create_#in~data|) (= node_create_~temp~0.offset |node_create_#res.offset|) (= node_create_~temp~0.base |node_create_#res.base|) (not (= |node_create_#t~malloc2.base| 0)) (= (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|) (< |#StackHeapBarrier| |node_create_#t~malloc2.base|) (= |#NULL.offset| 0)))) [2019-10-07 13:28:27,935 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:28:27,936 INFO L193 IcfgInterpreter]: Reachable states at location L575 satisfy 1226#(and (or (and (<= 0 sll_create_~len) (<= 0 sll_create_~head~0.base) (<= sll_create_~head~0.base 0)) (and (<= 0 sll_create_~len) (<= sll_create_~new_head~0.offset 0) (<= 0 sll_create_~new_head~0.offset))) (or (and (= |#NULL.base| 0) (= sll_create_~new_head~0.offset 0) (<= |#NULL.base| 0) (<= 1 sll_create_~data) (<= 2 |sll_create_#in~len|) (<= 1 |sll_create_#in~data|) (< 0 sll_create_~len) (<= 0 |#NULL.base|) (<= |sll_create_#in~data| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= sll_create_~data 1) (<= sll_create_~len 2) (= |sll_create_#in~len| 2) (<= 0 sll_create_~head~0.offset) (<= |sll_create_#in~len| 2) (= |#NULL.offset| 0) (<= sll_create_~head~0.offset 0) (= |sll_create_#in~data| 1)) (and (= |#NULL.base| 0) (= sll_create_~head~0.base 0) (<= |#NULL.base| 0) (<= 1 sll_create_~data) (<= 2 |sll_create_#in~len|) (<= 1 |sll_create_#in~data|) (< 0 sll_create_~len) (<= 0 |#NULL.base|) (<= |sll_create_#in~data| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= sll_create_~data 1) (= sll_create_~head~0.offset 0) (<= sll_create_~len 2) (= |sll_create_#in~len| 2) (<= 0 sll_create_~head~0.offset) (<= |sll_create_#in~len| 2) (= |#NULL.offset| 0) (<= sll_create_~head~0.offset 0) (= |sll_create_#in~data| 1)))) [2019-10-07 13:28:27,936 INFO L193 IcfgInterpreter]: Reachable states at location sll_update_atENTRY satisfy 1268#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= |sll_update_at_#in~index| 2) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |sll_update_at_#in~head.offset| 0) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (<= 0 |sll_update_at_#in~head.offset|) (<= |sll_update_at_#in~data| 4) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 13:28:28,481 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 32 [2019-10-07 13:28:28,720 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-10-07 13:28:29,140 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 31 [2019-10-07 13:28:29,868 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 32 [2019-10-07 13:28:29,870 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-07 13:28:29,870 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [6, 6, 6] total 28 [2019-10-07 13:28:29,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-07 13:28:29,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-07 13:28:29,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2019-10-07 13:28:29,872 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 22 states. [2019-10-07 13:28:30,940 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-10-07 13:28:32,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:32,195 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2019-10-07 13:28:32,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-07 13:28:32,196 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2019-10-07 13:28:32,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:32,198 INFO L225 Difference]: With dead ends: 66 [2019-10-07 13:28:32,198 INFO L226 Difference]: Without dead ends: 57 [2019-10-07 13:28:32,199 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=234, Invalid=2022, Unknown=0, NotChecked=0, Total=2256 [2019-10-07 13:28:32,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-07 13:28:32,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2019-10-07 13:28:32,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-07 13:28:32,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2019-10-07 13:28:32,211 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 32 [2019-10-07 13:28:32,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:32,212 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2019-10-07 13:28:32,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-07 13:28:32,212 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2019-10-07 13:28:32,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-07 13:28:32,214 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:32,214 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:32,419 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:28:32,420 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:32,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:32,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1305805873, now seen corresponding path program 1 times [2019-10-07 13:28:32,421 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:32,421 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:32,421 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:32,421 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:32,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:32,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 13:28:32,526 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:32,526 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:28:32,526 INFO L95 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 [2019-10-07 13:28:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:32,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-07 13:28:32,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:28:32,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 13:28:32,742 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:28:32,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 13:28:32,819 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:28:32,821 INFO L162 IcfgInterpreter]: Started Sifa with 31 locations of interest [2019-10-07 13:28:32,822 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:28:32,822 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:28:32,823 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:28:32,823 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:28:32,848 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-07 13:28:32,899 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:36,361 INFO L199 IcfgInterpreter]: Interpreting procedure sll_get_data_at with input of size 15 for LOIs [2019-10-07 13:28:36,371 INFO L199 IcfgInterpreter]: Interpreting procedure sll_create with input of size 33 for LOIs [2019-10-07 13:28:37,147 INFO L199 IcfgInterpreter]: Interpreting procedure node_create with input of size 29 for LOIs [2019-10-07 13:28:37,187 INFO L199 IcfgInterpreter]: Interpreting procedure sll_update_at with input of size 46 for LOIs [2019-10-07 13:28:37,333 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:28:37,336 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:28:37,336 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:28:37,336 INFO L193 IcfgInterpreter]: Reachable states at location sll_get_data_atEXIT satisfy 1394#(and (= |#NULL.base| 0) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|) (<= 0 |sll_get_data_at_#in~head.offset|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 sll_get_data_at_~index) (<= 0 |sll_get_data_at_#in~index|) (not (< 0 sll_get_data_at_~index)) (= (select (select |#memory_int| sll_get_data_at_~head.base) sll_get_data_at_~head.offset) |sll_get_data_at_#res|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |sll_get_data_at_#in~index| sll_get_data_at_~index) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (<= |sll_get_data_at_#in~head.offset| 0) (= |sll_get_data_at_#in~index| 0) (<= 0 sll_get_data_at_~head.offset) (<= |sll_get_data_at_#in~index| 0) (<= sll_get_data_at_~head.offset 0) (<= sll_get_data_at_~index 0) (= |#NULL.offset| 0)) [2019-10-07 13:28:37,336 INFO L193 IcfgInterpreter]: Reachable states at location L574-3 satisfy 1463#(and (or (and (= 0 |#NULL.base|) (<= 2 sll_create_~len) (= |sll_create_#in~len| sll_create_~len) (= 0 sll_create_~head~0.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (<= sll_create_~head~0.base 0) (= |sll_create_#in~data| 1) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= sll_create_~head~0.base 0) (= |sll_create_#in~data| sll_create_~data) (= 0 (select |old(#valid)| 0)) (= |#valid| |old(#valid)|) (= |sll_create_#in~len| 2) (= |#memory_int| |old(#memory_int)|) (<= 0 sll_create_~head~0.base) (= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |sll_create_#in~len| 2) (= |#NULL.offset| 0) (= |sll_create_#in~data| 1))) (<= |#NULL.base| 0) (<= 1 sll_create_~data) (<= 2 |sll_create_#in~len|) (<= 1 |sll_create_#in~data|) (<= 0 |#NULL.base|) (<= |sll_create_#in~data| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= sll_create_~data 1) (<= sll_create_~len 2) (<= 0 sll_create_~head~0.offset) (<= |sll_create_#in~len| 2) (<= sll_create_~head~0.offset 0)) [2019-10-07 13:28:37,336 INFO L193 IcfgInterpreter]: Reachable states at location sll_update_atEXIT satisfy 1549#(and (or (and (= |#NULL.base| 0) (= sll_update_at_~data (select (select |#memory_int| sll_update_at_~head.base) sll_update_at_~head.offset)) (not (< 0 sll_update_at_~index)) (<= sll_update_at_~index 1) (<= 0 |sll_update_at_#in~index|) (= |sll_update_at_#in~index| 0) (= |#NULL.offset| 0) (<= |sll_update_at_#in~index| 1)) (and (= |#NULL.base| 0) (= sll_update_at_~data (select (select |#memory_int| sll_update_at_~head.base) sll_update_at_~head.offset)) (= |sll_update_at_#in~index| 1) (not (< 0 sll_update_at_~index)) (<= sll_update_at_~index 1) (<= 0 |sll_update_at_#in~index|) (= |#NULL.offset| 0) (<= |sll_update_at_#in~index| 1))) (or (and (<= sll_update_at_~index 0) (<= sll_update_at_~data 3) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |sll_update_at_#in~index| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |sll_update_at_#in~head.offset| 0) (<= 2 sll_update_at_~data) (<= 0 |sll_update_at_#in~head.offset|) (<= |sll_update_at_#in~data| 3) (<= 2 |sll_update_at_#in~data|)) (and (<= sll_update_at_~index 0) (<= sll_update_at_~data 3) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |sll_update_at_#in~head.offset| 0) (<= 2 sll_update_at_~data) (<= 0 |sll_update_at_#in~head.offset|) (<= 1 |sll_update_at_#in~index|) (<= |sll_update_at_#in~data| 3) (<= 2 |sll_update_at_#in~data|)))) [2019-10-07 13:28:37,337 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:28:37,337 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 13:28:37,337 INFO L193 IcfgInterpreter]: Reachable states at location L589-2 satisfy 1389#(and (= |#NULL.base| 0) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|) (<= 0 |sll_get_data_at_#in~head.offset|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 sll_get_data_at_~index) (<= 0 |sll_get_data_at_#in~index|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |sll_get_data_at_#in~index| sll_get_data_at_~index) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (<= |sll_get_data_at_#in~head.offset| 0) (= |sll_get_data_at_#in~index| 0) (<= 0 sll_get_data_at_~head.offset) (<= |sll_get_data_at_#in~index| 0) (<= sll_get_data_at_~head.offset 0) (<= sll_get_data_at_~index 0) (= |#NULL.offset| 0)) [2019-10-07 13:28:37,337 INFO L193 IcfgInterpreter]: Reachable states at location L613 satisfy 1357#(and (<= 0 main_~i~0) (<= 2 main_~expected~0) (<= main_~i~0 0) (<= main_~expected~0 2) (and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 0 main_~s~0.offset) (<= 0 |#NULL.base|) (= main_~data~0 1) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= main_~data~0 1) (= |#NULL.offset| 0) (= main_~len~0 2) (= main_~i~0 0)) (<= main_~s~0.offset 0) (<= 2 main_~len~0)) [2019-10-07 13:28:37,337 INFO L193 IcfgInterpreter]: Reachable states at location L565-1 satisfy 1500#(and (<= 0 node_create_~temp~0.offset) (or (and (= |#NULL.base| 0) (not (= node_create_~temp~0.offset 0)) (<= |#NULL.base| 0) (<= |node_create_#in~data| 1) (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (store |old(#length)| |node_create_#t~malloc2.base| 8) |#length|) (= node_create_~data |node_create_#in~data|) (= |node_create_#t~malloc2.base| node_create_~temp~0.base) (<= 0 |#NULL.base|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= node_create_~temp~0.offset |node_create_#t~malloc2.offset|) (= |node_create_#t~malloc2.offset| 0) (not (= |node_create_#t~malloc2.base| 0)) (= |#memory_int| |old(#memory_int)|) (< |#StackHeapBarrier| |node_create_#t~malloc2.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= |node_create_#in~data| 1) (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (store |old(#length)| |node_create_#t~malloc2.base| 8) |#length|) (= node_create_~data |node_create_#in~data|) (= |node_create_#t~malloc2.base| node_create_~temp~0.base) (<= 0 |#NULL.base|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= node_create_~temp~0.offset |node_create_#t~malloc2.offset|) (not (= 0 node_create_~temp~0.base)) (= |node_create_#t~malloc2.offset| 0) (not (= |node_create_#t~malloc2.base| 0)) (= |#memory_int| |old(#memory_int)|) (< |#StackHeapBarrier| |node_create_#t~malloc2.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (<= |node_create_#t~malloc2.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= node_create_~temp~0.offset 0) (<= 1 |node_create_#in~data|) (<= node_create_~data 1) (<= 1 node_create_~data) (<= 0 |node_create_#t~malloc2.offset|)) [2019-10-07 13:28:37,337 INFO L193 IcfgInterpreter]: Reachable states at location L613-1 satisfy 1134#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 2 main_~expected~0) (<= 3 main_~new_data~0) (<= 0 main_~s~0.offset) (<= 0 |#NULL.base|) (= main_~data~0 1) (<= main_~i~0 0) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= main_~expected~0 2) (<= main_~data~0 1) (= |#NULL.offset| 0) (= main_~len~0 2) (<= main_~s~0.offset 0) (<= 2 main_~len~0) (= main_~i~0 0) (<= main_~new_data~0 3)) [2019-10-07 13:28:37,337 INFO L193 IcfgInterpreter]: Reachable states at location L596-2 satisfy 1544#(and (= |#NULL.base| 0) (<= sll_update_at_~data 3) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= sll_update_at_~index 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |sll_update_at_#in~index|) (<= |sll_update_at_#in~head.offset| 0) (<= 2 sll_update_at_~data) (= |#NULL.offset| 0) (<= 0 |sll_update_at_#in~head.offset|) (<= |sll_update_at_#in~index| 1) (<= |sll_update_at_#in~data| 3) (<= 2 |sll_update_at_#in~data|)) [2019-10-07 13:28:37,338 INFO L193 IcfgInterpreter]: Reachable states at location L565 satisfy 1495#(and (<= |node_create_#in~data| 1) (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (store |old(#length)| |node_create_#t~malloc2.base| 8) |#length|) (= |node_create_#t~malloc2.base| node_create_~temp~0.base) (<= 0 |#NULL.base|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= node_create_~temp~0.offset |node_create_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (= |node_create_#t~malloc2.offset| 0) (<= node_create_~data 1) (not (= |node_create_#t~malloc2.base| 0)) (<= 1 node_create_~data) (<= 0 |node_create_#t~malloc2.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |#NULL.base| 0) (<= |#NULL.base| 0) (= node_create_~data |node_create_#in~data|) (<= 0 node_create_~temp~0.offset) (<= |node_create_#t~malloc2.offset| 0) (<= |#NULL.offset| 0) (<= node_create_~temp~0.offset 0) (<= 1 |node_create_#in~data|) (= |#memory_int| |old(#memory_int)|) (< |#StackHeapBarrier| |node_create_#t~malloc2.base|) (= |#NULL.offset| 0)) [2019-10-07 13:28:37,338 INFO L193 IcfgInterpreter]: Reachable states at location L613-2 satisfy 1098#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 2 main_~expected~0) (<= 0 (+ |main_#t~ret14| 2147483648)) (<= 3 main_~new_data~0) (<= 0 main_~s~0.offset) (<= 0 |#NULL.base|) (<= |main_#t~ret14| 2147483647) (= main_~data~0 1) (<= main_~i~0 0) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= main_~expected~0 2) (<= main_~data~0 1) (= |#NULL.offset| 0) (= main_~len~0 2) (<= main_~s~0.offset 0) (<= 2 main_~len~0) (= main_~i~0 0) (<= main_~new_data~0 3)) [2019-10-07 13:28:37,338 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 747#(and (or (and (<= (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) 2147483647) (<= 0 main_~i~0) (= (+ main_~i~0 main_~len~0) main_~expected~0) (= 0 |#NULL.base|) (<= 2 main_~expected~0) (= (+ main_~len~0 1) main_~new_data~0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= 2 main_~new_data~0) (< main_~i~0 main_~len~0) (= main_~len~0 2) (<= |#NULL.base| 0) (<= 3 main_~new_data~0) (<= 0 main_~s~0.offset) (<= main_~i~0 0) (= main_~data~0 1) (<= main_~len~0 2) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 1 main_~data~0) (<= 0 (+ (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) 2147483648)) (not (= main_~expected~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (< 1 main_~len~0) (= |#NULL.offset| 0) (< 0 main_~len~0) (= main_~i~0 0)) (and (<= (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) 2147483647) (<= 0 main_~i~0) (= (+ main_~i~0 main_~len~0) main_~expected~0) (= 0 |#NULL.base|) (<= 2 main_~expected~0) (= main_~new_data~0 main_~len~0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= 2 main_~new_data~0) (<= main_~len~0 main_~new_data~0) (< main_~i~0 main_~len~0) (= main_~len~0 2) (<= |#NULL.base| 0) (<= 3 main_~new_data~0) (<= 0 main_~s~0.offset) (<= (* 2 main_~len~0) (+ main_~new_data~0 1)) (= main_~data~0 1) (<= main_~len~0 2) (<= main_~i~0 0) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 1 main_~data~0) (<= main_~new_data~0 (+ main_~len~0 1)) (<= 0 (+ (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) 2147483648)) (not (= main_~expected~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (< main_~new_data~0 (* 2 main_~len~0)) (= |#NULL.offset| 0) (= main_~i~0 0))) (<= main_~expected~0 2) (<= main_~data~0 1) (<= main_~s~0.offset 0) (<= 2 main_~len~0) (<= main_~new_data~0 3)) [2019-10-07 13:28:37,338 INFO L193 IcfgInterpreter]: Reachable states at location sll_createEXIT satisfy 1468#(and (= |#NULL.base| 0) (<= sll_create_~len 0) (= |sll_create_#res.offset| sll_create_~head~0.offset) (<= |#NULL.base| 0) (<= 1 sll_create_~data) (not (< 0 sll_create_~len)) (<= 2 |sll_create_#in~len|) (<= 1 |sll_create_#in~data|) (<= 0 |sll_create_#res.offset|) (<= 0 |#NULL.base|) (<= |sll_create_#in~data| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= sll_create_~data 1) (<= sll_create_~len 2) (= |sll_create_#in~len| 2) (<= 0 sll_create_~head~0.offset) (<= |sll_create_#in~len| 2) (<= |sll_create_#res.offset| 0) (= sll_create_~head~0.base |sll_create_#res.base|) (= |#NULL.offset| 0) (<= sll_create_~head~0.offset 0) (= |sll_create_#in~data| 1)) [2019-10-07 13:28:37,338 INFO L193 IcfgInterpreter]: Reachable states at location node_createENTRY satisfy 1490#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= |node_create_#in~data| 1) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| |old(#valid)|) (<= 1 |node_create_#in~data|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 13:28:37,338 INFO L193 IcfgInterpreter]: Reachable states at location L609 satisfy 1335#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 main_~s~0.offset) (<= 0 |#NULL.base|) (= main_~data~0 1) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= 2 main_~new_data~0) (<= main_~data~0 1) (<= main_~i~0 1) (= |#NULL.offset| 0) (= main_~len~0 2) (<= main_~s~0.offset 0) (<= 2 main_~len~0) (<= main_~new_data~0 3)) [2019-10-07 13:28:37,339 INFO L193 IcfgInterpreter]: Reachable states at location L609-1 satisfy 1284#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 main_~s~0.offset) (<= 0 |#NULL.base|) (= main_~data~0 1) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= 2 main_~new_data~0) (<= main_~data~0 1) (<= main_~i~0 1) (= |#NULL.offset| 0) (= main_~len~0 2) (<= main_~s~0.offset 0) (<= 2 main_~len~0) (<= main_~new_data~0 3)) [2019-10-07 13:28:37,339 INFO L193 IcfgInterpreter]: Reachable states at location L611-3 satisfy 1374#(and (<= 0 main_~i~0) (<= main_~i~0 0) (or (and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 0 main_~s~0.offset) (<= 0 |#NULL.base|) (= main_~data~0 1) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (= |#NULL.offset| 0) (= main_~len~0 2) (= main_~i~0 0)) (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 3 main_~new_data~0) (<= 0 |#NULL.base|) (<= 0 main_~s~0.offset) (= main_~data~0 1) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 1 main_~data~0) (<= main_~len~0 0) (= |#NULL.offset| 0) (= main_~len~0 2) (= main_~i~0 0) (<= main_~new_data~0 3))) (<= main_~data~0 1) (<= main_~s~0.offset 0) (<= 2 main_~len~0)) [2019-10-07 13:28:37,339 INFO L193 IcfgInterpreter]: Reachable states at location sll_createENTRY satisfy 1398#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 2 |sll_create_#in~len|) (<= 1 |sll_create_#in~data|) (<= 0 |#NULL.base|) (<= |sll_create_#in~data| 1) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| |old(#valid)|) (= |sll_create_#in~len| 2) (<= |sll_create_#in~len| 2) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= |sll_create_#in~data| 1) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 13:28:37,339 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 1553#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:28:37,339 INFO L193 IcfgInterpreter]: Reachable states at location L575-1 satisfy 1486#(and (= (select (select |#memory_$Pointer$.base| |sll_create_#t~ret4.base|) 4) 0) (= (select |#length| |sll_create_#t~ret4.base|) 8) (<= 1 sll_create_~data) (<= 2 |sll_create_#in~len|) (<= 1 |sll_create_#in~data|) (< 0 sll_create_~len) (<= 0 |#NULL.base|) (not (= 0 |sll_create_#t~ret4.base|)) (<= |sll_create_#in~data| 1) (<= 0 |#NULL.offset|) (<= sll_create_~data 1) (= 0 (select (select |#memory_$Pointer$.offset| |sll_create_#t~ret4.base|) 4)) (= (select (select |#memory_int| |sll_create_#t~ret4.base|) 0) sll_create_~data) (<= |sll_create_#in~len| 2) (= |sll_create_#in~data| 1) (= |#NULL.base| 0) (= 1 (select |#valid| |sll_create_#t~ret4.base|)) (<= |#NULL.base| 0) (= 0 |sll_create_#t~ret4.offset|) (<= 0 sll_create_~len) (<= 0 |sll_create_#t~ret4.offset|) (<= |sll_create_#t~ret4.offset| 0) (< |#StackHeapBarrier| |sll_create_#t~ret4.base|) (<= |#NULL.offset| 0) (<= sll_create_~len 2) (= |sll_create_#in~len| 2) (<= 0 sll_create_~head~0.offset) (= |#NULL.offset| 0) (<= sll_create_~head~0.offset 0)) [2019-10-07 13:28:37,340 INFO L193 IcfgInterpreter]: Reachable states at location L605 satisfy 38#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= main_~data~0 1) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 1 main_~data~0) (= |#valid| |old(#valid)|) (<= main_~data~0 1) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= main_~len~0 2) (<= 2 main_~len~0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 13:28:37,340 INFO L193 IcfgInterpreter]: Reachable states at location L607-2 satisfy 1379#(and (<= 0 main_~i~0) (<= main_~i~0 2) (or (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~data~0 1) (= 0 (select |old(#valid)| 0)) (= |#NULL.offset| 0) (= main_~len~0 2) (= main_~i~0 0)) (and (= |#NULL.base| 0) (<= |#NULL.base| 0) (= main_~data~0 1) (= |#NULL.offset| 0) (= main_~len~0 2))) (<= 0 main_~s~0.offset) (<= 0 |#NULL.base|) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= main_~data~0 1) (<= main_~s~0.offset 0) (<= 2 main_~len~0)) [2019-10-07 13:28:37,340 INFO L193 IcfgInterpreter]: Reachable states at location sll_get_data_atENTRY satisfy 1384#(and (= |#NULL.base| 0) (<= 0 |sll_get_data_at_#in~head.offset|) (<= |sll_get_data_at_#in~head.offset| 0) (= |sll_get_data_at_#in~index| 0) (<= |#NULL.base| 0) (<= |sll_get_data_at_#in~index| 0) (<= 0 |#NULL.base|) (<= 0 |sll_get_data_at_#in~index|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:28:37,340 INFO L193 IcfgInterpreter]: Reachable states at location L605-1 satisfy 116#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= |main_#t~ret11.offset| 0) (<= 0 |#NULL.base|) (= main_~data~0 1) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 1 main_~data~0) (<= main_~data~0 1) (<= 0 |main_#t~ret11.offset|) (= |#NULL.offset| 0) (= main_~len~0 2) (<= 2 main_~len~0)) [2019-10-07 13:28:37,340 INFO L193 IcfgInterpreter]: Reachable states at location L614 satisfy 884#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 2 main_~expected~0) (<= 3 main_~new_data~0) (<= 0 main_~s~0.offset) (<= 0 |#NULL.base|) (= main_~data~0 1) (<= main_~i~0 0) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= main_~expected~0 2) (<= main_~data~0 1) (= |#NULL.offset| 0) (= main_~len~0 2) (<= main_~s~0.offset 0) (<= 2 main_~len~0) (= main_~i~0 0) (<= main_~new_data~0 3)) [2019-10-07 13:28:37,341 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 1558#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:28:37,341 INFO L193 IcfgInterpreter]: Reachable states at location node_createEXIT satisfy 1505#(exists ((v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int)) (or (and (not (= node_create_~temp~0.offset 0)) (= |#NULL.base| 0) (<= |node_create_#in~data| 1) (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (store |old(#length)| |node_create_#t~malloc2.base| 8) |#length|) (<= |#NULL.base| 0) (= node_create_~data |node_create_#in~data|) (= |node_create_#t~malloc2.base| node_create_~temp~0.base) (<= 0 |#NULL.base|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= node_create_~temp~0.offset |node_create_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (<= |#NULL.offset| 0) (= |#memory_int| (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) v_DerPreprocessor_5) node_create_~temp~0.offset node_create_~data))) (= |node_create_#t~malloc2.offset| 0) (<= 1 |node_create_#in~data|) (= node_create_~temp~0.offset |node_create_#res.offset|) (= node_create_~temp~0.base |node_create_#res.base|) (not (= |node_create_#t~malloc2.base| 0)) (= (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|) (< |#StackHeapBarrier| |node_create_#t~malloc2.base|) (= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (<= |node_create_#in~data| 1) (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (store |old(#length)| |node_create_#t~malloc2.base| 8) |#length|) (<= |#NULL.base| 0) (= node_create_~data |node_create_#in~data|) (= |node_create_#t~malloc2.base| node_create_~temp~0.base) (<= 0 |#NULL.base|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= node_create_~temp~0.offset |node_create_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (not (= 0 node_create_~temp~0.base)) (<= |#NULL.offset| 0) (= |node_create_#t~malloc2.offset| 0) (<= 1 |node_create_#in~data|) (= node_create_~temp~0.offset |node_create_#res.offset|) (= node_create_~temp~0.base |node_create_#res.base|) (not (= |node_create_#t~malloc2.base| 0)) (= (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|) (< |#StackHeapBarrier| |node_create_#t~malloc2.base|) (= |#memory_int| (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) v_DerPreprocessor_6) node_create_~temp~0.offset node_create_~data))) (= |#NULL.offset| 0)))) [2019-10-07 13:28:37,341 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:28:37,341 INFO L193 IcfgInterpreter]: Reachable states at location L575 satisfy 1473#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 1 sll_create_~data) (<= 0 sll_create_~len) (<= 2 |sll_create_#in~len|) (<= 1 |sll_create_#in~data|) (< 0 sll_create_~len) (<= 0 |#NULL.base|) (<= |sll_create_#in~data| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= sll_create_~data 1) (<= sll_create_~len 2) (= |sll_create_#in~len| 2) (<= 0 sll_create_~head~0.offset) (<= |sll_create_#in~len| 2) (= |#NULL.offset| 0) (<= sll_create_~head~0.offset 0) (= |sll_create_#in~data| 1)) [2019-10-07 13:28:37,342 INFO L193 IcfgInterpreter]: Reachable states at location sll_update_atENTRY satisfy 1509#(and (or (and (<= |sll_update_at_#in~index| 0) (<= |sll_update_at_#in~data| 2)) (and (<= 3 |sll_update_at_#in~data|) (<= 1 |sll_update_at_#in~index|) (<= |sll_update_at_#in~index| 1) (<= |sll_update_at_#in~data| 3))) (or (and (= |sll_update_at_#in~data| (+ |sll_update_at_#in~index| 2)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 |sll_update_at_#in~index|) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |sll_update_at_#in~index|) (<= (+ |sll_update_at_#in~index| 2) |sll_update_at_#in~data|) (<= |sll_update_at_#in~head.offset| 0) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= 0 |sll_update_at_#in~head.offset|) (= |#NULL.offset| 0) (< (* 2 |sll_update_at_#in~index|) |sll_update_at_#in~data|) (<= |sll_update_at_#in~data| (+ |sll_update_at_#in~index| 2)) (<= 2 |sll_update_at_#in~data|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= |sll_update_at_#in~data| (+ |sll_update_at_#in~index| 2)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |sll_update_at_#in~index|) (<= (+ |sll_update_at_#in~index| 2) |sll_update_at_#in~data|) (<= |sll_update_at_#in~head.offset| 0) (= 1 |sll_update_at_#in~index|) (= |#memory_int| |old(#memory_int)|) (< (* 2 |sll_update_at_#in~index|) (+ |sll_update_at_#in~data| 1)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= 3 |sll_update_at_#in~data|) (= |#NULL.offset| 0) (<= 0 |sll_update_at_#in~head.offset|) (<= |sll_update_at_#in~data| 3) (<= |sll_update_at_#in~index| 1) (<= 1 |sll_update_at_#in~index|) (< (* 2 |sll_update_at_#in~index|) |sll_update_at_#in~data|) (<= |sll_update_at_#in~data| (+ |sll_update_at_#in~index| 2)) (<= 2 |sll_update_at_#in~data|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))) [2019-10-07 13:28:37,535 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 41 [2019-10-07 13:28:38,179 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-10-07 13:28:38,489 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-10-07 13:28:39,895 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:28:39,895 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6, 26] total 37 [2019-10-07 13:28:39,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-07 13:28:39,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-07 13:28:39,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1273, Unknown=0, NotChecked=0, Total=1406 [2019-10-07 13:28:39,898 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 38 states. [2019-10-07 13:28:40,751 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-10-07 13:28:41,027 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-10-07 13:28:41,675 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-10-07 13:28:41,827 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-10-07 13:28:41,994 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-10-07 13:28:42,185 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-10-07 13:28:43,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:43,390 INFO L93 Difference]: Finished difference Result 97 states and 123 transitions. [2019-10-07 13:28:43,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-07 13:28:43,393 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 33 [2019-10-07 13:28:43,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:43,395 INFO L225 Difference]: With dead ends: 97 [2019-10-07 13:28:43,395 INFO L226 Difference]: Without dead ends: 71 [2019-10-07 13:28:43,397 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=420, Invalid=4136, Unknown=0, NotChecked=0, Total=4556 [2019-10-07 13:28:43,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-07 13:28:43,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 53. [2019-10-07 13:28:43,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-07 13:28:43,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2019-10-07 13:28:43,410 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 33 [2019-10-07 13:28:43,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:43,411 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2019-10-07 13:28:43,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-07 13:28:43,411 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2019-10-07 13:28:43,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-07 13:28:43,412 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:43,413 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:43,623 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:28:43,624 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:43,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:43,625 INFO L82 PathProgramCache]: Analyzing trace with hash -282550209, now seen corresponding path program 2 times [2019-10-07 13:28:43,625 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:43,625 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:43,626 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:43,626 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:43,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:44,675 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:44,676 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:44,676 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:28:44,676 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2019-10-07 13:28:44,947 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-07 13:28:44,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:28:44,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 102 conjunts are in the unsatisfiable core [2019-10-07 13:28:44,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:28:46,271 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int) (sll_update_at_~data Int)) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) (+ |c_sll_update_at_#in~head.offset| 4)))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) sll_update_at_~head.offset sll_update_at_~data))) |c_#memory_int|)) is different from true [2019-10-07 13:28:46,453 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2019-10-07 13:28:46,453 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:28:47,004 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-10-07 13:28:47,562 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-10-07 13:28:47,566 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-10-07 13:28:48,015 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-10-07 13:28:51,504 WARN L191 SmtUtils]: Spent 508.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-10-07 13:28:52,445 WARN L191 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 60 [2019-10-07 13:28:54,119 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:54,119 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:28:54,121 INFO L162 IcfgInterpreter]: Started Sifa with 31 locations of interest [2019-10-07 13:28:54,121 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:28:54,122 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:28:54,122 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:28:54,122 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:28:54,160 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-07 13:28:54,212 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:28:57,176 INFO L199 IcfgInterpreter]: Interpreting procedure sll_get_data_at with input of size 15 for LOIs [2019-10-07 13:28:57,185 INFO L199 IcfgInterpreter]: Interpreting procedure sll_create with input of size 33 for LOIs [2019-10-07 13:28:57,704 INFO L199 IcfgInterpreter]: Interpreting procedure node_create with input of size 29 for LOIs [2019-10-07 13:28:57,741 INFO L199 IcfgInterpreter]: Interpreting procedure sll_update_at with input of size 42 for LOIs [2019-10-07 13:28:57,810 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:28:57,813 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:28:57,814 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:28:57,814 INFO L193 IcfgInterpreter]: Reachable states at location sll_get_data_atEXIT satisfy 1395#(and (= |#NULL.base| 0) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|) (<= 0 |sll_get_data_at_#in~head.offset|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 sll_get_data_at_~index) (<= 0 |sll_get_data_at_#in~index|) (not (< 0 sll_get_data_at_~index)) (= (select (select |#memory_int| sll_get_data_at_~head.base) sll_get_data_at_~head.offset) |sll_get_data_at_#res|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |sll_get_data_at_#in~index| sll_get_data_at_~index) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (<= |sll_get_data_at_#in~head.offset| 0) (= |sll_get_data_at_#in~index| 0) (<= 0 sll_get_data_at_~head.offset) (<= |sll_get_data_at_#in~index| 0) (<= sll_get_data_at_~head.offset 0) (<= sll_get_data_at_~index 0) (= |#NULL.offset| 0)) [2019-10-07 13:28:57,814 INFO L193 IcfgInterpreter]: Reachable states at location L574-3 satisfy 1465#(and (or (and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 1 sll_create_~data) (<= 2 |sll_create_#in~len|) (<= 1 |sll_create_#in~data|) (<= 0 |#NULL.base|) (<= |sll_create_#in~data| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= sll_create_~data 1) (<= sll_create_~len 2) (= |sll_create_#in~len| 2) (<= 0 sll_create_~head~0.offset) (<= |sll_create_#in~len| 2) (= |#NULL.offset| 0) (= |sll_create_#in~data| 1)) (and (= 0 |#NULL.base|) (<= 1 sll_create_~data) (<= 2 sll_create_~len) (<= 2 |sll_create_#in~len|) (<= 1 |sll_create_#in~data|) (<= 0 |#NULL.base|) (<= |sll_create_#in~data| 1) (<= 0 |#NULL.offset|) (<= sll_create_~data 1) (= |sll_create_#in~len| sll_create_~len) (<= |sll_create_#in~len| 2) (= 0 sll_create_~head~0.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (<= sll_create_~head~0.base 0) (= |sll_create_#in~data| 1) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= sll_create_~head~0.base 0) (<= |#NULL.base| 0) (= |sll_create_#in~data| sll_create_~data) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= sll_create_~len 2) (= |#valid| |old(#valid)|) (= |sll_create_#in~len| 2) (<= 0 sll_create_~head~0.offset) (= |#memory_int| |old(#memory_int)|) (<= 0 sll_create_~head~0.base) (= |#NULL.offset| 0))) (<= sll_create_~head~0.offset 0)) [2019-10-07 13:28:57,814 INFO L193 IcfgInterpreter]: Reachable states at location sll_update_atEXIT satisfy 1550#(and (= |#NULL.base| 0) (<= sll_update_at_~data 3) (<= sll_update_at_~index 0) (= sll_update_at_~data (select (select |#memory_int| sll_update_at_~head.base) sll_update_at_~head.offset)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (< 0 sll_update_at_~index)) (<= sll_update_at_~index 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |sll_update_at_#in~index|) (<= |sll_update_at_#in~head.offset| 0) (<= 2 sll_update_at_~data) (= |#NULL.offset| 0) (<= 0 |sll_update_at_#in~head.offset|) (<= |sll_update_at_#in~index| 1) (<= |sll_update_at_#in~data| 3) (<= 2 |sll_update_at_#in~data|)) [2019-10-07 13:28:57,814 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:28:57,814 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 13:28:57,815 INFO L193 IcfgInterpreter]: Reachable states at location L589-2 satisfy 1390#(and (= |#NULL.base| 0) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|) (<= 0 |sll_get_data_at_#in~head.offset|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 sll_get_data_at_~index) (<= 0 |sll_get_data_at_#in~index|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |sll_get_data_at_#in~index| sll_get_data_at_~index) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (<= |sll_get_data_at_#in~head.offset| 0) (= |sll_get_data_at_#in~index| 0) (<= 0 sll_get_data_at_~head.offset) (<= |sll_get_data_at_#in~index| 0) (<= sll_get_data_at_~head.offset 0) (<= sll_get_data_at_~index 0) (= |#NULL.offset| 0)) [2019-10-07 13:28:57,815 INFO L193 IcfgInterpreter]: Reachable states at location L613 satisfy 1358#(and (<= 0 main_~i~0) (<= 2 main_~expected~0) (<= main_~i~0 0) (<= main_~expected~0 2) (and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 0 main_~s~0.offset) (<= 0 |#NULL.base|) (= main_~data~0 1) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= main_~data~0 1) (= |#NULL.offset| 0) (= main_~len~0 2) (= main_~i~0 0)) (<= main_~s~0.offset 0) (<= 2 main_~len~0)) [2019-10-07 13:28:57,815 INFO L193 IcfgInterpreter]: Reachable states at location L565-1 satisfy 1502#(and (<= 0 node_create_~temp~0.offset) (or (and (= |#NULL.base| 0) (not (= node_create_~temp~0.offset 0)) (<= |#NULL.base| 0) (<= |node_create_#in~data| 1) (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (store |old(#length)| |node_create_#t~malloc2.base| 8) |#length|) (= node_create_~data |node_create_#in~data|) (= |node_create_#t~malloc2.base| node_create_~temp~0.base) (<= 0 |#NULL.base|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= node_create_~temp~0.offset |node_create_#t~malloc2.offset|) (= |node_create_#t~malloc2.offset| 0) (not (= |node_create_#t~malloc2.base| 0)) (= |#memory_int| |old(#memory_int)|) (< |#StackHeapBarrier| |node_create_#t~malloc2.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= |node_create_#in~data| 1) (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (store |old(#length)| |node_create_#t~malloc2.base| 8) |#length|) (= node_create_~data |node_create_#in~data|) (= |node_create_#t~malloc2.base| node_create_~temp~0.base) (<= 0 |#NULL.base|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= node_create_~temp~0.offset |node_create_#t~malloc2.offset|) (not (= 0 node_create_~temp~0.base)) (= |node_create_#t~malloc2.offset| 0) (not (= |node_create_#t~malloc2.base| 0)) (= |#memory_int| |old(#memory_int)|) (< |#StackHeapBarrier| |node_create_#t~malloc2.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (<= |node_create_#t~malloc2.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= node_create_~temp~0.offset 0) (<= 1 |node_create_#in~data|) (<= node_create_~data 1) (<= 1 node_create_~data) (<= 0 |node_create_#t~malloc2.offset|)) [2019-10-07 13:28:57,815 INFO L193 IcfgInterpreter]: Reachable states at location L613-1 satisfy 1138#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 2 main_~expected~0) (<= 3 main_~new_data~0) (<= 0 main_~s~0.offset) (<= 0 |#NULL.base|) (= main_~data~0 1) (<= main_~i~0 0) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= main_~expected~0 2) (<= main_~data~0 1) (= |#NULL.offset| 0) (= main_~len~0 2) (<= main_~s~0.offset 0) (<= 2 main_~len~0) (= main_~i~0 0) (<= main_~new_data~0 3)) [2019-10-07 13:28:57,816 INFO L193 IcfgInterpreter]: Reachable states at location L596-2 satisfy 1545#(and (= |#NULL.base| 0) (<= sll_update_at_~data 3) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= sll_update_at_~index 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |sll_update_at_#in~index|) (<= |sll_update_at_#in~head.offset| 0) (<= 2 sll_update_at_~data) (= |#NULL.offset| 0) (<= 0 |sll_update_at_#in~head.offset|) (<= |sll_update_at_#in~index| 1) (<= |sll_update_at_#in~data| 3) (<= 2 |sll_update_at_#in~data|)) [2019-10-07 13:28:57,816 INFO L193 IcfgInterpreter]: Reachable states at location L565 satisfy 1497#(and (<= |node_create_#in~data| 1) (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (store |old(#length)| |node_create_#t~malloc2.base| 8) |#length|) (= |node_create_#t~malloc2.base| node_create_~temp~0.base) (<= 0 |#NULL.base|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= node_create_~temp~0.offset |node_create_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (= |node_create_#t~malloc2.offset| 0) (<= node_create_~data 1) (not (= |node_create_#t~malloc2.base| 0)) (<= 1 node_create_~data) (<= 0 |node_create_#t~malloc2.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |#NULL.base| 0) (<= |#NULL.base| 0) (= node_create_~data |node_create_#in~data|) (<= 0 node_create_~temp~0.offset) (<= |node_create_#t~malloc2.offset| 0) (<= |#NULL.offset| 0) (<= node_create_~temp~0.offset 0) (<= 1 |node_create_#in~data|) (= |#memory_int| |old(#memory_int)|) (< |#StackHeapBarrier| |node_create_#t~malloc2.base|) (= |#NULL.offset| 0)) [2019-10-07 13:28:57,816 INFO L193 IcfgInterpreter]: Reachable states at location L613-2 satisfy 1105#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 2 main_~expected~0) (<= 0 (+ |main_#t~ret14| 2147483648)) (<= 3 main_~new_data~0) (<= |main_#t~ret14| 2147483647) (<= 0 main_~s~0.offset) (<= 0 |#NULL.base|) (= main_~data~0 1) (<= main_~i~0 0) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= main_~expected~0 2) (<= main_~data~0 1) (= |#NULL.offset| 0) (= main_~len~0 2) (<= main_~s~0.offset 0) (<= 2 main_~len~0) (= main_~i~0 0) (<= main_~new_data~0 3)) [2019-10-07 13:28:57,816 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 749#(and (or (and (<= (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) 2147483647) (<= 0 main_~i~0) (= (+ main_~i~0 main_~len~0) main_~expected~0) (= 0 |#NULL.base|) (<= 2 main_~expected~0) (= main_~new_data~0 main_~len~0) (<= 2 main_~new_data~0) (<= main_~len~0 main_~new_data~0) (< main_~i~0 main_~len~0) (= main_~len~0 2) (<= |#NULL.base| 0) (<= (* 2 main_~len~0) (+ main_~new_data~0 1)) (= main_~data~0 1) (<= main_~new_data~0 (+ main_~len~0 1)) (= 0 (select |old(#valid)| 0)) (<= 0 (+ (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) 2147483648)) (not (= main_~expected~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (< main_~new_data~0 (* 2 main_~len~0)) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (<= (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) 2147483647) (<= 0 main_~i~0) (= (+ main_~i~0 main_~len~0) main_~expected~0) (= 0 |#NULL.base|) (<= 2 main_~expected~0) (= (+ main_~len~0 1) main_~new_data~0) (<= 2 main_~new_data~0) (< main_~i~0 main_~len~0) (= main_~len~0 2) (<= |#NULL.base| 0) (= main_~data~0 1) (= 0 (select |old(#valid)| 0)) (<= 0 (+ (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) 2147483648)) (not (= main_~expected~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (< 1 main_~len~0) (= |#NULL.offset| 0) (< 0 main_~len~0) (= main_~i~0 0))) (<= 3 main_~new_data~0) (<= 0 main_~s~0.offset) (<= 0 |#NULL.base|) (<= main_~i~0 0) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= main_~expected~0 2) (<= main_~data~0 1) (<= main_~s~0.offset 0) (<= 2 main_~len~0) (<= main_~new_data~0 3)) [2019-10-07 13:28:57,816 INFO L193 IcfgInterpreter]: Reachable states at location sll_createEXIT satisfy 1470#(and (= |#NULL.base| 0) (<= sll_create_~len 0) (= |sll_create_#res.offset| sll_create_~head~0.offset) (<= |#NULL.base| 0) (<= 1 sll_create_~data) (not (< 0 sll_create_~len)) (<= 2 |sll_create_#in~len|) (<= 1 |sll_create_#in~data|) (<= 0 |sll_create_#res.offset|) (<= 0 |#NULL.base|) (<= |sll_create_#in~data| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= sll_create_~data 1) (<= sll_create_~len 2) (= |sll_create_#in~len| 2) (<= 0 sll_create_~head~0.offset) (<= |sll_create_#in~len| 2) (<= |sll_create_#res.offset| 0) (= sll_create_~head~0.base |sll_create_#res.base|) (= |#NULL.offset| 0) (<= sll_create_~head~0.offset 0) (= |sll_create_#in~data| 1)) [2019-10-07 13:28:57,817 INFO L193 IcfgInterpreter]: Reachable states at location node_createENTRY satisfy 1492#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= |node_create_#in~data| 1) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 |node_create_#in~data|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 13:28:57,817 INFO L193 IcfgInterpreter]: Reachable states at location L609 satisfy 1336#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 main_~s~0.offset) (<= 0 |#NULL.base|) (= main_~data~0 1) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= 2 main_~new_data~0) (<= main_~data~0 1) (<= main_~i~0 1) (= |#NULL.offset| 0) (= main_~len~0 2) (<= main_~s~0.offset 0) (<= 2 main_~len~0) (<= main_~new_data~0 3)) [2019-10-07 13:28:57,817 INFO L193 IcfgInterpreter]: Reachable states at location L609-1 satisfy 1285#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 main_~s~0.offset) (<= 0 |#NULL.base|) (= main_~data~0 1) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= 2 main_~new_data~0) (<= main_~data~0 1) (<= main_~i~0 1) (= |#NULL.offset| 0) (= main_~len~0 2) (<= main_~s~0.offset 0) (<= 2 main_~len~0) (<= main_~new_data~0 3)) [2019-10-07 13:28:57,817 INFO L193 IcfgInterpreter]: Reachable states at location L611-3 satisfy 1375#(and (or (and (= |#NULL.base| 0) (= main_~data~0 1) (= |#NULL.offset| 0) (= main_~len~0 2) (= main_~i~0 0)) (and (= 0 |#NULL.base|) (<= 3 main_~new_data~0) (= main_~data~0 1) (= 0 (select |old(#valid)| 0)) (<= main_~len~0 0) (= |#NULL.offset| 0) (= main_~len~0 2) (= main_~i~0 0) (<= main_~new_data~0 3))) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 main_~s~0.offset) (<= 0 |#NULL.base|) (<= main_~i~0 0) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= main_~data~0 1) (<= main_~s~0.offset 0) (<= 2 main_~len~0)) [2019-10-07 13:28:57,817 INFO L193 IcfgInterpreter]: Reachable states at location sll_createENTRY satisfy 1399#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 2 |sll_create_#in~len|) (<= 1 |sll_create_#in~data|) (<= 0 |#NULL.base|) (<= |sll_create_#in~data| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= |#valid| |old(#valid)|) (= |sll_create_#in~len| 2) (<= |sll_create_#in~len| 2) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= |sll_create_#in~data| 1) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 13:28:57,817 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 1554#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:28:57,818 INFO L193 IcfgInterpreter]: Reachable states at location L575-1 satisfy 1488#(and (= (select |#length| |sll_create_#t~ret4.base|) 8) (<= 1 sll_create_~data) (<= 2 |sll_create_#in~len|) (<= 1 |sll_create_#in~data|) (< 0 sll_create_~len) (<= 0 |#NULL.base|) (not (= 0 |sll_create_#t~ret4.base|)) (<= |sll_create_#in~data| 1) (<= 0 |#NULL.offset|) (<= sll_create_~data 1) (<= |sll_create_#in~len| 2) (= |sll_create_#in~data| 1) (= |#NULL.base| 0) (= 1 (select |#valid| |sll_create_#t~ret4.base|)) (<= |#NULL.base| 0) (= 0 |sll_create_#t~ret4.offset|) (<= 0 |sll_create_#t~ret4.offset|) (<= |sll_create_#t~ret4.offset| 0) (<= 0 sll_create_~len) (< |#StackHeapBarrier| |sll_create_#t~ret4.base|) (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#t~ret4.base|) (+ |sll_create_#t~ret4.offset| 4))) (<= |#NULL.offset| 0) (<= sll_create_~len 2) (= |sll_create_#in~len| 2) (<= 0 sll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| |sll_create_#t~ret4.base|) (+ |sll_create_#t~ret4.offset| 4))) (= |#NULL.offset| 0) (<= sll_create_~head~0.offset 0) (= (select (select |#memory_int| |sll_create_#t~ret4.base|) |sll_create_#t~ret4.offset|) sll_create_~data)) [2019-10-07 13:28:57,818 INFO L193 IcfgInterpreter]: Reachable states at location L605 satisfy 38#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= main_~data~0 1) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 1 main_~data~0) (= |#valid| |old(#valid)|) (<= main_~data~0 1) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= main_~len~0 2) (<= 2 main_~len~0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 13:28:57,818 INFO L193 IcfgInterpreter]: Reachable states at location L607-2 satisfy 1380#(and (<= 0 main_~i~0) (<= main_~i~0 2) (or (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~data~0 1) (= 0 (select |old(#valid)| 0)) (= |#NULL.offset| 0) (= main_~len~0 2) (= main_~i~0 0)) (and (= |#NULL.base| 0) (<= |#NULL.base| 0) (= main_~data~0 1) (= |#NULL.offset| 0) (= main_~len~0 2))) (<= 0 main_~s~0.offset) (<= 0 |#NULL.base|) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= main_~data~0 1) (<= main_~s~0.offset 0) (<= 2 main_~len~0)) [2019-10-07 13:28:57,818 INFO L193 IcfgInterpreter]: Reachable states at location sll_get_data_atENTRY satisfy 1385#(and (= |#NULL.base| 0) (<= 0 |sll_get_data_at_#in~head.offset|) (<= |sll_get_data_at_#in~head.offset| 0) (<= |#NULL.base| 0) (= |sll_get_data_at_#in~index| 0) (<= |sll_get_data_at_#in~index| 0) (<= 0 |#NULL.base|) (<= 0 |sll_get_data_at_#in~index|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:28:57,818 INFO L193 IcfgInterpreter]: Reachable states at location L605-1 satisfy 117#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= |main_#t~ret11.offset| 0) (<= 0 |#NULL.base|) (= main_~data~0 1) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 1 main_~data~0) (<= main_~data~0 1) (<= 0 |main_#t~ret11.offset|) (= |#NULL.offset| 0) (= main_~len~0 2) (<= 2 main_~len~0)) [2019-10-07 13:28:57,818 INFO L193 IcfgInterpreter]: Reachable states at location L614 satisfy 891#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 2 main_~expected~0) (<= 3 main_~new_data~0) (<= 0 main_~s~0.offset) (<= 0 |#NULL.base|) (= main_~data~0 1) (<= main_~i~0 0) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= main_~expected~0 2) (<= main_~data~0 1) (= |#NULL.offset| 0) (= main_~len~0 2) (<= main_~s~0.offset 0) (<= 2 main_~len~0) (= main_~i~0 0) (<= main_~new_data~0 3)) [2019-10-07 13:28:57,818 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 1559#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:28:57,818 INFO L193 IcfgInterpreter]: Reachable states at location node_createEXIT satisfy 1507#(exists ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_12 Int)) (or (and (= |#NULL.base| 0) (<= |node_create_#in~data| 1) (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (store |old(#length)| |node_create_#t~malloc2.base| 8) |#length|) (<= |#NULL.base| 0) (= node_create_~data |node_create_#in~data|) (= |node_create_#t~malloc2.base| node_create_~temp~0.base) (<= 0 |#NULL.base|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= node_create_~temp~0.offset |node_create_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (not (= 0 node_create_~temp~0.base)) (<= |#NULL.offset| 0) (= |node_create_#t~malloc2.offset| 0) (<= 1 |node_create_#in~data|) (= node_create_~temp~0.offset |node_create_#res.offset|) (= |#memory_int| (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) v_DerPreprocessor_12) node_create_~temp~0.offset node_create_~data))) (= node_create_~temp~0.base |node_create_#res.base|) (not (= |node_create_#t~malloc2.base| 0)) (= (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|) (< |#StackHeapBarrier| |node_create_#t~malloc2.base|) (= |#NULL.offset| 0)) (and (not (= node_create_~temp~0.offset 0)) (= |#NULL.base| 0) (<= |node_create_#in~data| 1) (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (store |old(#length)| |node_create_#t~malloc2.base| 8) |#length|) (<= |#NULL.base| 0) (= node_create_~data |node_create_#in~data|) (= |node_create_#t~malloc2.base| node_create_~temp~0.base) (<= 0 |#NULL.base|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= node_create_~temp~0.offset |node_create_#t~malloc2.offset|) (= (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) v_DerPreprocessor_11) node_create_~temp~0.offset node_create_~data)) |#memory_int|) (<= 0 |#NULL.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (<= |#NULL.offset| 0) (= |node_create_#t~malloc2.offset| 0) (<= 1 |node_create_#in~data|) (= node_create_~temp~0.offset |node_create_#res.offset|) (= node_create_~temp~0.base |node_create_#res.base|) (not (= |node_create_#t~malloc2.base| 0)) (= (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|) (< |#StackHeapBarrier| |node_create_#t~malloc2.base|) (= |#NULL.offset| 0)))) [2019-10-07 13:28:57,818 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:28:57,819 INFO L193 IcfgInterpreter]: Reachable states at location L575 satisfy 1475#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 1 sll_create_~data) (<= 0 sll_create_~len) (<= 2 |sll_create_#in~len|) (<= 1 |sll_create_#in~data|) (< 0 sll_create_~len) (<= 0 |#NULL.base|) (<= |sll_create_#in~data| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= sll_create_~data 1) (<= sll_create_~len 2) (= |sll_create_#in~len| 2) (<= 0 sll_create_~head~0.offset) (<= |sll_create_#in~len| 2) (= |#NULL.offset| 0) (<= sll_create_~head~0.offset 0) (= |sll_create_#in~data| 1)) [2019-10-07 13:28:57,819 INFO L193 IcfgInterpreter]: Reachable states at location sll_update_atENTRY satisfy 1511#(and (or (and (<= |sll_update_at_#in~index| 0) (<= |sll_update_at_#in~data| 2)) (and (<= 3 |sll_update_at_#in~data|) (<= 1 |sll_update_at_#in~index|) (<= |sll_update_at_#in~index| 1) (<= |sll_update_at_#in~data| 3))) (or (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 |sll_update_at_#in~index|) (< |sll_update_at_#in~index| 2) (<= 0 |#NULL.base|) (= (+ |sll_update_at_#in~index| 2) |sll_update_at_#in~data|) (<= 0 |sll_update_at_#in~index|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |sll_update_at_#in~head.offset| 0) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (<= 0 |sll_update_at_#in~head.offset|) (<= 2 |sll_update_at_#in~data|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (< |sll_update_at_#in~index| 3) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (< |sll_update_at_#in~index| 2) (<= 0 |#NULL.base|) (= (+ |sll_update_at_#in~index| 2) |sll_update_at_#in~data|) (<= 0 |sll_update_at_#in~index|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |sll_update_at_#in~head.offset| 0) (= 1 |sll_update_at_#in~index|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= 3 |sll_update_at_#in~data|) (= |#NULL.offset| 0) (<= 0 |sll_update_at_#in~head.offset|) (<= 1 |sll_update_at_#in~index|) (<= |sll_update_at_#in~index| 1) (<= |sll_update_at_#in~data| 3) (<= 2 |sll_update_at_#in~data|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))) [2019-10-07 13:28:58,102 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 43 [2019-10-07 13:28:59,440 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-10-07 13:29:00,012 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-10-07 13:29:02,057 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:29:02,058 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 29, 29, 26] total 92 [2019-10-07 13:29:02,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-10-07 13:29:02,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-10-07 13:29:02,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=7998, Unknown=7, NotChecked=180, Total=8556 [2019-10-07 13:29:02,063 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand 93 states. [2019-10-07 13:29:03,938 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-10-07 13:29:04,982 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-10-07 13:29:05,561 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-10-07 13:29:06,991 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-10-07 13:29:07,225 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-10-07 13:29:07,455 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-10-07 13:29:07,803 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-10-07 13:29:08,024 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-10-07 13:29:27,933 WARN L191 SmtUtils]: Spent 19.55 s on a formula simplification. DAG size of input: 137 DAG size of output: 125 [2019-10-07 13:29:28,226 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-10-07 13:29:28,661 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-10-07 13:29:28,961 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-10-07 13:29:30,058 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-10-07 13:29:30,666 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-10-07 13:29:31,220 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-10-07 13:29:32,132 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-10-07 13:29:32,598 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-10-07 13:29:36,612 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-10-07 13:29:37,078 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-10-07 13:29:37,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:29:37,573 INFO L93 Difference]: Finished difference Result 108 states and 147 transitions. [2019-10-07 13:29:37,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-07 13:29:37,573 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 46 [2019-10-07 13:29:37,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:29:37,577 INFO L225 Difference]: With dead ends: 108 [2019-10-07 13:29:37,577 INFO L226 Difference]: Without dead ends: 106 [2019-10-07 13:29:37,583 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 75 SyntacticMatches, 6 SemanticMatches, 140 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5198 ImplicationChecksByTransitivity, 41.2s TimeCoverageRelationStatistics Valid=1196, Invalid=18541, Unknown=7, NotChecked=278, Total=20022 [2019-10-07 13:29:37,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-07 13:29:37,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 68. [2019-10-07 13:29:37,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-07 13:29:37,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2019-10-07 13:29:37,606 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 95 transitions. Word has length 46 [2019-10-07 13:29:37,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:29:37,606 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 95 transitions. [2019-10-07 13:29:37,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-10-07 13:29:37,607 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 95 transitions. [2019-10-07 13:29:37,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-07 13:29:37,608 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:29:37,609 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:29:37,810 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:29:37,811 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:29:37,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:29:37,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1825739850, now seen corresponding path program 3 times [2019-10-07 13:29:37,812 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:29:37,812 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:37,812 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:37,813 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:37,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:29:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:37,944 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-07 13:29:37,944 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:37,944 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:29:37,945 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:29:38,250 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 13:29:38,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:29:38,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 13:29:38,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:29:38,267 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 13:29:38,268 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:29:38,358 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 13:29:38,358 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:29:38,360 INFO L162 IcfgInterpreter]: Started Sifa with 31 locations of interest [2019-10-07 13:29:38,361 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:29:38,361 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:29:38,361 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:29:38,361 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:29:38,386 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-07 13:29:38,438 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:29:40,943 INFO L199 IcfgInterpreter]: Interpreting procedure sll_get_data_at with input of size 17 for LOIs [2019-10-07 13:29:40,951 INFO L199 IcfgInterpreter]: Interpreting procedure sll_create with input of size 33 for LOIs [2019-10-07 13:29:41,435 INFO L199 IcfgInterpreter]: Interpreting procedure node_create with input of size 29 for LOIs [2019-10-07 13:29:41,464 INFO L199 IcfgInterpreter]: Interpreting procedure sll_update_at with input of size 45 for LOIs [2019-10-07 13:29:41,543 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:29:41,546 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:29:41,546 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:29:41,547 INFO L193 IcfgInterpreter]: Reachable states at location sll_get_data_atEXIT satisfy 1412#(and (= |#NULL.base| 0) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|) (< |sll_get_data_at_#in~index| 2) (<= 0 |sll_get_data_at_#in~head.offset|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 sll_get_data_at_~index) (<= 0 |sll_get_data_at_#in~index|) (not (< 0 sll_get_data_at_~index)) (= (select (select |#memory_int| sll_get_data_at_~head.base) sll_get_data_at_~head.offset) |sll_get_data_at_#res|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |sll_get_data_at_#in~index| sll_get_data_at_~index) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (<= |sll_get_data_at_#in~head.offset| 0) (= |sll_get_data_at_#in~index| 0) (<= 0 sll_get_data_at_~head.offset) (<= |sll_get_data_at_#in~index| 0) (<= sll_get_data_at_~head.offset 0) (<= sll_get_data_at_~index 0) (= |#NULL.offset| 0)) [2019-10-07 13:29:41,547 INFO L193 IcfgInterpreter]: Reachable states at location L574-3 satisfy 1489#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 1 sll_create_~data) (<= 2 |sll_create_#in~len|) (<= 1 |sll_create_#in~data|) (<= 0 |#NULL.base|) (<= |sll_create_#in~data| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= sll_create_~data 1) (<= sll_create_~len 2) (= |sll_create_#in~len| 2) (<= 0 sll_create_~head~0.offset) (<= |sll_create_#in~len| 2) (= |#NULL.offset| 0) (<= sll_create_~head~0.offset 0) (= |sll_create_#in~data| 1)) [2019-10-07 13:29:41,547 INFO L193 IcfgInterpreter]: Reachable states at location sll_update_atEXIT satisfy 1574#(and (= |#NULL.base| 0) (<= sll_update_at_~data 3) (<= sll_update_at_~index 0) (= sll_update_at_~data (select (select |#memory_int| sll_update_at_~head.base) sll_update_at_~head.offset)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (< 0 sll_update_at_~index)) (<= sll_update_at_~index 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |sll_update_at_#in~index|) (<= |sll_update_at_#in~head.offset| 0) (<= 2 sll_update_at_~data) (= |#NULL.offset| 0) (<= 0 |sll_update_at_#in~head.offset|) (<= |sll_update_at_#in~index| 1) (<= |sll_update_at_#in~data| 3) (<= 2 |sll_update_at_#in~data|)) [2019-10-07 13:29:41,548 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:29:41,548 INFO L193 IcfgInterpreter]: Reachable states at location L589-2 satisfy 1407#(and (= |#NULL.base| 0) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|) (< |sll_get_data_at_#in~index| 2) (<= 0 |sll_get_data_at_#in~head.offset|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 sll_get_data_at_~index) (<= 0 |sll_get_data_at_#in~index|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |sll_get_data_at_#in~index| sll_get_data_at_~index) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (<= |sll_get_data_at_#in~head.offset| 0) (= |sll_get_data_at_#in~index| 0) (<= 0 sll_get_data_at_~head.offset) (<= |sll_get_data_at_#in~index| 0) (<= sll_get_data_at_~head.offset 0) (<= sll_get_data_at_~index 0) (= |#NULL.offset| 0)) [2019-10-07 13:29:41,548 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 13:29:41,548 INFO L193 IcfgInterpreter]: Reachable states at location L613 satisfy 1372#(and (<= 0 main_~i~0) (<= 2 main_~expected~0) (<= main_~i~0 0) (<= main_~expected~0 2) (and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 0 main_~s~0.offset) (<= 0 |#NULL.base|) (= main_~data~0 1) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= main_~data~0 1) (= |#NULL.offset| 0) (= main_~len~0 2) (= main_~i~0 0)) (<= main_~s~0.offset 0) (<= 2 main_~len~0)) [2019-10-07 13:29:41,548 INFO L193 IcfgInterpreter]: Reachable states at location L565-1 satisfy 1526#(and (<= 0 node_create_~temp~0.offset) (or (and (= |#NULL.base| 0) (not (= node_create_~temp~0.offset 0)) (<= |#NULL.base| 0) (<= |node_create_#in~data| 1) (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (store |old(#length)| |node_create_#t~malloc2.base| 8) |#length|) (= node_create_~data |node_create_#in~data|) (= |node_create_#t~malloc2.base| node_create_~temp~0.base) (<= 0 |#NULL.base|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= node_create_~temp~0.offset |node_create_#t~malloc2.offset|) (= |node_create_#t~malloc2.offset| 0) (not (= |node_create_#t~malloc2.base| 0)) (= |#memory_int| |old(#memory_int)|) (< |#StackHeapBarrier| |node_create_#t~malloc2.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= |node_create_#in~data| 1) (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (store |old(#length)| |node_create_#t~malloc2.base| 8) |#length|) (= node_create_~data |node_create_#in~data|) (= |node_create_#t~malloc2.base| node_create_~temp~0.base) (<= 0 |#NULL.base|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= node_create_~temp~0.offset |node_create_#t~malloc2.offset|) (not (= 0 node_create_~temp~0.base)) (= |node_create_#t~malloc2.offset| 0) (not (= |node_create_#t~malloc2.base| 0)) (= |#memory_int| |old(#memory_int)|) (< |#StackHeapBarrier| |node_create_#t~malloc2.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (<= |node_create_#t~malloc2.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= node_create_~temp~0.offset 0) (<= 1 |node_create_#in~data|) (<= node_create_~data 1) (<= 1 node_create_~data) (<= 0 |node_create_#t~malloc2.offset|)) [2019-10-07 13:29:41,548 INFO L193 IcfgInterpreter]: Reachable states at location L613-1 satisfy 1145#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 2 main_~expected~0) (<= 3 main_~new_data~0) (<= 0 main_~s~0.offset) (<= 0 |#NULL.base|) (= main_~data~0 1) (<= main_~i~0 0) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= main_~expected~0 2) (<= main_~data~0 1) (= |#NULL.offset| 0) (= main_~len~0 2) (<= main_~s~0.offset 0) (<= 2 main_~len~0) (= main_~i~0 0) (<= main_~new_data~0 3)) [2019-10-07 13:29:41,548 INFO L193 IcfgInterpreter]: Reachable states at location L596-2 satisfy 1569#(and (= |#NULL.base| 0) (<= sll_update_at_~data 3) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= sll_update_at_~index 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |sll_update_at_#in~index|) (<= |sll_update_at_#in~head.offset| 0) (<= 2 sll_update_at_~data) (= |#NULL.offset| 0) (<= 0 |sll_update_at_#in~head.offset|) (<= |sll_update_at_#in~index| 1) (<= |sll_update_at_#in~data| 3) (<= 2 |sll_update_at_#in~data|)) [2019-10-07 13:29:41,549 INFO L193 IcfgInterpreter]: Reachable states at location L565 satisfy 1521#(and (<= |node_create_#in~data| 1) (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (store |old(#length)| |node_create_#t~malloc2.base| 8) |#length|) (= |node_create_#t~malloc2.base| node_create_~temp~0.base) (<= 0 |#NULL.base|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= node_create_~temp~0.offset |node_create_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (= |node_create_#t~malloc2.offset| 0) (<= node_create_~data 1) (not (= |node_create_#t~malloc2.base| 0)) (<= 1 node_create_~data) (<= 0 |node_create_#t~malloc2.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |#NULL.base| 0) (<= |#NULL.base| 0) (= node_create_~data |node_create_#in~data|) (<= 0 node_create_~temp~0.offset) (<= |node_create_#t~malloc2.offset| 0) (<= |#NULL.offset| 0) (<= node_create_~temp~0.offset 0) (<= 1 |node_create_#in~data|) (= |#memory_int| |old(#memory_int)|) (< |#StackHeapBarrier| |node_create_#t~malloc2.base|) (= |#NULL.offset| 0)) [2019-10-07 13:29:41,549 INFO L193 IcfgInterpreter]: Reachable states at location L613-2 satisfy 1109#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 2 main_~expected~0) (<= 0 (+ |main_#t~ret14| 2147483648)) (<= 3 main_~new_data~0) (<= 0 main_~s~0.offset) (<= 0 |#NULL.base|) (<= |main_#t~ret14| 2147483647) (= main_~data~0 1) (<= main_~i~0 0) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= main_~expected~0 2) (<= main_~data~0 1) (= |#NULL.offset| 0) (= main_~len~0 2) (<= main_~s~0.offset 0) (<= 2 main_~len~0) (= main_~i~0 0) (<= main_~new_data~0 3)) [2019-10-07 13:29:41,549 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 756#(and (or (and (<= (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) 2147483647) (<= 0 main_~i~0) (= (+ main_~i~0 main_~len~0) main_~expected~0) (= 0 |#NULL.base|) (<= 2 main_~expected~0) (= (+ main_~len~0 1) main_~new_data~0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= 2 main_~new_data~0) (< main_~i~0 main_~len~0) (= main_~len~0 2) (<= |#NULL.base| 0) (<= 3 main_~new_data~0) (<= 0 main_~s~0.offset) (= main_~data~0 1) (<= main_~i~0 0) (<= main_~len~0 2) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= 0 (+ (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) 2147483648)) (not (= main_~expected~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (< 1 main_~len~0) (= |#NULL.offset| 0) (< 0 main_~len~0) (= main_~i~0 0)) (and (<= (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) 2147483647) (<= 0 main_~i~0) (= (+ main_~i~0 main_~len~0) main_~expected~0) (= 0 |#NULL.base|) (<= 2 main_~expected~0) (<= main_~len~0 1) (<= 0 |#NULL.base|) (= main_~len~0 main_~new_data~0) (<= 0 |#NULL.offset|) (<= 2 main_~new_data~0) (< main_~i~0 main_~len~0) (= main_~len~0 2) (<= |#NULL.base| 0) (<= 3 main_~new_data~0) (<= 0 main_~s~0.offset) (= main_~data~0 1) (<= main_~i~0 0) (<= main_~len~0 2) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= 0 (+ (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) 2147483648)) (not (= main_~expected~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (= |#NULL.offset| 0) (< 0 main_~len~0) (= main_~i~0 0))) (<= main_~expected~0 2) (<= main_~data~0 1) (<= main_~s~0.offset 0) (<= 2 main_~len~0) (<= main_~new_data~0 3)) [2019-10-07 13:29:41,549 INFO L193 IcfgInterpreter]: Reachable states at location sll_createEXIT satisfy 1494#(and (or (and (<= sll_create_~len 0) (<= sll_create_~new_head~0.offset 0) (<= 0 |sll_create_#res.offset|) (<= |sll_create_#res.offset| 0) (<= 0 sll_create_~new_head~0.offset)) (and (<= sll_create_~len 0) (<= |sll_create_#res.base| 0) (<= 0 |sll_create_#res.offset|) (<= 0 |sll_create_#res.base|) (<= |sll_create_#res.offset| 0) (<= 0 sll_create_~head~0.base) (<= sll_create_~head~0.base 0))) (or (and (= |#NULL.base| 0) (= sll_create_~head~0.base 0) (= |sll_create_#res.offset| sll_create_~head~0.offset) (<= |#NULL.base| 0) (<= 1 sll_create_~data) (not (< 0 sll_create_~len)) (<= 2 |sll_create_#in~len|) (<= 1 |sll_create_#in~data|) (<= 0 |#NULL.base|) (<= |sll_create_#in~data| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= sll_create_~data 1) (= sll_create_~head~0.offset 0) (<= sll_create_~len 2) (= |sll_create_#in~len| 2) (<= 0 sll_create_~head~0.offset) (<= |sll_create_#in~len| 2) (= |#NULL.offset| 0) (= sll_create_~head~0.base |sll_create_#res.base|) (<= sll_create_~head~0.offset 0) (= |sll_create_#in~data| 1)) (and (= |#NULL.base| 0) (= sll_create_~new_head~0.offset 0) (= |sll_create_#res.offset| sll_create_~head~0.offset) (<= |#NULL.base| 0) (<= 1 sll_create_~data) (not (< 0 sll_create_~len)) (<= 2 |sll_create_#in~len|) (<= 1 |sll_create_#in~data|) (<= 0 |#NULL.base|) (<= |sll_create_#in~data| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= sll_create_~data 1) (<= sll_create_~len 2) (= |sll_create_#in~len| 2) (<= 0 sll_create_~head~0.offset) (<= |sll_create_#in~len| 2) (= |#NULL.offset| 0) (= sll_create_~head~0.base |sll_create_#res.base|) (<= sll_create_~head~0.offset 0) (= |sll_create_#in~data| 1)))) [2019-10-07 13:29:41,549 INFO L193 IcfgInterpreter]: Reachable states at location node_createENTRY satisfy 1516#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= |node_create_#in~data| 1) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 |node_create_#in~data|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 13:29:41,549 INFO L193 IcfgInterpreter]: Reachable states at location L609 satisfy 1350#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 main_~s~0.offset) (<= 0 |#NULL.base|) (= main_~data~0 1) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= 2 main_~new_data~0) (<= main_~data~0 1) (<= main_~i~0 1) (= |#NULL.offset| 0) (= main_~len~0 2) (<= main_~s~0.offset 0) (<= 2 main_~len~0) (<= main_~new_data~0 3)) [2019-10-07 13:29:41,549 INFO L193 IcfgInterpreter]: Reachable states at location L609-1 satisfy 1295#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 main_~s~0.offset) (<= 0 |#NULL.base|) (= main_~data~0 1) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= 2 main_~new_data~0) (<= main_~data~0 1) (<= main_~i~0 1) (= |#NULL.offset| 0) (= main_~len~0 2) (<= main_~s~0.offset 0) (<= 2 main_~len~0) (<= main_~new_data~0 3)) [2019-10-07 13:29:41,550 INFO L193 IcfgInterpreter]: Reachable states at location L611-3 satisfy 1392#(and (or (and (= |#NULL.base| 0) (= main_~data~0 1) (= |#NULL.offset| 0) (= main_~len~0 2) (= main_~i~0 0)) (and (= 0 |#NULL.base|) (<= 3 main_~new_data~0) (= main_~data~0 1) (= 0 (select |old(#valid)| 0)) (<= main_~len~0 0) (= |#NULL.offset| 0) (= main_~len~0 2) (= main_~i~0 0) (<= main_~new_data~0 3))) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 main_~s~0.offset) (<= 0 |#NULL.base|) (<= main_~i~0 0) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= main_~data~0 1) (<= main_~s~0.offset 0) (<= 2 main_~len~0)) [2019-10-07 13:29:41,550 INFO L193 IcfgInterpreter]: Reachable states at location sll_createENTRY satisfy 1416#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 2 |sll_create_#in~len|) (<= 1 |sll_create_#in~data|) (<= 0 |#NULL.base|) (<= |sll_create_#in~data| 1) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| |old(#valid)|) (= |sll_create_#in~len| 2) (<= |sll_create_#in~len| 2) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= |sll_create_#in~data| 1) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 13:29:41,550 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 1578#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:29:41,550 INFO L193 IcfgInterpreter]: Reachable states at location L575-1 satisfy 1512#(and (<= 0 sll_create_~len) (or (and (= (select |#length| |sll_create_#t~ret4.base|) 8) (<= 1 sll_create_~data) (<= 2 |sll_create_#in~len|) (<= 1 |sll_create_#in~data|) (< 0 sll_create_~len) (<= 0 |#NULL.base|) (not (= 0 |sll_create_#t~ret4.base|)) (<= |sll_create_#in~data| 1) (<= 0 |#NULL.offset|) (<= sll_create_~data 1) (= |sll_create_#in~data| 1) (= 1 (select |#valid| |sll_create_#t~ret4.base|)) (= |#NULL.base| 0) (= sll_create_~head~0.base 0) (= 0 |sll_create_#t~ret4.offset|) (<= |#NULL.base| 0) (<= |sll_create_#t~ret4.offset| 0) (<= 0 |sll_create_#t~ret4.offset|) (< |#StackHeapBarrier| |sll_create_#t~ret4.base|) (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#t~ret4.base|) (+ |sll_create_#t~ret4.offset| 4))) (<= |#NULL.offset| 0) (= sll_create_~head~0.offset 0) (= |sll_create_#in~len| 2) (= 0 (select (select |#memory_$Pointer$.offset| |sll_create_#t~ret4.base|) (+ |sll_create_#t~ret4.offset| 4))) (= |#NULL.offset| 0) (= (select (select |#memory_int| |sll_create_#t~ret4.base|) |sll_create_#t~ret4.offset|) sll_create_~data)) (and (= (select |#length| |sll_create_#t~ret4.base|) 8) (<= 1 sll_create_~data) (<= 2 |sll_create_#in~len|) (<= 1 |sll_create_#in~data|) (< 0 sll_create_~len) (<= 0 |#NULL.base|) (not (= 0 |sll_create_#t~ret4.base|)) (<= |sll_create_#in~data| 1) (<= 0 |#NULL.offset|) (<= sll_create_~data 1) (= |sll_create_#in~data| 1) (= 1 (select |#valid| |sll_create_#t~ret4.base|)) (= |#NULL.base| 0) (= sll_create_~new_head~0.offset 0) (= 0 |sll_create_#t~ret4.offset|) (<= |#NULL.base| 0) (<= |sll_create_#t~ret4.offset| 0) (<= 0 |sll_create_#t~ret4.offset|) (< |#StackHeapBarrier| |sll_create_#t~ret4.base|) (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#t~ret4.base|) (+ |sll_create_#t~ret4.offset| 4))) (<= |#NULL.offset| 0) (= |sll_create_#in~len| 2) (= 0 (select (select |#memory_$Pointer$.offset| |sll_create_#t~ret4.base|) (+ |sll_create_#t~ret4.offset| 4))) (= |#NULL.offset| 0) (= (select (select |#memory_int| |sll_create_#t~ret4.base|) |sll_create_#t~ret4.offset|) sll_create_~data))) (<= sll_create_~len 2) (<= 0 sll_create_~head~0.offset) (<= |sll_create_#in~len| 2) (<= sll_create_~head~0.offset 0)) [2019-10-07 13:29:41,550 INFO L193 IcfgInterpreter]: Reachable states at location L605 satisfy 38#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= main_~data~0 1) (<= main_~len~0 2) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (= |#valid| |old(#valid)|) (<= main_~data~0 1) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= main_~len~0 2) (<= 2 main_~len~0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 13:29:41,550 INFO L193 IcfgInterpreter]: Reachable states at location L607-2 satisfy 1397#(and (or (and (= |#NULL.base| 0) (<= main_~i~0 2) (= main_~data~0 1) (= |#NULL.offset| 0) (= main_~len~0 2)) (and (= 0 |#NULL.base|) (= main_~data~0 1) (= 0 (select |old(#valid)| 0)) (= |#NULL.offset| 0) (= main_~len~0 2) (= main_~i~0 0))) (or (and (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~i~0 2) (<= main_~data~0 1) (<= 0 main_~s~0.offset) (<= 0 |#NULL.base|) (<= main_~len~0 2) (<= main_~s~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 2 main_~len~0) (<= 1 main_~data~0)) (and (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~data~0 1) (<= 0 main_~s~0.offset) (<= 0 |#NULL.base|) (<= main_~i~0 0) (<= main_~len~0 2) (<= main_~s~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 2 main_~len~0) (<= 1 main_~data~0)))) [2019-10-07 13:29:41,550 INFO L193 IcfgInterpreter]: Reachable states at location sll_get_data_atENTRY satisfy 1402#(and (= |#NULL.base| 0) (< |sll_get_data_at_#in~index| 2) (<= 0 |sll_get_data_at_#in~head.offset|) (<= |sll_get_data_at_#in~head.offset| 0) (= |sll_get_data_at_#in~index| 0) (<= |#NULL.base| 0) (<= |sll_get_data_at_#in~index| 0) (<= 0 |#NULL.base|) (<= 0 |sll_get_data_at_#in~index|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:29:41,550 INFO L193 IcfgInterpreter]: Reachable states at location L605-1 satisfy 120#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= |main_#t~ret11.offset| 0) (<= 0 |#NULL.base|) (= main_~data~0 1) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= main_~data~0 1) (<= 0 |main_#t~ret11.offset|) (= |#NULL.offset| 0) (= main_~len~0 2) (<= 2 main_~len~0)) [2019-10-07 13:29:41,551 INFO L193 IcfgInterpreter]: Reachable states at location L614 satisfy 896#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 2 main_~expected~0) (<= 3 main_~new_data~0) (<= 0 main_~s~0.offset) (<= 0 |#NULL.base|) (= main_~data~0 1) (<= main_~i~0 0) (<= main_~len~0 2) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~data~0) (<= main_~expected~0 2) (<= main_~data~0 1) (= |#NULL.offset| 0) (= main_~len~0 2) (<= main_~s~0.offset 0) (<= 2 main_~len~0) (= main_~i~0 0) (<= main_~new_data~0 3)) [2019-10-07 13:29:41,551 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 1583#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:29:41,551 INFO L193 IcfgInterpreter]: Reachable states at location node_createEXIT satisfy 1531#(exists ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_14 Int)) (or (and (not (= node_create_~temp~0.offset 0)) (= |#NULL.base| 0) (<= |node_create_#in~data| 1) (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (store |old(#length)| |node_create_#t~malloc2.base| 8) |#length|) (<= |#NULL.base| 0) (= node_create_~data |node_create_#in~data|) (= |node_create_#t~malloc2.base| node_create_~temp~0.base) (<= 0 |#NULL.base|) (= (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) v_DerPreprocessor_14) node_create_~temp~0.offset node_create_~data)) |#memory_int|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= node_create_~temp~0.offset |node_create_#t~malloc2.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |node_create_#t~malloc2.offset| 0) (<= 1 |node_create_#in~data|) (= node_create_~temp~0.offset |node_create_#res.offset|) (= node_create_~temp~0.base |node_create_#res.base|) (not (= |node_create_#t~malloc2.base| 0)) (= (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|) (< |#StackHeapBarrier| |node_create_#t~malloc2.base|) (= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |#memory_int| (store |old(#memory_int)| node_create_~temp~0.base (store (store (select |old(#memory_int)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) v_DerPreprocessor_13) node_create_~temp~0.offset node_create_~data))) (<= |node_create_#in~data| 1) (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (store |old(#length)| |node_create_#t~malloc2.base| 8) |#length|) (<= |#NULL.base| 0) (= node_create_~data |node_create_#in~data|) (= |node_create_#t~malloc2.base| node_create_~temp~0.base) (<= 0 |#NULL.base|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= node_create_~temp~0.offset |node_create_#t~malloc2.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))) (<= 0 |#NULL.offset|) (not (= 0 node_create_~temp~0.base)) (<= |#NULL.offset| 0) (= |node_create_#t~malloc2.offset| 0) (<= 1 |node_create_#in~data|) (= node_create_~temp~0.offset |node_create_#res.offset|) (= node_create_~temp~0.base |node_create_#res.base|) (not (= |node_create_#t~malloc2.base| 0)) (= (store |old(#memory_$Pointer$.offset)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.offset)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| node_create_~temp~0.base) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|) (< |#StackHeapBarrier| |node_create_#t~malloc2.base|) (= |#NULL.offset| 0)))) [2019-10-07 13:29:41,551 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:29:41,551 INFO L193 IcfgInterpreter]: Reachable states at location L575 satisfy 1499#(and (or (and (<= 0 sll_create_~len) (<= 0 sll_create_~head~0.base) (<= sll_create_~head~0.base 0)) (and (<= 0 sll_create_~len) (<= sll_create_~new_head~0.offset 0) (<= 0 sll_create_~new_head~0.offset))) (or (and (= |#NULL.base| 0) (= sll_create_~new_head~0.offset 0) (<= |#NULL.base| 0) (<= 1 sll_create_~data) (<= 2 |sll_create_#in~len|) (<= 1 |sll_create_#in~data|) (< 0 sll_create_~len) (<= 0 |#NULL.base|) (<= |sll_create_#in~data| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= sll_create_~data 1) (<= sll_create_~len 2) (= |sll_create_#in~len| 2) (<= 0 sll_create_~head~0.offset) (<= |sll_create_#in~len| 2) (= |#NULL.offset| 0) (<= sll_create_~head~0.offset 0) (= |sll_create_#in~data| 1)) (and (= |#NULL.base| 0) (= sll_create_~head~0.base 0) (<= |#NULL.base| 0) (<= 1 sll_create_~data) (<= 2 |sll_create_#in~len|) (<= 1 |sll_create_#in~data|) (< 0 sll_create_~len) (<= 0 |#NULL.base|) (<= |sll_create_#in~data| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= sll_create_~data 1) (= sll_create_~head~0.offset 0) (<= sll_create_~len 2) (= |sll_create_#in~len| 2) (<= 0 sll_create_~head~0.offset) (<= |sll_create_#in~len| 2) (= |#NULL.offset| 0) (<= sll_create_~head~0.offset 0) (= |sll_create_#in~data| 1)))) [2019-10-07 13:29:41,551 INFO L193 IcfgInterpreter]: Reachable states at location sll_update_atENTRY satisfy 1535#(and (or (and (<= |sll_update_at_#in~index| 0) (<= |sll_update_at_#in~data| 2)) (and (<= 3 |sll_update_at_#in~data|) (<= 1 |sll_update_at_#in~index|) (<= |sll_update_at_#in~index| 1) (<= |sll_update_at_#in~data| 3))) (or (and (= |sll_update_at_#in~data| (+ |sll_update_at_#in~index| 2)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (< |sll_update_at_#in~index| |sll_update_at_#in~data|) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |sll_update_at_#in~index|) (<= (+ |sll_update_at_#in~index| 2) |sll_update_at_#in~data|) (<= |sll_update_at_#in~head.offset| 0) (= 1 |sll_update_at_#in~index|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (<= 3 |sll_update_at_#in~data|) (<= 0 |sll_update_at_#in~head.offset|) (<= 1 |sll_update_at_#in~index|) (<= |sll_update_at_#in~index| 1) (<= |sll_update_at_#in~data| 3) (<= |sll_update_at_#in~data| (+ |sll_update_at_#in~index| 2)) (< (* 2 |sll_update_at_#in~index|) |sll_update_at_#in~data|) (<= 2 |sll_update_at_#in~data|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= |sll_update_at_#in~data| (+ |sll_update_at_#in~index| 2)) (= 0 |#NULL.base|) (= 0 |sll_update_at_#in~index|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |sll_update_at_#in~index|) (<= (+ |sll_update_at_#in~index| 2) |sll_update_at_#in~data|) (<= |sll_update_at_#in~head.offset| 0) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (<= 0 |sll_update_at_#in~head.offset|) (<= |sll_update_at_#in~data| (+ |sll_update_at_#in~index| 2)) (< (* 2 |sll_update_at_#in~index|) |sll_update_at_#in~data|) (<= 2 |sll_update_at_#in~data|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))) [2019-10-07 13:29:41,737 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-10-07 13:29:42,239 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 32 [2019-10-07 13:29:42,441 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-10-07 13:29:42,898 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-10-07 13:29:43,173 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 31 [2019-10-07 13:29:44,419 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:29:44,419 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 26] total 36 [2019-10-07 13:29:44,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-07 13:29:44,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-07 13:29:44,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1194, Unknown=0, NotChecked=0, Total=1332 [2019-10-07 13:29:44,422 INFO L87 Difference]: Start difference. First operand 68 states and 95 transitions. Second operand 37 states. [2019-10-07 13:29:45,385 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-10-07 13:29:45,791 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-10-07 13:29:47,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:29:47,768 INFO L93 Difference]: Finished difference Result 109 states and 149 transitions. [2019-10-07 13:29:47,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-07 13:29:47,768 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 47 [2019-10-07 13:29:47,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:29:47,770 INFO L225 Difference]: With dead ends: 109 [2019-10-07 13:29:47,770 INFO L226 Difference]: Without dead ends: 76 [2019-10-07 13:29:47,772 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1194 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=417, Invalid=3873, Unknown=0, NotChecked=0, Total=4290 [2019-10-07 13:29:47,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-07 13:29:47,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2019-10-07 13:29:47,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-07 13:29:47,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 86 transitions. [2019-10-07 13:29:47,788 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 86 transitions. Word has length 47 [2019-10-07 13:29:47,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:29:47,788 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 86 transitions. [2019-10-07 13:29:47,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-07 13:29:47,788 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 86 transitions. [2019-10-07 13:29:47,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-07 13:29:47,790 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:29:47,790 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:29:47,993 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:29:47,994 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:29:47,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:29:47,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1807373249, now seen corresponding path program 4 times [2019-10-07 13:29:47,995 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:29:47,995 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:47,995 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:47,996 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:47,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:29:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:48,088 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-07 13:29:48,088 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:48,088 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:29:48,089 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:29:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:48,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-07 13:29:48,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:29:48,487 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-07 13:29:48,487 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:29:48,560 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-07 13:29:48,560 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 13:29:48,560 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 8 [2019-10-07 13:29:48,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:29:48,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:29:48,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:29:48,561 INFO L87 Difference]: Start difference. First operand 66 states and 86 transitions. Second operand 6 states. [2019-10-07 13:29:48,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:29:48,635 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2019-10-07 13:29:48,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:29:48,636 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-10-07 13:29:48,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:29:48,637 INFO L225 Difference]: With dead ends: 86 [2019-10-07 13:29:48,637 INFO L226 Difference]: Without dead ends: 54 [2019-10-07 13:29:48,639 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 99 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:29:48,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-07 13:29:48,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-10-07 13:29:48,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-07 13:29:48,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2019-10-07 13:29:48,650 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 52 [2019-10-07 13:29:48,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:29:48,650 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2019-10-07 13:29:48,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:29:48,651 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2019-10-07 13:29:48,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-07 13:29:48,656 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:29:48,656 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:29:48,857 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:29:48,858 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:29:48,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:29:48,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1156274809, now seen corresponding path program 1 times [2019-10-07 13:29:48,858 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:29:48,859 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:48,859 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:48,859 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:48,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:29:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:48,968 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-07 13:29:48,968 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:48,968 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:29:48,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:29:49,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:49,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-07 13:29:49,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:29:49,385 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-07 13:29:49,385 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:29:49,456 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-07 13:29:49,457 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 13:29:49,457 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [6] total 8 [2019-10-07 13:29:49,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:29:49,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:29:49,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:29:49,458 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 7 states. [2019-10-07 13:29:49,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:29:49,528 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2019-10-07 13:29:49,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:29:49,528 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-10-07 13:29:49,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:29:49,530 INFO L225 Difference]: With dead ends: 65 [2019-10-07 13:29:49,530 INFO L226 Difference]: Without dead ends: 55 [2019-10-07 13:29:49,531 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:29:49,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-07 13:29:49,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-10-07 13:29:49,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-07 13:29:49,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-10-07 13:29:49,541 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 53 [2019-10-07 13:29:49,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:29:49,542 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-10-07 13:29:49,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:29:49,542 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-10-07 13:29:49,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-07 13:29:49,543 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:29:49,544 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:29:49,749 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:29:49,749 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:29:49,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:29:49,750 INFO L82 PathProgramCache]: Analyzing trace with hash -379687812, now seen corresponding path program 1 times [2019-10-07 13:29:49,750 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:29:49,750 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:49,750 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:49,750 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:49,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:29:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:50,698 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 13:29:50,698 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:50,698 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:29:50,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:29:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:51,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 104 conjunts are in the unsatisfiable core [2019-10-07 13:29:51,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:29:52,438 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int)) (and (<= sll_update_at_~head.offset |c_sll_update_at_#in~head.offset|) (= (store |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset))) |c_#memory_$Pointer$.base|))) is different from true [2019-10-07 13:29:53,705 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2019-10-07 13:29:53,705 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:29:54,878 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:29:54,879 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-07 13:29:54,886 INFO L168 Benchmark]: Toolchain (without parser) took 99071.99 ms. Allocated memory was 145.2 MB in the beginning and 842.0 MB in the end (delta: 696.8 MB). Free memory was 102.5 MB in the beginning and 104.6 MB in the end (delta: -2.2 MB). Peak memory consumption was 694.6 MB. Max. memory is 7.1 GB. [2019-10-07 13:29:54,886 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 122.3 MB in the beginning and 122.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 13:29:54,886 INFO L168 Benchmark]: CACSL2BoogieTranslator took 669.95 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 102.3 MB in the beginning and 164.8 MB in the end (delta: -62.5 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. [2019-10-07 13:29:54,886 INFO L168 Benchmark]: Boogie Preprocessor took 66.75 ms. Allocated memory is still 201.9 MB. Free memory was 164.8 MB in the beginning and 162.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-10-07 13:29:54,886 INFO L168 Benchmark]: RCFGBuilder took 754.57 ms. Allocated memory is still 201.9 MB. Free memory was 162.1 MB in the beginning and 106.7 MB in the end (delta: 55.3 MB). Peak memory consumption was 55.3 MB. Max. memory is 7.1 GB. [2019-10-07 13:29:54,887 INFO L168 Benchmark]: TraceAbstraction took 97576.55 ms. Allocated memory was 201.9 MB in the beginning and 842.0 MB in the end (delta: 640.2 MB). Free memory was 106.0 MB in the beginning and 104.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 641.5 MB. Max. memory is 7.1 GB. [2019-10-07 13:29:54,888 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 122.3 MB in the beginning and 122.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 669.95 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 102.3 MB in the beginning and 164.8 MB in the end (delta: -62.5 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 66.75 ms. Allocated memory is still 201.9 MB. Free memory was 164.8 MB in the beginning and 162.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 754.57 ms. Allocated memory is still 201.9 MB. Free memory was 162.1 MB in the beginning and 106.7 MB in the end (delta: 55.3 MB). Peak memory consumption was 55.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 97576.55 ms. Allocated memory was 201.9 MB in the beginning and 842.0 MB in the end (delta: 640.2 MB). Free memory was 106.0 MB in the beginning and 104.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 641.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...