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/forester-heap/dll-rb-cnstr_1-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 03:48:20,421 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 03:48:20,424 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 03:48:20,444 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 03:48:20,445 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 03:48:20,447 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 03:48:20,449 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 03:48:20,459 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 03:48:20,461 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 03:48:20,462 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 03:48:20,463 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 03:48:20,465 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 03:48:20,465 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 03:48:20,466 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 03:48:20,469 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 03:48:20,471 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 03:48:20,473 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 03:48:20,474 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 03:48:20,479 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 03:48:20,482 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 03:48:20,484 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 03:48:20,485 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 03:48:20,487 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 03:48:20,488 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 03:48:20,492 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 03:48:20,492 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 03:48:20,492 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 03:48:20,495 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 03:48:20,496 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 03:48:20,498 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 03:48:20,498 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 03:48:20,500 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 03:48:20,501 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 03:48:20,502 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 03:48:20,505 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 03:48:20,506 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 03:48:20,506 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 03:48:20,506 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 03:48:20,507 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 03:48:20,509 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 03:48:20,512 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 03:48:20,513 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 03:48:20,532 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 03:48:20,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 03:48:20,534 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 03:48:20,534 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 03:48:20,534 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 03:48:20,535 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 03:48:20,535 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 03:48:20,535 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 03:48:20,535 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 03:48:20,535 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 03:48:20,536 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 03:48:20,536 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 03:48:20,537 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 03:48:20,537 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 03:48:20,537 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 03:48:20,537 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 03:48:20,538 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 03:48:20,538 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 03:48:20,538 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 03:48:20,538 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 03:48:20,538 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 03:48:20,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 03:48:20,539 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 03:48:20,539 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 03:48:20,539 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 03:48:20,539 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 03:48:20,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 03:48:20,540 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 03:48:20,540 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 03:48:20,876 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 03:48:20,889 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 03:48:20,893 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 03:48:20,895 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 03:48:20,895 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 03:48:20,896 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1-1.i [2019-10-07 03:48:20,963 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49399a87b/d4241994df444669832a491523de030e/FLAG04e219c0d [2019-10-07 03:48:21,473 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 03:48:21,473 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1-1.i [2019-10-07 03:48:21,494 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49399a87b/d4241994df444669832a491523de030e/FLAG04e219c0d [2019-10-07 03:48:21,762 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49399a87b/d4241994df444669832a491523de030e [2019-10-07 03:48:21,774 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 03:48:21,776 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 03:48:21,781 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 03:48:21,781 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 03:48:21,785 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 03:48:21,786 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:48:21" (1/1) ... [2019-10-07 03:48:21,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@759a7100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:21, skipping insertion in model container [2019-10-07 03:48:21,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:48:21" (1/1) ... [2019-10-07 03:48:21,795 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 03:48:21,840 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 03:48:22,317 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:48:22,340 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 03:48:22,402 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:48:22,459 INFO L192 MainTranslator]: Completed translation [2019-10-07 03:48:22,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:22 WrapperNode [2019-10-07 03:48:22,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 03:48:22,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 03:48:22,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 03:48:22,461 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 03:48:22,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:22" (1/1) ... [2019-10-07 03:48:22,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:22" (1/1) ... [2019-10-07 03:48:22,499 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:22" (1/1) ... [2019-10-07 03:48:22,499 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:22" (1/1) ... [2019-10-07 03:48:22,521 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:22" (1/1) ... [2019-10-07 03:48:22,530 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:22" (1/1) ... [2019-10-07 03:48:22,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:22" (1/1) ... [2019-10-07 03:48:22,540 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 03:48:22,541 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 03:48:22,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 03:48:22,541 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 03:48:22,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:22" (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 03:48:22,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 03:48:22,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 03:48:22,604 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 03:48:22,604 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-07 03:48:22,604 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-07 03:48:22,605 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-07 03:48:22,605 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-07 03:48:22,605 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-07 03:48:22,606 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-07 03:48:22,606 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-07 03:48:22,606 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-07 03:48:22,606 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-07 03:48:22,607 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-07 03:48:22,607 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-07 03:48:22,607 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-07 03:48:22,607 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-07 03:48:22,609 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-07 03:48:22,609 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-07 03:48:22,610 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-07 03:48:22,610 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-07 03:48:22,610 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-07 03:48:22,611 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-07 03:48:22,611 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-07 03:48:22,611 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-07 03:48:22,611 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-07 03:48:22,611 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-07 03:48:22,611 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-07 03:48:22,611 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-07 03:48:22,612 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-07 03:48:22,612 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-07 03:48:22,612 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-07 03:48:22,612 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-07 03:48:22,612 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-07 03:48:22,612 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-07 03:48:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-07 03:48:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-07 03:48:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-07 03:48:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-07 03:48:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-07 03:48:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-07 03:48:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-07 03:48:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-07 03:48:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-07 03:48:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-07 03:48:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-07 03:48:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-07 03:48:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-07 03:48:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-07 03:48:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-07 03:48:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-07 03:48:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-07 03:48:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-07 03:48:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-07 03:48:22,615 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 03:48:22,615 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-07 03:48:22,615 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-07 03:48:22,615 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-07 03:48:22,615 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-07 03:48:22,615 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-07 03:48:22,615 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-07 03:48:22,616 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-07 03:48:22,616 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-07 03:48:22,616 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-07 03:48:22,616 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-07 03:48:22,616 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-07 03:48:22,616 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-07 03:48:22,616 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 03:48:22,617 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-07 03:48:22,617 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-07 03:48:22,617 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-07 03:48:22,617 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-07 03:48:22,617 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-07 03:48:22,617 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-07 03:48:22,618 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-07 03:48:22,618 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-07 03:48:22,618 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-07 03:48:22,618 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-07 03:48:22,618 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-07 03:48:22,618 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-07 03:48:22,619 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-07 03:48:22,619 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-07 03:48:22,619 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-07 03:48:22,619 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-07 03:48:22,619 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-07 03:48:22,619 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-07 03:48:22,619 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-07 03:48:22,620 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-07 03:48:22,620 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-07 03:48:22,620 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-07 03:48:22,620 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-07 03:48:22,620 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-07 03:48:22,620 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-07 03:48:22,621 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-07 03:48:22,621 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-07 03:48:22,621 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-07 03:48:22,621 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-07 03:48:22,621 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-07 03:48:22,621 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-07 03:48:22,621 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-07 03:48:22,621 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-07 03:48:22,621 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-07 03:48:22,622 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-07 03:48:22,622 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-07 03:48:22,622 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-07 03:48:22,622 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-07 03:48:22,622 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-07 03:48:22,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 03:48:22,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 03:48:22,622 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 03:48:22,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 03:48:22,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 03:48:22,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 03:48:22,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 03:48:22,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 03:48:22,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 03:48:22,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 03:48:22,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 03:48:23,623 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 03:48:23,623 INFO L284 CfgBuilder]: Removed 17 assume(true) statements. [2019-10-07 03:48:23,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:48:23 BoogieIcfgContainer [2019-10-07 03:48:23,625 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 03:48:23,626 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 03:48:23,626 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 03:48:23,630 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 03:48:23,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:48:21" (1/3) ... [2019-10-07 03:48:23,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a054782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:48:23, skipping insertion in model container [2019-10-07 03:48:23,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:22" (2/3) ... [2019-10-07 03:48:23,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a054782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:48:23, skipping insertion in model container [2019-10-07 03:48:23,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:48:23" (3/3) ... [2019-10-07 03:48:23,634 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-1.i [2019-10-07 03:48:23,645 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 03:48:23,652 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-10-07 03:48:23,665 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-10-07 03:48:23,699 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 03:48:23,702 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 03:48:23,703 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 03:48:23,703 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 03:48:23,703 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 03:48:23,703 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 03:48:23,704 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 03:48:23,705 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 03:48:23,726 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-10-07 03:48:23,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-07 03:48:23,733 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:23,734 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:23,736 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:23,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:23,741 INFO L82 PathProgramCache]: Analyzing trace with hash 299738079, now seen corresponding path program 1 times [2019-10-07 03:48:23,751 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:23,751 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:23,752 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:23,752 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:23,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:23,915 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 03:48:23,916 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:23,917 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:23,917 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-07 03:48:23,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-07 03:48:23,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-07 03:48:23,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 03:48:23,937 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-10-07 03:48:23,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:23,961 INFO L93 Difference]: Finished difference Result 89 states and 139 transitions. [2019-10-07 03:48:23,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-07 03:48:23,962 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-10-07 03:48:23,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:23,971 INFO L225 Difference]: With dead ends: 89 [2019-10-07 03:48:23,972 INFO L226 Difference]: Without dead ends: 43 [2019-10-07 03:48:23,990 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 03:48:24,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-07 03:48:24,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-10-07 03:48:24,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-07 03:48:24,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2019-10-07 03:48:24,030 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 9 [2019-10-07 03:48:24,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:24,031 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2019-10-07 03:48:24,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-07 03:48:24,031 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2019-10-07 03:48:24,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-07 03:48:24,032 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:24,032 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:24,033 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:24,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:24,033 INFO L82 PathProgramCache]: Analyzing trace with hash 644598331, now seen corresponding path program 1 times [2019-10-07 03:48:24,033 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:24,033 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:24,034 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:24,034 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:24,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:24,269 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 03:48:24,270 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:24,270 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:24,270 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 03:48:24,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 03:48:24,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 03:48:24,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:48:24,273 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 4 states. [2019-10-07 03:48:24,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:24,444 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2019-10-07 03:48:24,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 03:48:24,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-07 03:48:24,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:24,446 INFO L225 Difference]: With dead ends: 43 [2019-10-07 03:48:24,446 INFO L226 Difference]: Without dead ends: 41 [2019-10-07 03:48:24,448 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:48:24,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-07 03:48:24,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-10-07 03:48:24,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-07 03:48:24,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-10-07 03:48:24,460 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 10 [2019-10-07 03:48:24,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:24,461 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-10-07 03:48:24,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 03:48:24,461 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-10-07 03:48:24,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-07 03:48:24,461 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:24,462 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:24,462 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:24,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:24,462 INFO L82 PathProgramCache]: Analyzing trace with hash 639051341, now seen corresponding path program 1 times [2019-10-07 03:48:24,463 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:24,463 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:24,463 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:24,464 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:24,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:24,551 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 03:48:24,551 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:24,551 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:24,552 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 03:48:24,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 03:48:24,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 03:48:24,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:48:24,555 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 4 states. [2019-10-07 03:48:24,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:24,742 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-10-07 03:48:24,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 03:48:24,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-07 03:48:24,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:24,746 INFO L225 Difference]: With dead ends: 44 [2019-10-07 03:48:24,746 INFO L226 Difference]: Without dead ends: 40 [2019-10-07 03:48:24,747 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:48:24,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-07 03:48:24,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-10-07 03:48:24,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-07 03:48:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2019-10-07 03:48:24,753 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2019-10-07 03:48:24,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:24,754 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2019-10-07 03:48:24,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 03:48:24,754 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2019-10-07 03:48:24,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 03:48:24,755 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:24,755 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:24,755 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:24,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:24,756 INFO L82 PathProgramCache]: Analyzing trace with hash 434039850, now seen corresponding path program 1 times [2019-10-07 03:48:24,756 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:24,756 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:24,756 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:24,756 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:24,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:24,895 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 03:48:24,895 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:24,895 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:24,896 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 03:48:24,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 03:48:24,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 03:48:24,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:48:24,897 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2019-10-07 03:48:25,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:25,412 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-10-07 03:48:25,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 03:48:25,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-07 03:48:25,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:25,414 INFO L225 Difference]: With dead ends: 37 [2019-10-07 03:48:25,414 INFO L226 Difference]: Without dead ends: 35 [2019-10-07 03:48:25,415 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:48:25,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-07 03:48:25,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-10-07 03:48:25,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-07 03:48:25,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-10-07 03:48:25,424 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 13 [2019-10-07 03:48:25,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:25,427 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-10-07 03:48:25,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 03:48:25,427 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-10-07 03:48:25,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 03:48:25,428 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:25,428 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:25,428 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:25,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:25,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1607525391, now seen corresponding path program 1 times [2019-10-07 03:48:25,429 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:25,431 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:25,431 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:25,431 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:25,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:25,582 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 03:48:25,583 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:25,583 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:25,584 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 03:48:25,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:48:25,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:48:25,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:48:25,585 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2019-10-07 03:48:26,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:26,211 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2019-10-07 03:48:26,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 03:48:26,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-07 03:48:26,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:26,213 INFO L225 Difference]: With dead ends: 60 [2019-10-07 03:48:26,214 INFO L226 Difference]: Without dead ends: 58 [2019-10-07 03:48:26,214 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-07 03:48:26,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-07 03:48:26,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 42. [2019-10-07 03:48:26,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-07 03:48:26,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-10-07 03:48:26,223 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 13 [2019-10-07 03:48:26,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:26,223 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-10-07 03:48:26,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:48:26,224 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-10-07 03:48:26,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-07 03:48:26,224 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:26,225 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:26,225 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:26,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:26,225 INFO L82 PathProgramCache]: Analyzing trace with hash -2116307816, now seen corresponding path program 1 times [2019-10-07 03:48:26,225 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:26,226 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:26,226 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:26,226 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:26,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:26,312 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 03:48:26,312 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:26,312 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:26,313 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 03:48:26,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:48:26,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:48:26,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:48:26,314 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 5 states. [2019-10-07 03:48:26,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:26,671 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2019-10-07 03:48:26,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 03:48:26,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-07 03:48:26,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:26,673 INFO L225 Difference]: With dead ends: 57 [2019-10-07 03:48:26,673 INFO L226 Difference]: Without dead ends: 45 [2019-10-07 03:48:26,674 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 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 03:48:26,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-07 03:48:26,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-10-07 03:48:26,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-07 03:48:26,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-10-07 03:48:26,680 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 17 [2019-10-07 03:48:26,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:26,680 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-10-07 03:48:26,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:48:26,680 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-10-07 03:48:26,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-07 03:48:26,681 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:26,681 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:26,682 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:26,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:26,682 INFO L82 PathProgramCache]: Analyzing trace with hash 17922409, now seen corresponding path program 1 times [2019-10-07 03:48:26,682 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:26,683 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:26,683 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:26,683 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:26,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:26,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:48:26,743 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:26,743 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:48:26,743 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 03:48:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:26,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-07 03:48:26,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:48:26,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:48:26,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:48:26,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:48:26,986 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-10-07 03:48:26,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:27,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:27,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:48:27,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:48:27,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:48:27,020 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-10-07 03:48:27,021 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:27,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:27,039 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 03:48:27,039 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:36 [2019-10-07 03:48:27,115 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-10-07 03:48:27,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:27,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:27,134 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:27,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-10-07 03:48:27,135 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:27,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:27,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 03:48:27,141 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2019-10-07 03:48:27,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:48:27,145 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:48:27,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:48:27,163 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 03:48:27,195 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-07 03:48:27,196 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 03:48:27,204 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 03:48:27,213 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 03:48:27,214 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 03:48:27,316 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-07 03:48:27,560 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 03:48:27,571 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 03:48:27,571 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 03:48:27,572 INFO L193 IcfgInterpreter]: Reachable states at location mainErr5ASSERT_VIOLATIONERROR_FUNCTION satisfy 2#false [2019-10-07 03:48:27,572 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 127#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 03:48:27,572 INFO L193 IcfgInterpreter]: Reachable states at location L1002-1 satisfy 43#(and (<= 0 (+ |main_#t~nondet1| 2147483648)) (exists ((v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_1) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|))) (<= |main_#t~nondet1| 2147483647)) [2019-10-07 03:48:27,572 INFO L193 IcfgInterpreter]: Reachable states at location L1033 satisfy 68#(or (and (not (= main_~end~0.offset 0)) (exists ((v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_1) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|))) (= |main_#t~mem11| (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)))) (and (not (= 0 main_~end~0.base)) (exists ((v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_1) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|))) (= |main_#t~mem11| (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))))) [2019-10-07 03:48:27,573 INFO L193 IcfgInterpreter]: Reachable states at location L1034-1 satisfy 104#(or (exists ((v_prenex_7 Int) (v_prenex_2 Int) (v_prenex_1 Int) (v_prenex_10 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (or (and (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_1) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (not (= ~unnamed1~0~RED (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8)))) (not (= 0 main_~list~0.base)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_prenex_2) (+ main_~list~0.offset 4) v_prenex_1) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (not (= ~unnamed1~0~RED (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8)))) (not (= main_~list~0.offset 0)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (not (= ~unnamed1~0~RED (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8)))) (not (= 0 main_~list~0.base)) (not (= main_~list~0.offset 0)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))) (= |main_#t~malloc0.base| main_~list~0.base) (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_prenex_8) (+ main_~list~0.offset 4) v_prenex_7) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (and (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_prenex_9) (+ main_~list~0.offset 4) v_prenex_10) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (not (= ~unnamed1~0~RED (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8)))) (not (= 0 main_~list~0.base)) (not (= main_~list~0.offset 0)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))))) (exists ((v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (or (and (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_1) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))) (not (= 0 main_~end~0.base)) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)) (and (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_1) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (not (= main_~end~0.offset 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|))))) [2019-10-07 03:48:27,577 INFO L193 IcfgInterpreter]: Reachable states at location L1025-4 satisfy 38#(exists ((v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_1) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|))) [2019-10-07 03:48:27,577 INFO L193 IcfgInterpreter]: Reachable states at location L1002-3 satisfy 48#(exists ((v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_1) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|))) [2019-10-07 03:48:27,578 INFO L193 IcfgInterpreter]: Reachable states at location L1033-3 satisfy 73#(exists ((v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (or (and (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_1) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))) (not (= 0 main_~end~0.base)) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)) (and (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_1) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (not (= main_~end~0.offset 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)))) [2019-10-07 03:48:27,578 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 03:48:27,578 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 03:48:27,579 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 132#(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 03:48:27,579 INFO L193 IcfgInterpreter]: Reachable states at location L1032-3 satisfy 58#(or (and (not (= main_~end~0.offset 0)) (exists ((v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_1) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)))) (and (not (= 0 main_~end~0.base)) (exists ((v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_1) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|))))) [2019-10-07 03:48:27,579 INFO L193 IcfgInterpreter]: Reachable states at location L1033-4 satisfy 63#(or (and (not (= main_~end~0.offset 0)) (exists ((v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_1) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)))) (and (not (= 0 main_~end~0.base)) (exists ((v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_1) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|))))) [2019-10-07 03:48:27,579 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 03:48:27,580 INFO L193 IcfgInterpreter]: Reachable states at location L1032-4 satisfy 53#(exists ((v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (and (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_1) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|))) [2019-10-07 03:48:27,580 INFO L193 IcfgInterpreter]: Reachable states at location L1039-1 satisfy 2#false [2019-10-07 03:48:27,580 INFO L193 IcfgInterpreter]: Reachable states at location L1036 satisfy 113#true [2019-10-07 03:48:27,581 INFO L193 IcfgInterpreter]: Reachable states at location L1036-1 satisfy 99#(exists ((v_prenex_2 Int) (v_prenex_1 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (or (and (not (= main_~end~0.offset 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))) (= main_~list~0.base main_~end~0.base) (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_prenex_2) (+ main_~list~0.offset 4) v_prenex_1) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (not (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)) ~unnamed1~0~RED)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)) (and (not (= main_~end~0.offset 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))) (not (= 0 main_~end~0.base)) (= main_~list~0.base main_~end~0.base) (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_prenex_2) (+ main_~list~0.offset 4) v_prenex_1) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (not (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)) ~unnamed1~0~RED)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)) (and (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_1) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (not (= main_~end~0.offset 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))) (not (= 0 main_~end~0.base)) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (not (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)) ~unnamed1~0~RED)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)) (and (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_1) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))) (not (= 0 main_~end~0.base)) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~list~0.offset main_~end~0.offset) (not (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)) ~unnamed1~0~RED)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)))) [2019-10-07 03:48:27,581 INFO L193 IcfgInterpreter]: Reachable states at location L1039-4 satisfy 123#(or (exists ((v_prenex_7 Int) (v_prenex_2 Int) (v_prenex_1 Int) (v_prenex_10 Int) (v_DerPreprocessor_2 Int) (v_prenex_8 Int) (v_DerPreprocessor_1 Int) (v_prenex_9 Int)) (or (and (= 0 |#NULL.base|) (= 0 |main_#t~malloc0.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) main_~end~0.base) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (not (= ~unnamed1~0~RED (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8)))) (not (= main_~list~0.offset 0)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|) (<= |#NULL.base| 0) (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_prenex_2) (+ main_~list~0.offset 4) v_prenex_1) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 8)) ~unnamed1~0~RED) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (not (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 0)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0)) (and (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_prenex_9) (+ main_~list~0.offset 4) v_prenex_10) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (= 0 |#NULL.base|) (= 0 |main_#t~malloc0.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) main_~end~0.base) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (not (= ~unnamed1~0~RED (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8)))) (not (= main_~list~0.offset 0)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|) (<= |#NULL.base| 0) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (not (= 0 main_~list~0.base)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 8)) ~unnamed1~0~RED) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (not (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 0)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0)) (and (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_prenex_9) (+ main_~list~0.offset 4) v_prenex_10) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (= 0 |#NULL.base|) (= 0 |main_#t~malloc0.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) main_~end~0.base) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (not (= ~unnamed1~0~RED (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8)))) (not (= main_~list~0.offset 0)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|) (<= |#NULL.base| 0) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (not (= 0 main_~list~0.base)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 8)) ~unnamed1~0~RED) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0)) (and (= 0 |#NULL.base|) (= 0 |main_#t~malloc0.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) main_~end~0.base) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (not (= ~unnamed1~0~RED (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8)))) (not (= main_~list~0.offset 0)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))) (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_prenex_8) (+ main_~list~0.offset 4) v_prenex_7) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|) (<= |#NULL.base| 0) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (not (= 0 main_~list~0.base)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 8)) ~unnamed1~0~RED) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (not (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 0)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0)) (and (= 0 |#NULL.base|) (= 0 |main_#t~malloc0.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) main_~end~0.base) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (not (= ~unnamed1~0~RED (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8)))) (= main_~list~0.offset |main_#t~malloc0.offset|) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|) (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_1) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (<= |#NULL.base| 0) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (not (= 0 main_~list~0.base)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 8)) ~unnamed1~0~RED) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0)) (and (= 0 |#NULL.base|) (= 0 |main_#t~malloc0.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) main_~end~0.base) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (not (= ~unnamed1~0~RED (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8)))) (= main_~list~0.offset |main_#t~malloc0.offset|) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|) (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_1) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (<= |#NULL.base| 0) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (not (= 0 main_~list~0.base)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 8)) ~unnamed1~0~RED) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (not (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 0)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0)) (and (= 0 |#NULL.base|) (= 0 |main_#t~malloc0.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) main_~end~0.base) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (not (= ~unnamed1~0~RED (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8)))) (not (= main_~list~0.offset 0)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|) (<= |#NULL.base| 0) (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_prenex_2) (+ main_~list~0.offset 4) v_prenex_1) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 8)) ~unnamed1~0~RED) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0)) (and (= 0 |#NULL.base|) (= 0 |main_#t~malloc0.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) main_~end~0.base) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (not (= ~unnamed1~0~RED (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8)))) (not (= main_~list~0.offset 0)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))) (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_prenex_8) (+ main_~list~0.offset 4) v_prenex_7) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|) (<= |#NULL.base| 0) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (not (= 0 main_~list~0.base)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 8)) ~unnamed1~0~RED) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= |#NULL.offset| 0)))) (exists ((v_prenex_12 Int) (v_prenex_11 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (or (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (= ~unnamed1~0~RED (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (not (= main_~list~0.offset 0)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_prenex_12) (+ main_~list~0.offset 4) v_prenex_11) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (= ~unnamed1~0~RED (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (not (= 0 main_~list~0.base)) (not (= main_~list~0.offset 0)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_prenex_12) (+ main_~list~0.offset 4) v_prenex_11) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (and (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_1) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (= ~unnamed1~0~RED (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (not (= 0 main_~list~0.base)) (not (= main_~list~0.offset 0)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (and (= (store |old(#memory_int)| main_~list~0.base (store (store (store (select |old(#memory_int)| main_~list~0.base) main_~list~0.offset v_DerPreprocessor_1) (+ main_~list~0.offset 4) v_DerPreprocessor_2) (+ main_~list~0.offset 8) ~unnamed1~0~BLACK)) |#memory_int|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 |main_#t~malloc0.offset|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) |#memory_$Pointer$.offset|) (= ~unnamed1~0~RED (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (not (= 0 main_~list~0.base)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0) (+ main_~list~0.offset 8) (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))))) [2019-10-07 03:48:28,409 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-07 03:48:28,409 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5, 5, 5] total 15 [2019-10-07 03:48:28,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-07 03:48:28,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-07 03:48:28,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-10-07 03:48:28,411 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 10 states. [2019-10-07 03:48:29,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:29,414 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-10-07 03:48:29,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-07 03:48:29,414 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-10-07 03:48:29,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:29,415 INFO L225 Difference]: With dead ends: 50 [2019-10-07 03:48:29,415 INFO L226 Difference]: Without dead ends: 24 [2019-10-07 03:48:29,416 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-10-07 03:48:29,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-07 03:48:29,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-07 03:48:29,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-07 03:48:29,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-10-07 03:48:29,420 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 20 [2019-10-07 03:48:29,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:29,420 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-10-07 03:48:29,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-07 03:48:29,421 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-10-07 03:48:29,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-07 03:48:29,421 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:29,421 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:29,627 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:48:29,627 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:29,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:29,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1465232090, now seen corresponding path program 1 times [2019-10-07 03:48:29,628 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:29,628 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:29,628 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:29,628 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:29,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:30,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:48:30,027 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:30,027 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:48:30,027 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 03:48:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:30,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-07 03:48:30,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:48:59,743 WARN L191 SmtUtils]: Spent 27.78 s on a formula simplification that was a NOOP. DAG size: 209 [2019-10-07 03:49:31,108 WARN L191 SmtUtils]: Spent 27.42 s on a formula simplification that was a NOOP. DAG size: 206 [2019-10-07 03:49:54,550 WARN L191 SmtUtils]: Spent 22.84 s on a formula simplification that was a NOOP. DAG size: 198 [2019-10-07 03:50:11,716 WARN L191 SmtUtils]: Spent 16.96 s on a formula simplification that was a NOOP. DAG size: 190 [2019-10-07 03:50:22,222 WARN L191 SmtUtils]: Spent 10.30 s on a formula simplification that was a NOOP. DAG size: 182 [2019-10-07 03:50:32,496 WARN L191 SmtUtils]: Spent 9.90 s on a formula simplification that was a NOOP. DAG size: 174 [2019-10-07 03:50:40,190 WARN L191 SmtUtils]: Spent 7.59 s on a formula simplification that was a NOOP. DAG size: 170 [2019-10-07 03:50:46,706 WARN L191 SmtUtils]: Spent 6.49 s on a formula simplification that was a NOOP. DAG size: 167 [2019-10-07 03:50:53,242 WARN L191 SmtUtils]: Spent 6.48 s on a formula simplification that was a NOOP. DAG size: 164 [2019-10-07 03:50:59,312 WARN L191 SmtUtils]: Spent 5.93 s on a formula simplification that was a NOOP. DAG size: 161 [2019-10-07 03:51:05,685 WARN L191 SmtUtils]: Spent 6.32 s on a formula simplification that was a NOOP. DAG size: 158 [2019-10-07 03:51:10,523 WARN L191 SmtUtils]: Spent 4.81 s on a formula simplification that was a NOOP. DAG size: 154 [2019-10-07 03:51:16,235 WARN L191 SmtUtils]: Spent 5.66 s on a formula simplification that was a NOOP. DAG size: 151 [2019-10-07 03:51:20,849 WARN L191 SmtUtils]: Spent 3.63 s on a formula simplification that was a NOOP. DAG size: 145 [2019-10-07 03:51:21,382 WARN L191 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-10-07 03:51:25,450 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 163 DAG size of output: 144 [2019-10-07 03:51:26,630 WARN L191 SmtUtils]: Spent 986.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-10-07 03:51:27,026 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-10-07 03:51:27,779 WARN L191 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 128 [2019-10-07 03:51:28,034 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-10-07 03:51:28,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:51:28,549 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:51:42,451 WARN L191 SmtUtils]: Spent 13.16 s on a formula simplification that was a NOOP. DAG size: 213 [2019-10-07 03:51:54,210 WARN L191 SmtUtils]: Spent 11.48 s on a formula simplification that was a NOOP. DAG size: 204 [2019-10-07 03:52:00,796 WARN L191 SmtUtils]: Spent 6.33 s on a formula simplification that was a NOOP. DAG size: 195 [2019-10-07 03:52:05,318 WARN L191 SmtUtils]: Spent 4.11 s on a formula simplification that was a NOOP. DAG size: 186 [2019-10-07 03:52:08,607 WARN L191 SmtUtils]: Spent 3.13 s on a formula simplification that was a NOOP. DAG size: 182 [2019-10-07 03:52:13,329 WARN L191 SmtUtils]: Spent 4.51 s on a formula simplification that was a NOOP. DAG size: 178 [2019-10-07 03:52:16,889 WARN L191 SmtUtils]: Spent 3.52 s on a formula simplification that was a NOOP. DAG size: 174 [2019-10-07 03:52:19,780 WARN L191 SmtUtils]: Spent 2.71 s on a formula simplification that was a NOOP. DAG size: 170 [2019-10-07 03:52:23,812 WARN L191 SmtUtils]: Spent 4.00 s on a formula simplification that was a NOOP. DAG size: 166 [2019-10-07 03:52:26,877 WARN L191 SmtUtils]: Spent 3.04 s on a formula simplification that was a NOOP. DAG size: 162 [2019-10-07 03:52:29,848 WARN L191 SmtUtils]: Spent 2.96 s on a formula simplification that was a NOOP. DAG size: 157 [2019-10-07 03:52:31,057 WARN L191 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 152 [2019-10-07 03:52:31,788 WARN L191 SmtUtils]: Spent 721.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2019-10-07 03:52:32,088 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 68 [2019-10-07 03:52:32,358 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:52:32,360 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) 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.doElimOneRec(ElimStorePlain.java:256) 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 03:52:32,365 INFO L168 Benchmark]: Toolchain (without parser) took 250588.61 ms. Allocated memory was 137.4 MB in the beginning and 292.6 MB in the end (delta: 155.2 MB). Free memory was 99.3 MB in the beginning and 146.7 MB in the end (delta: -47.4 MB). Peak memory consumption was 184.2 MB. Max. memory is 7.1 GB. [2019-10-07 03:52:32,365 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory was 119.4 MB in the beginning and 119.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 03:52:32,366 INFO L168 Benchmark]: CACSL2BoogieTranslator took 679.69 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 99.1 MB in the beginning and 167.5 MB in the end (delta: -68.4 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2019-10-07 03:52:32,366 INFO L168 Benchmark]: Boogie Preprocessor took 79.60 ms. Allocated memory is still 201.3 MB. Free memory was 167.5 MB in the beginning and 164.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-10-07 03:52:32,367 INFO L168 Benchmark]: RCFGBuilder took 1084.12 ms. Allocated memory is still 201.3 MB. Free memory was 164.8 MB in the beginning and 104.0 MB in the end (delta: 60.7 MB). Peak memory consumption was 60.7 MB. Max. memory is 7.1 GB. [2019-10-07 03:52:32,368 INFO L168 Benchmark]: TraceAbstraction took 248737.00 ms. Allocated memory was 201.3 MB in the beginning and 292.6 MB in the end (delta: 91.2 MB). Free memory was 104.0 MB in the beginning and 146.7 MB in the end (delta: -42.7 MB). Peak memory consumption was 125.0 MB. Max. memory is 7.1 GB. [2019-10-07 03:52:32,371 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 137.4 MB. Free memory was 119.4 MB in the beginning and 119.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 679.69 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 99.1 MB in the beginning and 167.5 MB in the end (delta: -68.4 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 79.60 ms. Allocated memory is still 201.3 MB. Free memory was 167.5 MB in the beginning and 164.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1084.12 ms. Allocated memory is still 201.3 MB. Free memory was 164.8 MB in the beginning and 104.0 MB in the end (delta: 60.7 MB). Peak memory consumption was 60.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 248737.00 ms. Allocated memory was 201.3 MB in the beginning and 292.6 MB in the end (delta: 91.2 MB). Free memory was 104.0 MB in the beginning and 146.7 MB in the end (delta: -42.7 MB). Peak memory consumption was 125.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...