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/sll-01-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 03:48:45,517 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 03:48:45,519 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 03:48:45,531 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 03:48:45,531 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 03:48:45,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 03:48:45,534 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 03:48:45,536 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 03:48:45,538 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 03:48:45,539 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 03:48:45,540 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 03:48:45,541 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 03:48:45,541 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 03:48:45,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 03:48:45,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 03:48:45,545 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 03:48:45,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 03:48:45,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 03:48:45,548 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 03:48:45,551 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 03:48:45,553 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 03:48:45,554 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 03:48:45,555 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 03:48:45,556 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 03:48:45,559 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 03:48:45,559 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 03:48:45,559 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 03:48:45,560 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 03:48:45,561 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 03:48:45,562 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 03:48:45,562 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 03:48:45,563 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 03:48:45,564 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 03:48:45,565 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 03:48:45,566 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 03:48:45,566 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 03:48:45,567 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 03:48:45,567 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 03:48:45,567 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 03:48:45,568 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 03:48:45,569 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 03:48:45,570 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:45,599 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 03:48:45,599 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 03:48:45,601 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 03:48:45,601 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 03:48:45,601 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 03:48:45,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 03:48:45,602 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 03:48:45,602 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 03:48:45,602 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 03:48:45,602 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 03:48:45,602 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 03:48:45,603 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 03:48:45,603 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 03:48:45,603 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 03:48:45,603 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 03:48:45,603 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 03:48:45,604 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 03:48:45,604 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 03:48:45,604 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 03:48:45,604 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 03:48:45,604 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 03:48:45,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 03:48:45,605 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 03:48:45,605 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 03:48:45,605 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 03:48:45,605 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 03:48:45,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 03:48:45,606 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 03:48:45,606 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:45,883 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 03:48:45,897 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 03:48:45,901 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 03:48:45,903 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 03:48:45,903 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 03:48:45,904 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01-1.i [2019-10-07 03:48:45,990 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f89a9adc9/152f9726dc4b4526bb1b2e85efc34093/FLAG2d044158f [2019-10-07 03:48:46,601 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 03:48:46,602 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i [2019-10-07 03:48:46,617 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f89a9adc9/152f9726dc4b4526bb1b2e85efc34093/FLAG2d044158f [2019-10-07 03:48:46,873 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f89a9adc9/152f9726dc4b4526bb1b2e85efc34093 [2019-10-07 03:48:46,884 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 03:48:46,886 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 03:48:46,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 03:48:46,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 03:48:46,891 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 03:48:46,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:48:46" (1/1) ... [2019-10-07 03:48:46,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4da2b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:46, skipping insertion in model container [2019-10-07 03:48:46,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:48:46" (1/1) ... [2019-10-07 03:48:46,905 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 03:48:46,973 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 03:48:47,508 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:48:47,517 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 03:48:47,584 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:48:47,629 INFO L192 MainTranslator]: Completed translation [2019-10-07 03:48:47,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:47 WrapperNode [2019-10-07 03:48:47,629 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 03:48:47,630 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 03:48:47,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 03:48:47,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 03:48:47,645 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:47" (1/1) ... [2019-10-07 03:48:47,646 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:47" (1/1) ... [2019-10-07 03:48:47,663 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:47" (1/1) ... [2019-10-07 03:48:47,664 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:47" (1/1) ... [2019-10-07 03:48:47,684 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:47" (1/1) ... [2019-10-07 03:48:47,696 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:47" (1/1) ... [2019-10-07 03:48:47,700 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:47" (1/1) ... [2019-10-07 03:48:47,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 03:48:47,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 03:48:47,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 03:48:47,709 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 03:48:47,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:47" (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:47,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 03:48:47,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 03:48:47,778 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 03:48:47,779 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-07 03:48:47,779 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-07 03:48:47,780 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-07 03:48:47,781 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-07 03:48:47,781 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-07 03:48:47,781 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-07 03:48:47,781 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-07 03:48:47,782 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-07 03:48:47,783 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-07 03:48:47,783 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-07 03:48:47,783 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-07 03:48:47,783 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-07 03:48:47,783 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-07 03:48:47,786 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-07 03:48:47,786 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-07 03:48:47,786 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-07 03:48:47,786 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-07 03:48:47,787 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-07 03:48:47,787 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-07 03:48:47,787 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-07 03:48:47,787 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-07 03:48:47,787 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-07 03:48:47,787 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-07 03:48:47,788 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-07 03:48:47,788 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-07 03:48:47,788 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-07 03:48:47,788 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-07 03:48:47,788 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-07 03:48:47,788 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-07 03:48:47,789 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-07 03:48:47,789 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-07 03:48:47,789 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-07 03:48:47,789 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-07 03:48:47,789 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-07 03:48:47,789 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-07 03:48:47,789 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-07 03:48:47,790 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-07 03:48:47,790 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-07 03:48:47,790 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-07 03:48:47,790 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-07 03:48:47,790 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-07 03:48:47,790 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-07 03:48:47,791 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-07 03:48:47,791 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-07 03:48:47,791 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-07 03:48:47,791 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-07 03:48:47,791 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-07 03:48:47,791 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-07 03:48:47,791 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-07 03:48:47,792 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-07 03:48:47,792 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 03:48:47,792 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-07 03:48:47,792 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-07 03:48:47,792 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-07 03:48:47,792 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-07 03:48:47,793 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-07 03:48:47,793 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-07 03:48:47,793 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-07 03:48:47,793 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-07 03:48:47,793 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-07 03:48:47,793 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-07 03:48:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-07 03:48:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-07 03:48:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 03:48:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-07 03:48:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-07 03:48:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-07 03:48:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-07 03:48:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-07 03:48:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-07 03:48:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-07 03:48:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-07 03:48:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-07 03:48:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-07 03:48:47,796 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-07 03:48:47,796 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-07 03:48:47,796 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-07 03:48:47,796 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-07 03:48:47,796 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-07 03:48:47,796 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-07 03:48:47,797 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-07 03:48:47,797 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-07 03:48:47,797 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-07 03:48:47,797 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-07 03:48:47,797 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-07 03:48:47,797 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-07 03:48:47,797 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-07 03:48:47,798 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-07 03:48:47,798 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-07 03:48:47,798 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-07 03:48:47,798 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-07 03:48:47,798 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-07 03:48:47,798 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-07 03:48:47,799 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-07 03:48:47,799 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-07 03:48:47,799 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-07 03:48:47,799 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-07 03:48:47,799 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-07 03:48:47,799 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-07 03:48:47,799 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-07 03:48:47,800 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-07 03:48:47,800 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-07 03:48:47,800 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-07 03:48:47,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 03:48:47,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 03:48:47,800 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 03:48:47,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 03:48:47,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 03:48:47,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 03:48:47,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 03:48:47,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 03:48:47,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 03:48:48,646 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 03:48:48,647 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-10-07 03:48:48,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:48:48 BoogieIcfgContainer [2019-10-07 03:48:48,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 03:48:48,650 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 03:48:48,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 03:48:48,653 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 03:48:48,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:48:46" (1/3) ... [2019-10-07 03:48:48,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce75a79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:48:48, skipping insertion in model container [2019-10-07 03:48:48,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:47" (2/3) ... [2019-10-07 03:48:48,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce75a79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:48:48, skipping insertion in model container [2019-10-07 03:48:48,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:48:48" (3/3) ... [2019-10-07 03:48:48,657 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-01-1.i [2019-10-07 03:48:48,668 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 03:48:48,677 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-10-07 03:48:48,689 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-10-07 03:48:48,714 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 03:48:48,714 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 03:48:48,714 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 03:48:48,715 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 03:48:48,715 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 03:48:48,715 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 03:48:48,715 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 03:48:48,715 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 03:48:48,737 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-10-07 03:48:48,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-10-07 03:48:48,744 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:48,745 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:48,748 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:48,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:48,761 INFO L82 PathProgramCache]: Analyzing trace with hash -445938275, now seen corresponding path program 1 times [2019-10-07 03:48:48,769 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:48,770 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:48,770 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:48,770 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:48,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:48,992 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:48,993 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:48,993 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:48,993 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 03:48:48,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 03:48:49,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 03:48:49,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:48:49,015 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 3 states. [2019-10-07 03:48:49,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:49,087 INFO L93 Difference]: Finished difference Result 171 states and 270 transitions. [2019-10-07 03:48:49,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 03:48:49,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-10-07 03:48:49,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:49,102 INFO L225 Difference]: With dead ends: 171 [2019-10-07 03:48:49,103 INFO L226 Difference]: Without dead ends: 93 [2019-10-07 03:48:49,108 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:48:49,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-07 03:48:49,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2019-10-07 03:48:49,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-07 03:48:49,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-10-07 03:48:49,192 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 7 [2019-10-07 03:48:49,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:49,193 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-10-07 03:48:49,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 03:48:49,193 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2019-10-07 03:48:49,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 03:48:49,194 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:49,195 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:49,195 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:49,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:49,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1700846502, now seen corresponding path program 1 times [2019-10-07 03:48:49,197 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:49,197 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:49,197 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:49,197 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:49,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:49,317 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:49,318 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:49,318 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:49,318 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 03:48:49,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 03:48:49,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 03:48:49,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:48:49,322 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 3 states. [2019-10-07 03:48:49,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:49,333 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-10-07 03:48:49,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 03:48:49,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-07 03:48:49,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:49,335 INFO L225 Difference]: With dead ends: 75 [2019-10-07 03:48:49,336 INFO L226 Difference]: Without dead ends: 73 [2019-10-07 03:48:49,337 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:48:49,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-07 03:48:49,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-10-07 03:48:49,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-07 03:48:49,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-10-07 03:48:49,345 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 11 [2019-10-07 03:48:49,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:49,345 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-10-07 03:48:49,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 03:48:49,346 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-10-07 03:48:49,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-07 03:48:49,346 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:49,347 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:49,347 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:49,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:49,347 INFO L82 PathProgramCache]: Analyzing trace with hash 458096093, now seen corresponding path program 1 times [2019-10-07 03:48:49,348 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:49,348 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:49,348 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:49,348 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:49,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:49,443 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:49,443 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:49,443 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:49,444 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 03:48:49,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 03:48:49,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 03:48:49,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:48:49,445 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 3 states. [2019-10-07 03:48:49,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:49,500 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2019-10-07 03:48:49,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 03:48:49,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-07 03:48:49,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:49,502 INFO L225 Difference]: With dead ends: 76 [2019-10-07 03:48:49,502 INFO L226 Difference]: Without dead ends: 72 [2019-10-07 03:48:49,503 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:48:49,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-07 03:48:49,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2019-10-07 03:48:49,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-07 03:48:49,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-10-07 03:48:49,511 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 16 [2019-10-07 03:48:49,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:49,511 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-10-07 03:48:49,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 03:48:49,512 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-10-07 03:48:49,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-07 03:48:49,512 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:49,513 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:49,513 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:49,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:49,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1316081195, now seen corresponding path program 1 times [2019-10-07 03:48:49,514 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:49,514 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:49,514 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:49,514 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:49,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:49,596 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:49,597 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:49,597 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:49,597 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 03:48:49,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:48:49,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:48:49,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:48:49,598 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 5 states. [2019-10-07 03:48:49,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:49,711 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2019-10-07 03:48:49,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 03:48:49,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-07 03:48:49,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:49,714 INFO L225 Difference]: With dead ends: 127 [2019-10-07 03:48:49,714 INFO L226 Difference]: Without dead ends: 107 [2019-10-07 03:48:49,715 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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:49,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-07 03:48:49,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 68. [2019-10-07 03:48:49,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-07 03:48:49,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-10-07 03:48:49,724 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 17 [2019-10-07 03:48:49,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:49,724 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-10-07 03:48:49,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:48:49,724 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-10-07 03:48:49,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 03:48:49,725 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:49,725 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:49,726 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:49,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:49,726 INFO L82 PathProgramCache]: Analyzing trace with hash 247185224, now seen corresponding path program 1 times [2019-10-07 03:48:49,727 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:49,727 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:49,727 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:49,727 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:49,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:49,773 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:49,774 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:49,774 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:49,774 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 03:48:49,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 03:48:49,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 03:48:49,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:48:49,775 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 3 states. [2019-10-07 03:48:49,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:49,790 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2019-10-07 03:48:49,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 03:48:49,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-07 03:48:49,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:49,792 INFO L225 Difference]: With dead ends: 93 [2019-10-07 03:48:49,792 INFO L226 Difference]: Without dead ends: 91 [2019-10-07 03:48:49,793 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:48:49,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-07 03:48:49,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 70. [2019-10-07 03:48:49,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-07 03:48:49,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2019-10-07 03:48:49,801 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 21 [2019-10-07 03:48:49,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:49,801 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2019-10-07 03:48:49,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 03:48:49,802 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2019-10-07 03:48:49,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 03:48:49,803 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:49,803 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:49,803 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:49,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:49,804 INFO L82 PathProgramCache]: Analyzing trace with hash 247187244, now seen corresponding path program 1 times [2019-10-07 03:48:49,804 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:49,804 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:49,804 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:49,804 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:49,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:49,846 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:49,846 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:49,846 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:49,846 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 03:48:49,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 03:48:49,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 03:48:49,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:48:49,848 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 3 states. [2019-10-07 03:48:49,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:49,867 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2019-10-07 03:48:49,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 03:48:49,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-07 03:48:49,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:49,869 INFO L225 Difference]: With dead ends: 70 [2019-10-07 03:48:49,869 INFO L226 Difference]: Without dead ends: 68 [2019-10-07 03:48:49,869 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:48:49,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-07 03:48:49,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-10-07 03:48:49,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-07 03:48:49,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2019-10-07 03:48:49,876 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 21 [2019-10-07 03:48:49,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:49,876 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2019-10-07 03:48:49,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 03:48:49,877 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2019-10-07 03:48:49,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-07 03:48:49,877 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:49,877 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:49,878 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:49,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:49,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1873975586, now seen corresponding path program 1 times [2019-10-07 03:48:49,879 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:49,879 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:49,879 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:49,879 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:49,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:49,942 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:49,942 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:49,943 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:49,943 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 03:48:49,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 03:48:49,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 03:48:49,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:48:49,944 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 3 states. [2019-10-07 03:48:49,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:49,953 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2019-10-07 03:48:49,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 03:48:49,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-07 03:48:49,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:49,955 INFO L225 Difference]: With dead ends: 68 [2019-10-07 03:48:49,955 INFO L226 Difference]: Without dead ends: 66 [2019-10-07 03:48:49,956 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:48:49,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-07 03:48:49,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-10-07 03:48:49,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-07 03:48:49,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2019-10-07 03:48:49,972 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 22 [2019-10-07 03:48:49,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:49,973 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2019-10-07 03:48:49,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 03:48:49,973 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2019-10-07 03:48:49,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-07 03:48:49,974 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:49,974 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:49,978 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:49,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:49,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1909632269, now seen corresponding path program 1 times [2019-10-07 03:48:49,979 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:49,979 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:49,979 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:49,979 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:49,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:50,675 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:50,676 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:50,676 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:50,676 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-07 03:48:50,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-07 03:48:50,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-07 03:48:50,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-07 03:48:50,678 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 10 states. [2019-10-07 03:48:51,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:51,315 INFO L93 Difference]: Finished difference Result 151 states and 164 transitions. [2019-10-07 03:48:51,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 03:48:51,315 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-10-07 03:48:51,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:51,317 INFO L225 Difference]: With dead ends: 151 [2019-10-07 03:48:51,317 INFO L226 Difference]: Without dead ends: 149 [2019-10-07 03:48:51,318 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2019-10-07 03:48:51,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-10-07 03:48:51,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 83. [2019-10-07 03:48:51,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-07 03:48:51,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2019-10-07 03:48:51,339 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 24 [2019-10-07 03:48:51,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:51,340 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2019-10-07 03:48:51,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-07 03:48:51,341 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2019-10-07 03:48:51,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-07 03:48:51,345 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:51,345 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:51,346 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:51,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:51,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1231807495, now seen corresponding path program 1 times [2019-10-07 03:48:51,347 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:51,347 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:51,348 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:51,348 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:51,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:51,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 03:48:51,412 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:51,412 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:51,413 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 03:48:51,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 03:48:51,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 03:48:51,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:48:51,414 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 3 states. [2019-10-07 03:48:51,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:51,484 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2019-10-07 03:48:51,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 03:48:51,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-07 03:48:51,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:51,486 INFO L225 Difference]: With dead ends: 83 [2019-10-07 03:48:51,487 INFO L226 Difference]: Without dead ends: 81 [2019-10-07 03:48:51,488 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:48:51,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-07 03:48:51,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-10-07 03:48:51,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-07 03:48:51,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2019-10-07 03:48:51,504 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 27 [2019-10-07 03:48:51,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:51,506 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2019-10-07 03:48:51,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 03:48:51,506 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2019-10-07 03:48:51,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-07 03:48:51,509 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:51,509 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:51,510 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:51,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:51,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1285989278, now seen corresponding path program 1 times [2019-10-07 03:48:51,511 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:51,511 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:51,511 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:51,511 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:51,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:51,922 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:51,922 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:51,923 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:51,923 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-07 03:48:51,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-07 03:48:51,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-07 03:48:51,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-07 03:48:51,924 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 10 states. [2019-10-07 03:48:52,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:52,571 INFO L93 Difference]: Finished difference Result 154 states and 167 transitions. [2019-10-07 03:48:52,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 03:48:52,571 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-10-07 03:48:52,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:52,572 INFO L225 Difference]: With dead ends: 154 [2019-10-07 03:48:52,572 INFO L226 Difference]: Without dead ends: 152 [2019-10-07 03:48:52,573 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2019-10-07 03:48:52,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-07 03:48:52,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 88. [2019-10-07 03:48:52,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-07 03:48:52,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2019-10-07 03:48:52,579 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 27 [2019-10-07 03:48:52,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:52,580 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2019-10-07 03:48:52,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-07 03:48:52,580 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2019-10-07 03:48:52,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-07 03:48:52,581 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:52,581 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, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:52,582 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:52,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:52,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1737137716, now seen corresponding path program 1 times [2019-10-07 03:48:52,583 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:52,583 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:52,583 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:52,583 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:52,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:52,758 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:52,759 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:52,759 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:48:52,759 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:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:52,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-07 03:48:52,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:48:52,937 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-07 03:48:52,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:52,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:52,963 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-07 03:48:52,963 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:52,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:52,974 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-07 03:48:52,974 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:52,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:52,985 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 03:48:52,985 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:32, output treesize:23 [2019-10-07 03:48:53,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:48:53,021 INFO L392 ElimStorePlain]: Different costs {0=[|v_#valid_32|], 1=[v_prenex_2]} [2019-10-07 03:48:53,037 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-10-07 03:48:53,038 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:53,183 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-10-07 03:48:53,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:53,210 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:53,211 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 374 treesize of output 378 [2019-10-07 03:48:53,212 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:53,344 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-10-07 03:48:53,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:53,351 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_46|, |v_#memory_$Pointer$.offset_46|], 16=[v_prenex_1, v_prenex_3]} [2019-10-07 03:48:53,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:48:53,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2019-10-07 03:48:53,408 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:53,553 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-10-07 03:48:53,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:53,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:48:53,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2019-10-07 03:48:53,581 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:53,740 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-10-07 03:48:53,741 INFO L567 ElimStorePlain]: treesize reduction 8, result has 98.0 percent of original size [2019-10-07 03:48:53,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:48:53,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:48:53,885 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-10-07 03:48:53,886 INFO L341 Elim1Store]: treesize reduction 226, result has 38.6 percent of original size [2019-10-07 03:48:53,887 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 158 treesize of output 268 [2019-10-07 03:48:53,888 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:53,987 INFO L567 ElimStorePlain]: treesize reduction 118, result has 60.9 percent of original size [2019-10-07 03:48:53,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:48:53,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:48:54,007 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-07 03:48:54,065 INFO L341 Elim1Store]: treesize reduction 18, result has 64.7 percent of original size [2019-10-07 03:48:54,066 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 83 [2019-10-07 03:48:54,067 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:54,167 INFO L567 ElimStorePlain]: treesize reduction 16, result has 86.3 percent of original size [2019-10-07 03:48:54,168 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-07 03:48:54,169 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:424, output treesize:116 [2019-10-07 03:48:54,412 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:54,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:54,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:54,425 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:54,426 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:54,426 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:54,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:54,431 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:54,432 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2019-10-07 03:48:54,462 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:54,463 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:48:54,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:48:54,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:48:54,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:48:56,555 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_main_~list~0.offset 4))) (and (forall ((|v_main_#t~malloc2.base_7| Int)) (let ((.cse4 (+ c_main_~list~0.offset 4))) (let ((.cse0 (let ((.cse6 (store |c_#memory_$Pointer$.offset| c_main_~list~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~list~0.base) .cse4 0)))) (store .cse6 |v_main_#t~malloc2.base_7| (store (select .cse6 |v_main_#t~malloc2.base_7|) 0 0)))) (.cse3 (let ((.cse5 (store |c_#memory_$Pointer$.base| c_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) .cse4 |v_main_#t~malloc2.base_7|)))) (store .cse5 |v_main_#t~malloc2.base_7| (store (select .cse5 |v_main_#t~malloc2.base_7|) 0 0))))) (let ((.cse1 (select (select .cse3 c_main_~list~0.base) .cse4)) (.cse2 (+ (select (select .cse0 c_main_~list~0.base) .cse4) 4))) (or (not (= (select |c_#valid| |v_main_#t~malloc2.base_7|) 0)) (= |v_main_#t~malloc2.base_7| 0) (= (select (select (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 0)) c_main_~list~0.base) c_main_~list~0.offset) 0) (not (= 0 (select (select (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 0)) c_main_~list~0.base) .cse4)))))))) (= 0 (select (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) .cse7 0) c_main_~list~0.offset)) (= 0 (select (store (select |c_#memory_$Pointer$.offset| c_main_~list~0.base) .cse7 0) c_main_~list~0.offset)) (forall ((|v_main_#t~malloc2.base_7| Int)) (let ((.cse9 (+ c_main_~list~0.offset 4))) (let ((.cse8 (select (let ((.cse10 (let ((.cse13 (store |c_#memory_$Pointer$.base| c_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) .cse9 |v_main_#t~malloc2.base_7|)))) (store .cse13 |v_main_#t~malloc2.base_7| (store (select .cse13 |v_main_#t~malloc2.base_7|) 0 0))))) (let ((.cse11 (select (select .cse10 c_main_~list~0.base) .cse9))) (store .cse10 .cse11 (store (select .cse10 .cse11) (+ (select (select (let ((.cse12 (store |c_#memory_$Pointer$.offset| c_main_~list~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~list~0.base) .cse9 0)))) (store .cse12 |v_main_#t~malloc2.base_7| (store (select .cse12 |v_main_#t~malloc2.base_7|) 0 0))) c_main_~list~0.base) .cse9) 4) 0)))) c_main_~list~0.base))) (or (not (= (select |c_#valid| |v_main_#t~malloc2.base_7|) 0)) (= |v_main_#t~malloc2.base_7| 0) (not (= 0 (select .cse8 .cse9))) (= 0 (select .cse8 c_main_~list~0.offset)))))))) is different from false [2019-10-07 03:48:58,587 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_main_~list~0.offset 4))) (and (forall ((|v_main_#t~malloc2.base_7| Int)) (let ((.cse4 (+ c_main_~list~0.offset 4))) (let ((.cse0 (let ((.cse6 (store |c_#memory_$Pointer$.offset| c_main_~list~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~list~0.base) .cse4 0)))) (store .cse6 |v_main_#t~malloc2.base_7| (store (select .cse6 |v_main_#t~malloc2.base_7|) 0 0)))) (.cse3 (let ((.cse5 (store |c_#memory_$Pointer$.base| c_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) .cse4 |v_main_#t~malloc2.base_7|)))) (store .cse5 |v_main_#t~malloc2.base_7| (store (select .cse5 |v_main_#t~malloc2.base_7|) 0 0))))) (let ((.cse1 (select (select .cse3 c_main_~list~0.base) .cse4)) (.cse2 (+ (select (select .cse0 c_main_~list~0.base) .cse4) 4))) (or (not (= (select |c_#valid| |v_main_#t~malloc2.base_7|) 0)) (= |v_main_#t~malloc2.base_7| 0) (= (select (select (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 0)) c_main_~list~0.base) c_main_~list~0.offset) 0) (not (= 0 (select (select (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 0)) c_main_~list~0.base) .cse4)))))))) (= 0 (select (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) .cse7 0) c_main_~list~0.offset)) (= 0 (select (store (select |c_#memory_$Pointer$.offset| c_main_~list~0.base) .cse7 0) c_main_~list~0.offset)) (forall ((v_prenex_4 Int)) (let ((.cse9 (+ c_main_~list~0.offset 4))) (let ((.cse8 (select (let ((.cse10 (let ((.cse13 (store |c_#memory_$Pointer$.base| c_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) .cse9 v_prenex_4)))) (store .cse13 v_prenex_4 (store (select .cse13 v_prenex_4) 0 0))))) (let ((.cse11 (select (select .cse10 c_main_~list~0.base) .cse9))) (store .cse10 .cse11 (store (select .cse10 .cse11) (+ (select (select (let ((.cse12 (store |c_#memory_$Pointer$.offset| c_main_~list~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~list~0.base) .cse9 0)))) (store .cse12 v_prenex_4 (store (select .cse12 v_prenex_4) 0 0))) c_main_~list~0.base) .cse9) 4) 0)))) c_main_~list~0.base))) (or (= v_prenex_4 0) (not (= (select |c_#valid| v_prenex_4) 0)) (not (= 0 (select .cse8 .cse9))) (= 0 (select .cse8 c_main_~list~0.offset)))))))) is different from false [2019-10-07 03:48:58,614 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:58,614 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 03:48:58,638 INFO L162 IcfgInterpreter]: Started Sifa with 28 locations of interest [2019-10-07 03:48:58,638 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 03:48:58,643 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 03:48:58,650 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 03:48:58,650 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 03:48:58,757 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2019-10-07 03:48:59,488 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 03:48:59,500 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 03:48:59,501 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 03:48:59,501 INFO L193 IcfgInterpreter]: Reachable states at location L1025-1 satisfy 440#true [2019-10-07 03:48:59,501 INFO L193 IcfgInterpreter]: Reachable states at location L1014-1 satisfy 238#(or (and (<= 0 |main_#t~malloc0.offset|) (<= |#NULL.base| 0) (<= 0 main_~list~0.offset) (<= 0 |#NULL.base|) (<= 0 main_~end~0.offset) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (<= main_~list~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (exists ((v_main_~end~0.base_41 Int) (v_main_~end~0.offset_41 Int)) (and (<= 0 main_~inner~0.offset) (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_41) v_main_~end~0.offset_41) main_~end~0.base) (<= main_~inner~0.base 0) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| v_main_~end~0.base_41) v_main_~end~0.offset_41)) (= main_~inner~0.offset 0) (= main_~inner~0.base 0) (<= 0 main_~inner~0.base) (<= main_~inner~0.offset 0)))) [2019-10-07 03:48:59,502 INFO L193 IcfgInterpreter]: Reachable states at location L993-14 satisfy 91#(and (= |#NULL.base| 0) (<= 0 |main_#t~malloc0.offset|) (<= |#NULL.base| 0) (<= 0 main_~list~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc0.offset| 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 03:48:59,502 INFO L193 IcfgInterpreter]: Reachable states at location L1025-4 satisfy 394#true [2019-10-07 03:48:59,502 INFO L193 IcfgInterpreter]: Reachable states at location L993-15 satisfy 57#(and (= |#NULL.base| 0) (<= 0 |main_#t~malloc0.offset|) (<= |#NULL.base| 0) (<= 0 main_~list~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc0.offset| 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 03:48:59,503 INFO L193 IcfgInterpreter]: Reachable states at location L993-16 satisfy 100#(and (= |#NULL.base| 0) (<= 0 |main_#t~malloc0.offset|) (<= |#NULL.base| 0) (<= 0 main_~list~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc0.offset| 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 03:48:59,503 INFO L193 IcfgInterpreter]: Reachable states at location L1012-3 satisfy 149#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~end~0.offset) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_#t~malloc0.offset|) (<= 0 main_~list~0.offset) (= |main_#t~malloc0.offset| 0) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0)) [2019-10-07 03:48:59,503 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:59,503 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#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:59,504 INFO L193 IcfgInterpreter]: Reachable states at location L1012-4 satisfy 136#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~end~0.offset) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_#t~malloc0.offset|) (<= 0 main_~list~0.offset) (= |main_#t~malloc0.offset| 0) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0)) [2019-10-07 03:48:59,504 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 444#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 03:48:59,504 INFO L193 IcfgInterpreter]: Reachable states at location L993-3 satisfy 43#(and (<= 0 |main_#t~malloc0.offset|) (<= 0 main_~list~0.offset) (<= |main_#t~malloc0.offset| 0) (<= main_~list~0.offset 0) (or (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0))) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 |main_#t~malloc0.offset|) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (not (= main_~list~0.offset 0)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 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) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0))) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0))) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 |main_#t~malloc0.offset|) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (not (= 0 main_~list~0.base)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 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) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0))) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 03:48:59,505 INFO L193 IcfgInterpreter]: Reachable states at location L1005-15 satisfy 109#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~end~0.offset) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_#t~malloc0.offset|) (<= 0 main_~list~0.offset) (= |main_#t~malloc0.offset| 0) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0)) [2019-10-07 03:48:59,505 INFO L193 IcfgInterpreter]: Reachable states at location L1024-2 satisfy 389#true [2019-10-07 03:48:59,505 INFO L193 IcfgInterpreter]: Reachable states at location L993-4 satisfy 38#(and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0))) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 |main_#t~malloc0.offset|) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_#t~malloc0.offset|) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= |main_#t~malloc0.base| main_~list~0.base) (<= 0 main_~list~0.offset) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (<= |main_#t~malloc0.offset| 0) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (<= main_~list~0.offset 0) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0))) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)) [2019-10-07 03:48:59,505 INFO L193 IcfgInterpreter]: Reachable states at location L1024-3 satisfy 384#true [2019-10-07 03:48:59,505 INFO L193 IcfgInterpreter]: Reachable states at location L993-5 satisfy 48#(and (<= 0 |main_#t~malloc0.offset|) (<= 0 main_~list~0.offset) (<= |main_#t~malloc0.offset| 0) (<= main_~list~0.offset 0) (or (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0))) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 |main_#t~malloc0.offset|) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (not (= main_~list~0.offset 0)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 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) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0))) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0))) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 |main_#t~malloc0.offset|) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (not (= 0 main_~list~0.base)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 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) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0))) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 03:48:59,506 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 449#(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:59,506 INFO L193 IcfgInterpreter]: Reachable states at location L998-1 satisfy 118#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~end~0.offset) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_#t~malloc0.offset|) (<= |main_#t~nondet8| 2147483647) (<= 0 main_~list~0.offset) (= |main_#t~malloc0.offset| 0) (<= 0 (+ |main_#t~nondet8| 2147483648)) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0)) [2019-10-07 03:48:59,506 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 03:48:59,506 INFO L193 IcfgInterpreter]: Reachable states at location mainErr7ASSERT_VIOLATIONERROR_FUNCTION satisfy 435#true [2019-10-07 03:48:59,507 INFO L193 IcfgInterpreter]: Reachable states at location L998-3 satisfy 127#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~end~0.offset) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_#t~malloc0.offset|) (<= 0 main_~list~0.offset) (= |main_#t~malloc0.offset| 0) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0)) [2019-10-07 03:48:59,507 INFO L193 IcfgInterpreter]: Reachable states at location L1029-2 satisfy 347#(and (= main_~inner~0.offset 0) (= main_~inner~0.base 0) (or (and (<= 0 main_~inner~0.offset) (<= main_~inner~0.base 0) (<= main_~len~0 1) (<= 0 main_~inner~0.base) (<= main_~inner~0.offset 0)) (and (<= 0 main_~inner~0.offset) (<= main_~inner~0.base 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~end~0.offset) (<= 0 main_~inner~0.base) (<= main_~inner~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~len~0 0) (<= 0 |main_#t~malloc0.offset|) (<= 0 main_~len~0) (<= 0 main_~list~0.offset) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (<= main_~list~0.offset 0)))) [2019-10-07 03:48:59,507 INFO L193 IcfgInterpreter]: Reachable states at location L1018-2 satisfy 246#true [2019-10-07 03:48:59,507 INFO L193 IcfgInterpreter]: Reachable states at location L1029-3 satisfy 332#(and (<= 0 main_~inner~0.offset) (<= main_~inner~0.base 0) (= main_~inner~0.offset 0) (= main_~inner~0.base 0) (<= 0 main_~inner~0.base) (<= main_~inner~0.offset 0)) [2019-10-07 03:48:59,508 INFO L193 IcfgInterpreter]: Reachable states at location L1029-4 satisfy 233#(and (<= 0 main_~inner~0.offset) (<= main_~inner~0.base 0) (= main_~inner~0.offset 0) (= main_~inner~0.base 0) (<= 0 main_~inner~0.base) (<= main_~inner~0.offset 0)) [2019-10-07 03:48:59,508 INFO L193 IcfgInterpreter]: Reachable states at location L1025 satisfy 405#true [2019-10-07 03:48:59,508 INFO L193 IcfgInterpreter]: Reachable states at location L993-11 satisfy 82#(and (= |#NULL.base| 0) (<= 0 |main_#t~malloc0.offset|) (<= |#NULL.base| 0) (<= 0 main_~list~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc0.offset| 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 03:48:59,922 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-10-07 03:49:00,548 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 03:49:00,548 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9, 12] total 28 [2019-10-07 03:49:00,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-07 03:49:00,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-07 03:49:00,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=562, Unknown=2, NotChecked=98, Total=756 [2019-10-07 03:49:00,553 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 28 states. [2019-10-07 03:49:06,337 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-10-07 03:49:06,613 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-10-07 03:49:06,903 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 79 [2019-10-07 03:49:07,340 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-10-07 03:49:07,569 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-10-07 03:49:07,760 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-10-07 03:49:07,991 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-10-07 03:49:08,221 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-10-07 03:49:08,427 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-10-07 03:49:08,658 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-10-07 03:49:08,908 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-10-07 03:49:09,138 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-07 03:49:09,308 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-10-07 03:49:09,734 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2019-10-07 03:49:10,120 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 81 [2019-10-07 03:49:10,728 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-10-07 03:49:11,162 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-10-07 03:49:11,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:49:11,275 INFO L93 Difference]: Finished difference Result 210 states and 228 transitions. [2019-10-07 03:49:11,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-07 03:49:11,276 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 29 [2019-10-07 03:49:11,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:49:11,278 INFO L225 Difference]: With dead ends: 210 [2019-10-07 03:49:11,278 INFO L226 Difference]: Without dead ends: 172 [2019-10-07 03:49:11,280 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=628, Invalid=2458, Unknown=2, NotChecked=218, Total=3306 [2019-10-07 03:49:11,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-10-07 03:49:11,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 93. [2019-10-07 03:49:11,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-07 03:49:11,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2019-10-07 03:49:11,291 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 29 [2019-10-07 03:49:11,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:49:11,294 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2019-10-07 03:49:11,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-07 03:49:11,295 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2019-10-07 03:49:11,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-07 03:49:11,302 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:49:11,302 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:49:11,508 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:49:11,509 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:49:11,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:49:11,510 INFO L82 PathProgramCache]: Analyzing trace with hash 580690258, now seen corresponding path program 1 times [2019-10-07 03:49:11,510 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:49:11,510 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:49:11,510 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:49:11,511 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:49:11,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:49:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:49:11,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:49:11,705 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:49:11,705 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:49:11,705 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:49:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:49:11,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-07 03:49:11,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:49:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:49:11,972 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:49:12,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:49:12,037 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 03:49:12,037 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 13 [2019-10-07 03:49:12,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 03:49:12,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 03:49:12,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-07 03:49:12,039 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 6 states. [2019-10-07 03:49:12,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:49:12,285 INFO L93 Difference]: Finished difference Result 158 states and 175 transitions. [2019-10-07 03:49:12,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 03:49:12,286 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-10-07 03:49:12,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:49:12,287 INFO L225 Difference]: With dead ends: 158 [2019-10-07 03:49:12,287 INFO L226 Difference]: Without dead ends: 142 [2019-10-07 03:49:12,287 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-10-07 03:49:12,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-10-07 03:49:12,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 115. [2019-10-07 03:49:12,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-10-07 03:49:12,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 132 transitions. [2019-10-07 03:49:12,302 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 132 transitions. Word has length 30 [2019-10-07 03:49:12,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:49:12,303 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 132 transitions. [2019-10-07 03:49:12,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 03:49:12,303 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 132 transitions. [2019-10-07 03:49:12,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-07 03:49:12,304 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:49:12,304 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:49:12,508 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:49:12,508 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:49:12,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:49:12,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1829633834, now seen corresponding path program 1 times [2019-10-07 03:49:12,509 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:49:12,509 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:49:12,509 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:49:12,509 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:49:12,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:49:12,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:49:12,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:49:12,549 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:49:12,550 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:49:12,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:49:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:49:12,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 03:49:12,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:49:12,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:49:12,691 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:49:12,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:49:12,699 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 03:49:12,700 INFO L162 IcfgInterpreter]: Started Sifa with 31 locations of interest [2019-10-07 03:49:12,701 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 03:49:12,701 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 03:49:12,702 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 03:49:12,702 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 03:49:12,736 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2019-10-07 03:49:13,115 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 03:49:13,118 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 03:49:13,119 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 03:49:13,119 INFO L193 IcfgInterpreter]: Reachable states at location L1014-1 satisfy 181#(and (<= 0 |main_#t~malloc0.offset|) (<= |#NULL.base| 0) (<= 0 main_~list~0.offset) (<= 0 |#NULL.base|) (<= 0 main_~end~0.offset) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (<= main_~list~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 03:49:13,119 INFO L193 IcfgInterpreter]: Reachable states at location L1025-3 satisfy 281#(and (<= 0 |main_#t~malloc0.offset|) (<= 1 main_~len~0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~list~0.offset) (<= 0 main_~end~0.offset) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (<= main_~list~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 03:49:13,119 INFO L193 IcfgInterpreter]: Reachable states at location L993-14 satisfy 91#(and (= |#NULL.base| 0) (<= 0 |main_#t~malloc0.offset|) (<= |#NULL.base| 0) (<= 0 main_~list~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc0.offset| 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 03:49:13,120 INFO L193 IcfgInterpreter]: Reachable states at location L1025-4 satisfy 360#(and (<= 1 main_~len~0) (<= main_~len~0 2)) [2019-10-07 03:49:13,120 INFO L193 IcfgInterpreter]: Reachable states at location L993-15 satisfy 57#(and (= |#NULL.base| 0) (<= 0 |main_#t~malloc0.offset|) (<= |#NULL.base| 0) (<= 0 main_~list~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc0.offset| 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 03:49:13,120 INFO L193 IcfgInterpreter]: Reachable states at location L993-16 satisfy 100#(and (= |#NULL.base| 0) (<= 0 |main_#t~malloc0.offset|) (<= |#NULL.base| 0) (<= 0 main_~list~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc0.offset| 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 03:49:13,120 INFO L193 IcfgInterpreter]: Reachable states at location L1012-3 satisfy 149#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~end~0.offset) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_#t~malloc0.offset|) (<= 0 main_~list~0.offset) (= |main_#t~malloc0.offset| 0) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0)) [2019-10-07 03:49:13,121 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:49:13,121 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 03:49:13,121 INFO L193 IcfgInterpreter]: Reachable states at location L1012-4 satisfy 136#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~end~0.offset) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_#t~malloc0.offset|) (<= 0 main_~list~0.offset) (= |main_#t~malloc0.offset| 0) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0)) [2019-10-07 03:49:13,121 INFO L193 IcfgInterpreter]: Reachable states at location L1026 satisfy 291#(and (<= 1 main_~len~0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (<= 0 main_~end~0.offset) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_#t~malloc0.offset|) (<= 0 main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset) |main_#t~mem20.offset|) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (<= main_~list~0.offset 0)) [2019-10-07 03:49:13,122 INFO L193 IcfgInterpreter]: Reachable states at location L1026-3 satisfy 296#(and (<= 1 main_~len~0) (<= |#NULL.base| 0) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (<= 0 |#NULL.base|) (<= 0 main_~end~0.offset) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_#t~malloc0.offset|) (= (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset) 0) (<= 0 main_~list~0.offset) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (<= main_~list~0.offset 0)) [2019-10-07 03:49:13,122 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 431#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 03:49:13,122 INFO L193 IcfgInterpreter]: Reachable states at location L993-3 satisfy 43#(and (<= 0 |main_#t~malloc0.offset|) (or (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0))) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 |main_#t~malloc0.offset|) (= 0 (select |old(#valid)| 0)) (not (= 0 main_~list~0.base)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 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) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0))) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0))) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 |main_#t~malloc0.offset|) (= 0 (select |old(#valid)| 0)) (not (= main_~list~0.offset 0)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 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) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0))) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|))) (<= 0 main_~list~0.offset) (<= 0 |#NULL.base|) (<= |main_#t~malloc0.offset| 0) (<= main_~list~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 03:49:13,122 INFO L193 IcfgInterpreter]: Reachable states at location L1005-15 satisfy 109#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~end~0.offset) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_#t~malloc0.offset|) (<= 0 main_~list~0.offset) (= |main_#t~malloc0.offset| 0) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0)) [2019-10-07 03:49:13,123 INFO L193 IcfgInterpreter]: Reachable states at location L1024-2 satisfy 380#(and (<= 1 main_~len~0) (<= main_~len~0 2)) [2019-10-07 03:49:13,123 INFO L193 IcfgInterpreter]: Reachable states at location L1026-4 satisfy 286#(and (<= 0 |main_#t~malloc0.offset|) (<= 1 main_~len~0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~list~0.offset) (<= 0 main_~end~0.offset) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (<= main_~list~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 03:49:13,123 INFO L193 IcfgInterpreter]: Reachable states at location L993-4 satisfy 38#(and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0))) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 |main_#t~malloc0.offset|) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |main_#t~malloc0.offset|) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= |main_#t~malloc0.base| main_~list~0.base) (<= 0 main_~list~0.offset) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (<= |main_#t~malloc0.offset| 0) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (<= main_~list~0.offset 0) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0))) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)) [2019-10-07 03:49:13,123 INFO L193 IcfgInterpreter]: Reachable states at location L1024-3 satisfy 390#(and (<= 1 main_~len~0) (<= main_~len~0 2)) [2019-10-07 03:49:13,124 INFO L193 IcfgInterpreter]: Reachable states at location L1026-5 satisfy 301#(and (<= 1 main_~len~0) (<= |#NULL.base| 0) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (<= 0 |#NULL.base|) (<= 0 main_~end~0.offset) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_#t~malloc0.offset|) (= (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset) 0) (<= 0 main_~list~0.offset) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (<= main_~list~0.offset 0)) [2019-10-07 03:49:13,124 INFO L193 IcfgInterpreter]: Reachable states at location L993-5 satisfy 48#(and (<= 0 |main_#t~malloc0.offset|) (or (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0))) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 |main_#t~malloc0.offset|) (= 0 (select |old(#valid)| 0)) (not (= 0 main_~list~0.base)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 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) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0))) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0))) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 |main_#t~malloc0.offset|) (= 0 (select |old(#valid)| 0)) (not (= main_~list~0.offset 0)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 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) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0))) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|))) (<= 0 main_~list~0.offset) (<= 0 |#NULL.base|) (<= |main_#t~malloc0.offset| 0) (<= main_~list~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 03:49:13,124 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 436#(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:49:13,125 INFO L193 IcfgInterpreter]: Reachable states at location L998-1 satisfy 118#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~end~0.offset) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_#t~malloc0.offset|) (<= |main_#t~nondet8| 2147483647) (<= 0 main_~list~0.offset) (= |main_#t~malloc0.offset| 0) (<= 0 (+ |main_#t~nondet8| 2147483648)) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0)) [2019-10-07 03:49:13,125 INFO L193 IcfgInterpreter]: Reachable states at location L1029 satisfy 427#(and (<= 0 main_~inner~0.offset) (<= main_~inner~0.base 0) (<= 1 main_~len~0) (= main_~inner~0.offset 0) (= main_~inner~0.base 0) (<= 0 main_~inner~0.base) (<= main_~inner~0.offset 0) (not (<= main_~len~0 1))) [2019-10-07 03:49:13,125 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 03:49:13,125 INFO L193 IcfgInterpreter]: Reachable states at location L998-3 satisfy 127#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~end~0.offset) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_#t~malloc0.offset|) (<= 0 main_~list~0.offset) (= |main_#t~malloc0.offset| 0) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0)) [2019-10-07 03:49:13,125 INFO L193 IcfgInterpreter]: Reachable states at location L1018-2 satisfy 309#true [2019-10-07 03:49:13,126 INFO L193 IcfgInterpreter]: Reachable states at location L1029-3 satisfy 398#(and (<= 0 main_~inner~0.offset) (<= main_~inner~0.base 0) (= main_~inner~0.offset 0) (= main_~inner~0.base 0) (<= 0 main_~inner~0.base) (<= main_~inner~0.offset 0)) [2019-10-07 03:49:13,126 INFO L193 IcfgInterpreter]: Reachable states at location mainErr9ASSERT_VIOLATIONERROR_FUNCTION satisfy 422#(and (<= 0 main_~inner~0.offset) (<= main_~inner~0.base 0) (<= 1 main_~len~0) (= main_~inner~0.offset 0) (= main_~inner~0.base 0) (<= 0 main_~inner~0.base) (<= main_~inner~0.offset 0) (not (<= main_~len~0 1))) [2019-10-07 03:49:13,126 INFO L193 IcfgInterpreter]: Reachable states at location L1025 satisfy 276#(and (<= 0 |main_#t~malloc0.offset|) (<= 1 main_~len~0) (<= |#NULL.base| 0) (<= 0 main_~list~0.offset) (<= 0 |#NULL.base|) (<= 0 main_~end~0.offset) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (<= main_~list~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 03:49:13,126 INFO L193 IcfgInterpreter]: Reachable states at location L993-11 satisfy 82#(and (= |#NULL.base| 0) (<= 0 |main_#t~malloc0.offset|) (<= |#NULL.base| 0) (<= 0 main_~list~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc0.offset| 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 03:49:13,816 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 03:49:13,817 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 15] total 19 [2019-10-07 03:49:13,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-07 03:49:13,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-07 03:49:13,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2019-10-07 03:49:13,819 INFO L87 Difference]: Start difference. First operand 115 states and 132 transitions. Second operand 19 states. [2019-10-07 03:49:15,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:49:15,581 INFO L93 Difference]: Finished difference Result 209 states and 238 transitions. [2019-10-07 03:49:15,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-07 03:49:15,582 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-10-07 03:49:15,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:49:15,585 INFO L225 Difference]: With dead ends: 209 [2019-10-07 03:49:15,586 INFO L226 Difference]: Without dead ends: 207 [2019-10-07 03:49:15,587 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=271, Invalid=1289, Unknown=0, NotChecked=0, Total=1560 [2019-10-07 03:49:15,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-10-07 03:49:15,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 139. [2019-10-07 03:49:15,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-10-07 03:49:15,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 163 transitions. [2019-10-07 03:49:15,598 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 163 transitions. Word has length 31 [2019-10-07 03:49:15,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:49:15,598 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 163 transitions. [2019-10-07 03:49:15,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-07 03:49:15,598 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 163 transitions. [2019-10-07 03:49:15,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-07 03:49:15,599 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:49:15,599 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:49:15,802 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:49:15,803 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:49:15,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:49:15,804 INFO L82 PathProgramCache]: Analyzing trace with hash 245997555, now seen corresponding path program 1 times [2019-10-07 03:49:15,804 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:49:15,804 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:49:15,805 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:49:15,805 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:49:15,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:49:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:49:15,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:49:15,899 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:49:15,899 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:49:15,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:49:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:49:16,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-07 03:49:16,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:49:16,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:49:16,113 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:49:16,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:49:16,195 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 03:49:16,198 INFO L162 IcfgInterpreter]: Started Sifa with 31 locations of interest [2019-10-07 03:49:16,198 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 03:49:16,199 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 03:49:16,199 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 03:49:16,199 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 03:49:16,226 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2019-10-07 03:49:16,439 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 03:49:16,509 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 03:49:17,248 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 03:49:17,251 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 03:49:17,251 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 03:49:17,251 INFO L193 IcfgInterpreter]: Reachable states at location L1014-1 satisfy 311#(or (exists ((v_main_~end~0.base_60 Int) (v_main_~end~0.offset_60 Int)) (and (<= 0 main_~inner~0.offset) (<= main_~inner~0.base 0) (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_60) v_main_~end~0.offset_60) main_~end~0.base) (= main_~inner~0.offset 0) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| v_main_~end~0.base_60) v_main_~end~0.offset_60)) (= main_~inner~0.base 0) (<= 0 main_~inner~0.base) (<= main_~inner~0.offset 0))) (and (<= 0 |main_#t~malloc0.offset|) (<= |#NULL.base| 0) (<= 0 main_~list~0.offset) (<= 0 |#NULL.base|) (<= 0 main_~end~0.offset) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (<= main_~list~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0))) [2019-10-07 03:49:17,251 INFO L193 IcfgInterpreter]: Reachable states at location L993-14 satisfy 91#(and (= |#NULL.base| 0) (<= 0 |main_#t~malloc0.offset|) (<= |#NULL.base| 0) (<= 0 main_~list~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc0.offset| 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 03:49:17,252 INFO L193 IcfgInterpreter]: Reachable states at location L993-15 satisfy 57#(and (= |#NULL.base| 0) (<= 0 |main_#t~malloc0.offset|) (<= |#NULL.base| 0) (<= 0 main_~list~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc0.offset| 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 03:49:17,252 INFO L193 IcfgInterpreter]: Reachable states at location L993-16 satisfy 100#(and (= |#NULL.base| 0) (<= 0 |main_#t~malloc0.offset|) (<= |#NULL.base| 0) (<= 0 main_~list~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc0.offset| 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 03:49:17,252 INFO L193 IcfgInterpreter]: Reachable states at location L1012-3 satisfy 149#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~end~0.offset) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_#t~malloc0.offset|) (<= 0 main_~list~0.offset) (= |main_#t~malloc0.offset| 0) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0)) [2019-10-07 03:49:17,253 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:49:17,253 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#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:49:17,253 INFO L193 IcfgInterpreter]: Reachable states at location L1012-4 satisfy 136#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~end~0.offset) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_#t~malloc0.offset|) (<= 0 main_~list~0.offset) (= |main_#t~malloc0.offset| 0) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0)) [2019-10-07 03:49:17,253 INFO L193 IcfgInterpreter]: Reachable states at location L1039 satisfy 433#true [2019-10-07 03:49:17,254 INFO L193 IcfgInterpreter]: Reachable states at location L1041-3 satisfy 443#true [2019-10-07 03:49:17,254 INFO L193 IcfgInterpreter]: Reachable states at location L1039-2 satisfy 420#(and (or (and (= 0 main_~end~0.base) (not (= 0 main_~list~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~end~0.base) (= main_~end~0.offset 0) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= 0 main_~end~0.base) (not (= main_~list~0.offset 0)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~end~0.base) (= main_~end~0.offset 0) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))) (<= 0 main_~end~0.base) (<= 0 main_~end~0.offset) (<= main_~end~0.offset 0) (<= main_~end~0.base 0)) [2019-10-07 03:49:17,254 INFO L193 IcfgInterpreter]: Reachable states at location L1041-4 satisfy 438#true [2019-10-07 03:49:17,254 INFO L193 IcfgInterpreter]: Reachable states at location L1035-1 satisfy 369#true [2019-10-07 03:49:17,254 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 512#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 03:49:17,254 INFO L193 IcfgInterpreter]: Reachable states at location L993-3 satisfy 43#(and (<= 0 |main_#t~malloc0.offset|) (<= 0 main_~list~0.offset) (<= |main_#t~malloc0.offset| 0) (<= main_~list~0.offset 0) (or (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0))) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 |main_#t~malloc0.offset|) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (not (= main_~list~0.offset 0)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 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) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0))) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0))) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 |main_#t~malloc0.offset|) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (not (= 0 main_~list~0.base)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 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) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0))) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 03:49:17,255 INFO L193 IcfgInterpreter]: Reachable states at location L1005-15 satisfy 109#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~end~0.offset) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_#t~malloc0.offset|) (<= 0 main_~list~0.offset) (= |main_#t~malloc0.offset| 0) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0)) [2019-10-07 03:49:17,255 INFO L193 IcfgInterpreter]: Reachable states at location L993-4 satisfy 38#(and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0))) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 |main_#t~malloc0.offset|) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_#t~malloc0.offset|) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= |main_#t~malloc0.base| main_~list~0.base) (<= 0 main_~list~0.offset) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (<= |main_#t~malloc0.offset| 0) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (<= main_~list~0.offset 0) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0))) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)) [2019-10-07 03:49:17,257 INFO L193 IcfgInterpreter]: Reachable states at location L1042 satisfy 508#(and (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4)) |main_#t~mem24.offset|)) [2019-10-07 03:49:17,257 INFO L193 IcfgInterpreter]: Reachable states at location L993-5 satisfy 48#(and (<= 0 |main_#t~malloc0.offset|) (<= 0 main_~list~0.offset) (<= |main_#t~malloc0.offset| 0) (<= main_~list~0.offset 0) (or (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0))) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 |main_#t~malloc0.offset|) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (not (= main_~list~0.offset 0)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 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) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0))) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0))) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 |main_#t~malloc0.offset|) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (not (= 0 main_~list~0.base)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 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) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0))) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 03:49:17,257 INFO L193 IcfgInterpreter]: Reachable states at location L1042-1 satisfy 503#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4)) 0))) [2019-10-07 03:49:17,257 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 517#(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:49:17,257 INFO L193 IcfgInterpreter]: Reachable states at location L998-1 satisfy 118#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~end~0.offset) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_#t~malloc0.offset|) (<= |main_#t~nondet8| 2147483647) (<= 0 main_~list~0.offset) (= |main_#t~malloc0.offset| 0) (<= 0 (+ |main_#t~nondet8| 2147483648)) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0)) [2019-10-07 03:49:17,258 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 03:49:17,258 INFO L193 IcfgInterpreter]: Reachable states at location L1042-4 satisfy 448#true [2019-10-07 03:49:17,258 INFO L193 IcfgInterpreter]: Reachable states at location L998-3 satisfy 127#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~end~0.offset) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_#t~malloc0.offset|) (<= 0 main_~list~0.offset) (= |main_#t~malloc0.offset| 0) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0)) [2019-10-07 03:49:17,258 INFO L193 IcfgInterpreter]: Reachable states at location L1029-2 satisfy 342#(and (= main_~inner~0.offset 0) (= main_~inner~0.base 0) (or (and (<= 0 main_~inner~0.offset) (<= main_~inner~0.base 0) (<= main_~len~0 1) (<= 0 main_~inner~0.base) (<= main_~inner~0.offset 0)) (and (<= 0 main_~inner~0.offset) (<= main_~inner~0.base 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 main_~end~0.offset) (<= 0 main_~inner~0.base) (<= main_~inner~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~len~0 0) (<= 0 |main_#t~malloc0.offset|) (<= 0 main_~len~0) (<= 0 main_~list~0.offset) (<= main_~end~0.offset 0) (<= |main_#t~malloc0.offset| 0) (<= main_~list~0.offset 0)))) [2019-10-07 03:49:17,258 INFO L193 IcfgInterpreter]: Reachable states at location L1018-2 satisfy 319#true [2019-10-07 03:49:17,258 INFO L193 IcfgInterpreter]: Reachable states at location L1029-3 satisfy 327#(and (<= 0 main_~inner~0.offset) (<= main_~inner~0.base 0) (= main_~inner~0.offset 0) (= main_~inner~0.base 0) (<= 0 main_~inner~0.base) (<= main_~inner~0.offset 0)) [2019-10-07 03:49:17,259 INFO L193 IcfgInterpreter]: Reachable states at location L1029-4 satisfy 306#(and (<= 0 main_~inner~0.offset) (<= main_~inner~0.base 0) (= main_~inner~0.offset 0) (= main_~inner~0.base 0) (<= 0 main_~inner~0.base) (<= main_~inner~0.offset 0)) [2019-10-07 03:49:17,259 INFO L193 IcfgInterpreter]: Reachable states at location L993-11 satisfy 82#(and (= |#NULL.base| 0) (<= 0 |main_#t~malloc0.offset|) (<= |#NULL.base| 0) (<= 0 main_~list~0.offset) (<= 0 |#NULL.base|) (= |main_#t~malloc0.offset| 0) (<= |main_#t~malloc0.offset| 0) (= |#NULL.offset| 0) (<= main_~list~0.offset 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 03:49:17,259 INFO L193 IcfgInterpreter]: Reachable states at location mainErr11ASSERT_VIOLATIONERROR_FUNCTION satisfy 493#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4)) 0))) [2019-10-07 03:49:17,990 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 03:49:17,990 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 15] total 22 [2019-10-07 03:49:17,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-07 03:49:17,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-07 03:49:17,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2019-10-07 03:49:17,992 INFO L87 Difference]: Start difference. First operand 139 states and 163 transitions. Second operand 22 states. [2019-10-07 03:49:19,279 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-10-07 03:49:19,437 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-10-07 03:49:20,515 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-10-07 03:49:20,835 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-10-07 03:49:21,023 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-10-07 03:49:21,457 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-10-07 03:49:21,631 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-10-07 03:49:21,798 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 45 [2019-10-07 03:49:22,015 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 69 [2019-10-07 03:49:22,216 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 70 [2019-10-07 03:49:22,384 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-10-07 03:49:22,632 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-10-07 03:49:22,829 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-10-07 03:49:22,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:49:22,847 INFO L93 Difference]: Finished difference Result 288 states and 332 transitions. [2019-10-07 03:49:22,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-07 03:49:22,847 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 33 [2019-10-07 03:49:22,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:49:22,851 INFO L225 Difference]: With dead ends: 288 [2019-10-07 03:49:22,851 INFO L226 Difference]: Without dead ends: 261 [2019-10-07 03:49:22,856 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 883 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=574, Invalid=2848, Unknown=0, NotChecked=0, Total=3422 [2019-10-07 03:49:22,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-10-07 03:49:22,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 173. [2019-10-07 03:49:22,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-10-07 03:49:22,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 205 transitions. [2019-10-07 03:49:22,874 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 205 transitions. Word has length 33 [2019-10-07 03:49:22,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:49:22,874 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 205 transitions. [2019-10-07 03:49:22,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-07 03:49:22,875 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 205 transitions. [2019-10-07 03:49:22,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-07 03:49:22,875 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:49:22,875 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:49:23,079 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:49:23,080 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:49:23,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:49:23,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1425148835, now seen corresponding path program 1 times [2019-10-07 03:49:23,081 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:49:23,082 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:49:23,082 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:49:23,082 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:49:23,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:49:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:49:23,664 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2019-10-07 03:49:23,986 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 48 [2019-10-07 03:49:24,182 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 27 [2019-10-07 03:49:24,513 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:49:24,513 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:49:24,514 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:49:24,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:49:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:49:24,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-07 03:49:24,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:49:25,064 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-10-07 03:49:25,250 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-10-07 03:49:25,479 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-10-07 03:49:26,345 WARN L191 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-10-07 03:49:26,703 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-10-07 03:49:26,865 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-10-07 03:49:27,173 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-10-07 03:49:31,310 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 199 [2019-10-07 03:49:34,537 WARN L191 SmtUtils]: Spent 3.16 s on a formula simplification that was a NOOP. DAG size: 192 [2019-10-07 03:49:37,968 WARN L191 SmtUtils]: Spent 3.30 s on a formula simplification that was a NOOP. DAG size: 189 [2019-10-07 03:49:40,896 WARN L191 SmtUtils]: Spent 2.69 s on a formula simplification that was a NOOP. DAG size: 185 [2019-10-07 03:49:45,274 WARN L191 SmtUtils]: Spent 4.21 s on a formula simplification. DAG size of input: 187 DAG size of output: 183 [2019-10-07 03:49:48,726 WARN L191 SmtUtils]: Spent 3.27 s on a formula simplification. DAG size of input: 181 DAG size of output: 177 [2019-10-07 03:49:50,361 WARN L191 SmtUtils]: Spent 1.46 s on a formula simplification that was a NOOP. DAG size: 170 [2019-10-07 03:49:52,995 WARN L191 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 168 DAG size of output: 155 [2019-10-07 03:49:54,422 WARN L191 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 149 DAG size of output: 145 [2019-10-07 03:49:55,320 WARN L191 SmtUtils]: Spent 797.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 124 [2019-10-07 03:49:55,577 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-10-07 03:49:56,305 WARN L191 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 105 [2019-10-07 03:49:56,786 WARN L191 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 90 [2019-10-07 03:49:57,007 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-10-07 03:49:57,245 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-10-07 03:49:57,696 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 92 [2019-10-07 03:49:58,168 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 81 [2019-10-07 03:49:58,320 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:49:58,320 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:50:00,411 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse50 (+ c_main_~end~0.offset 4))) (let ((.cse48 (store |c_#memory_$Pointer$.offset| c_main_~end~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~end~0.base) .cse50 0))) (.cse49 (+ c_main_~list~0.offset 4))) (let ((.cse44 (store |c_#memory_$Pointer$.base| c_main_~end~0.base (store (select |c_#memory_$Pointer$.base| c_main_~end~0.base) .cse50 0))) (.cse47 (select (select .cse48 c_main_~list~0.base) .cse49))) (let ((.cse46 (+ .cse47 4)) (.cse45 (select (select .cse44 c_main_~list~0.base) .cse49))) (let ((.cse1 (= .cse45 0)) (.cse2 (= 0 (select (select .cse48 .cse45) .cse46))) (.cse3 (= 0 .cse47)) (.cse0 (= 0 (select (select .cse44 .cse45) .cse46)))) (and (or .cse0 .cse1) (or .cse2 .cse1) (or .cse3 .cse2) (forall ((|v_main_#t~malloc12.base_7| Int)) (let ((.cse11 (+ c_main_~end~0.offset 4))) (let ((.cse10 (let ((.cse13 (store |c_#memory_$Pointer$.offset| c_main_~end~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~end~0.base) .cse11 0)))) (store .cse13 |v_main_#t~malloc12.base_7| (store (select .cse13 |v_main_#t~malloc12.base_7|) 0 0)))) (.cse5 (let ((.cse12 (store |c_#memory_$Pointer$.base| c_main_~end~0.base (store (select |c_#memory_$Pointer$.base| c_main_~end~0.base) .cse11 |v_main_#t~malloc12.base_7|)))) (store .cse12 |v_main_#t~malloc12.base_7| (store (select .cse12 |v_main_#t~malloc12.base_7|) 0 0))))) (let ((.cse6 (select (select .cse5 c_main_~end~0.base) .cse11)) (.cse7 (+ (select (select .cse10 c_main_~end~0.base) .cse11) 4))) (let ((.cse4 (store .cse10 .cse6 (store (select .cse10 .cse6) .cse7 0))) (.cse8 (+ c_main_~list~0.offset 4))) (let ((.cse9 (select (select .cse4 c_main_~list~0.base) .cse8))) (or (<= |v_main_#t~malloc12.base_7| |c_#StackHeapBarrier|) (= 0 (select (select .cse4 (select (select (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 0)) c_main_~list~0.base) .cse8)) (+ .cse9 4))) (not (= 0 (select |c_#valid| |v_main_#t~malloc12.base_7|))) (= 0 |v_main_#t~malloc12.base_7|) (= 0 .cse9)))))))) (forall ((|v_main_#t~malloc12.base_7| Int)) (let ((.cse21 (+ c_main_~end~0.offset 4))) (let ((.cse20 (let ((.cse23 (store |c_#memory_$Pointer$.offset| c_main_~end~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~end~0.base) .cse21 0)))) (store .cse23 |v_main_#t~malloc12.base_7| (store (select .cse23 |v_main_#t~malloc12.base_7|) 0 0)))) (.cse16 (let ((.cse22 (store |c_#memory_$Pointer$.base| c_main_~end~0.base (store (select |c_#memory_$Pointer$.base| c_main_~end~0.base) .cse21 |v_main_#t~malloc12.base_7|)))) (store .cse22 |v_main_#t~malloc12.base_7| (store (select .cse22 |v_main_#t~malloc12.base_7|) 0 0))))) (let ((.cse17 (select (select .cse16 c_main_~end~0.base) .cse21)) (.cse18 (+ (select (select .cse20 c_main_~end~0.base) .cse21) 4)) (.cse15 (+ c_main_~list~0.offset 4))) (let ((.cse19 (select (select (store .cse20 .cse17 (store (select .cse20 .cse17) .cse18 0)) c_main_~list~0.base) .cse15))) (or (<= |v_main_#t~malloc12.base_7| |c_#StackHeapBarrier|) (= 0 (select (let ((.cse14 (store .cse16 .cse17 (store (select .cse16 .cse17) .cse18 0)))) (select .cse14 (select (select .cse14 c_main_~list~0.base) .cse15))) (+ .cse19 4))) (not (= 0 (select |c_#valid| |v_main_#t~malloc12.base_7|))) (= 0 |v_main_#t~malloc12.base_7|) (= 0 .cse19))))))) (forall ((|v_main_#t~malloc12.base_7| Int)) (let ((.cse31 (+ c_main_~end~0.offset 4))) (let ((.cse26 (let ((.cse33 (store |c_#memory_$Pointer$.offset| c_main_~end~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~end~0.base) .cse31 0)))) (store .cse33 |v_main_#t~malloc12.base_7| (store (select .cse33 |v_main_#t~malloc12.base_7|) 0 0)))) (.cse30 (let ((.cse32 (store |c_#memory_$Pointer$.base| c_main_~end~0.base (store (select |c_#memory_$Pointer$.base| c_main_~end~0.base) .cse31 |v_main_#t~malloc12.base_7|)))) (store .cse32 |v_main_#t~malloc12.base_7| (store (select .cse32 |v_main_#t~malloc12.base_7|) 0 0))))) (let ((.cse27 (select (select .cse30 c_main_~end~0.base) .cse31)) (.cse28 (+ (select (select .cse26 c_main_~end~0.base) .cse31) 4))) (let ((.cse24 (store .cse30 .cse27 (store (select .cse30 .cse27) .cse28 0))) (.cse29 (+ c_main_~list~0.offset 4))) (let ((.cse25 (select (select .cse24 c_main_~list~0.base) .cse29))) (or (<= |v_main_#t~malloc12.base_7| |c_#StackHeapBarrier|) (= 0 (select (select .cse24 .cse25) (+ (select (select (store .cse26 .cse27 (store (select .cse26 .cse27) .cse28 0)) c_main_~list~0.base) .cse29) 4))) (not (= 0 (select |c_#valid| |v_main_#t~malloc12.base_7|))) (= .cse25 0) (= 0 |v_main_#t~malloc12.base_7|)))))))) (or .cse3 .cse0) (forall ((|v_main_#t~malloc12.base_7| Int)) (let ((.cse41 (+ c_main_~end~0.offset 4))) (let ((.cse37 (let ((.cse43 (store |c_#memory_$Pointer$.offset| c_main_~end~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~end~0.base) .cse41 0)))) (store .cse43 |v_main_#t~malloc12.base_7| (store (select .cse43 |v_main_#t~malloc12.base_7|) 0 0)))) (.cse40 (let ((.cse42 (store |c_#memory_$Pointer$.base| c_main_~end~0.base (store (select |c_#memory_$Pointer$.base| c_main_~end~0.base) .cse41 |v_main_#t~malloc12.base_7|)))) (store .cse42 |v_main_#t~malloc12.base_7| (store (select .cse42 |v_main_#t~malloc12.base_7|) 0 0))))) (let ((.cse38 (select (select .cse40 c_main_~end~0.base) .cse41)) (.cse39 (+ (select (select .cse37 c_main_~end~0.base) .cse41) 4)) (.cse36 (+ c_main_~list~0.offset 4))) (let ((.cse35 (select (select (store .cse40 .cse38 (store (select .cse40 .cse38) .cse39 0)) c_main_~list~0.base) .cse36))) (or (<= |v_main_#t~malloc12.base_7| |c_#StackHeapBarrier|) (= 0 (let ((.cse34 (store .cse37 .cse38 (store (select .cse37 .cse38) .cse39 0)))) (select (select .cse34 .cse35) (+ (select (select .cse34 c_main_~list~0.base) .cse36) 4)))) (not (= 0 (select |c_#valid| |v_main_#t~malloc12.base_7|))) (= .cse35 0) (= 0 |v_main_#t~malloc12.base_7|))))))))))))) is different from false [2019-10-07 03:50:02,451 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse50 (+ c_main_~end~0.offset 4))) (let ((.cse48 (store |c_#memory_$Pointer$.offset| c_main_~end~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~end~0.base) .cse50 0))) (.cse49 (+ c_main_~list~0.offset 4))) (let ((.cse44 (store |c_#memory_$Pointer$.base| c_main_~end~0.base (store (select |c_#memory_$Pointer$.base| c_main_~end~0.base) .cse50 0))) (.cse47 (select (select .cse48 c_main_~list~0.base) .cse49))) (let ((.cse46 (+ .cse47 4)) (.cse45 (select (select .cse44 c_main_~list~0.base) .cse49))) (let ((.cse1 (= .cse45 0)) (.cse2 (= 0 (select (select .cse48 .cse45) .cse46))) (.cse3 (= 0 .cse47)) (.cse0 (= 0 (select (select .cse44 .cse45) .cse46)))) (and (or .cse0 .cse1) (or .cse2 .cse1) (or .cse3 .cse2) (forall ((|v_main_#t~malloc12.base_7| Int)) (let ((.cse11 (+ c_main_~end~0.offset 4))) (let ((.cse10 (let ((.cse13 (store |c_#memory_$Pointer$.offset| c_main_~end~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~end~0.base) .cse11 0)))) (store .cse13 |v_main_#t~malloc12.base_7| (store (select .cse13 |v_main_#t~malloc12.base_7|) 0 0)))) (.cse5 (let ((.cse12 (store |c_#memory_$Pointer$.base| c_main_~end~0.base (store (select |c_#memory_$Pointer$.base| c_main_~end~0.base) .cse11 |v_main_#t~malloc12.base_7|)))) (store .cse12 |v_main_#t~malloc12.base_7| (store (select .cse12 |v_main_#t~malloc12.base_7|) 0 0))))) (let ((.cse6 (select (select .cse5 c_main_~end~0.base) .cse11)) (.cse7 (+ (select (select .cse10 c_main_~end~0.base) .cse11) 4))) (let ((.cse4 (store .cse10 .cse6 (store (select .cse10 .cse6) .cse7 0))) (.cse8 (+ c_main_~list~0.offset 4))) (let ((.cse9 (select (select .cse4 c_main_~list~0.base) .cse8))) (or (<= |v_main_#t~malloc12.base_7| |c_#StackHeapBarrier|) (= 0 (select (select .cse4 (select (select (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 0)) c_main_~list~0.base) .cse8)) (+ .cse9 4))) (not (= 0 (select |c_#valid| |v_main_#t~malloc12.base_7|))) (= 0 |v_main_#t~malloc12.base_7|) (= 0 .cse9)))))))) (forall ((v_prenex_50 Int)) (let ((.cse21 (+ c_main_~end~0.offset 4))) (let ((.cse20 (let ((.cse23 (store |c_#memory_$Pointer$.offset| c_main_~end~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~end~0.base) .cse21 0)))) (store .cse23 v_prenex_50 (store (select .cse23 v_prenex_50) 0 0)))) (.cse17 (let ((.cse22 (store |c_#memory_$Pointer$.base| c_main_~end~0.base (store (select |c_#memory_$Pointer$.base| c_main_~end~0.base) .cse21 v_prenex_50)))) (store .cse22 v_prenex_50 (store (select .cse22 v_prenex_50) 0 0))))) (let ((.cse18 (select (select .cse17 c_main_~end~0.base) .cse21)) (.cse19 (+ (select (select .cse20 c_main_~end~0.base) .cse21) 4)) (.cse16 (+ c_main_~list~0.offset 4))) (let ((.cse14 (select (select (store .cse20 .cse18 (store (select .cse20 .cse18) .cse19 0)) c_main_~list~0.base) .cse16))) (or (not (= 0 (select |c_#valid| v_prenex_50))) (= 0 v_prenex_50) (= 0 .cse14) (= 0 (select (let ((.cse15 (store .cse17 .cse18 (store (select .cse17 .cse18) .cse19 0)))) (select .cse15 (select (select .cse15 c_main_~list~0.base) .cse16))) (+ .cse14 4))) (<= v_prenex_50 |c_#StackHeapBarrier|))))))) (forall ((v_prenex_52 Int)) (let ((.cse31 (+ c_main_~end~0.offset 4))) (let ((.cse27 (let ((.cse33 (store |c_#memory_$Pointer$.offset| c_main_~end~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~end~0.base) .cse31 0)))) (store .cse33 v_prenex_52 (store (select .cse33 v_prenex_52) 0 0)))) (.cse30 (let ((.cse32 (store |c_#memory_$Pointer$.base| c_main_~end~0.base (store (select |c_#memory_$Pointer$.base| c_main_~end~0.base) .cse31 v_prenex_52)))) (store .cse32 v_prenex_52 (store (select .cse32 v_prenex_52) 0 0))))) (let ((.cse28 (select (select .cse30 c_main_~end~0.base) .cse31)) (.cse29 (+ (select (select .cse27 c_main_~end~0.base) .cse31) 4)) (.cse26 (+ c_main_~list~0.offset 4))) (let ((.cse25 (select (select (store .cse30 .cse28 (store (select .cse30 .cse28) .cse29 0)) c_main_~list~0.base) .cse26))) (or (= 0 v_prenex_52) (<= v_prenex_52 |c_#StackHeapBarrier|) (= 0 (let ((.cse24 (store .cse27 .cse28 (store (select .cse27 .cse28) .cse29 0)))) (select (select .cse24 .cse25) (+ (select (select .cse24 c_main_~list~0.base) .cse26) 4)))) (not (= 0 (select |c_#valid| v_prenex_52))) (= .cse25 0))))))) (or .cse3 .cse0) (forall ((v_prenex_51 Int)) (let ((.cse41 (+ c_main_~end~0.offset 4))) (let ((.cse36 (let ((.cse43 (store |c_#memory_$Pointer$.offset| c_main_~end~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~end~0.base) .cse41 0)))) (store .cse43 v_prenex_51 (store (select .cse43 v_prenex_51) 0 0)))) (.cse40 (let ((.cse42 (store |c_#memory_$Pointer$.base| c_main_~end~0.base (store (select |c_#memory_$Pointer$.base| c_main_~end~0.base) .cse41 v_prenex_51)))) (store .cse42 v_prenex_51 (store (select .cse42 v_prenex_51) 0 0))))) (let ((.cse37 (select (select .cse40 c_main_~end~0.base) .cse41)) (.cse38 (+ (select (select .cse36 c_main_~end~0.base) .cse41) 4))) (let ((.cse34 (store .cse40 .cse37 (store (select .cse40 .cse37) .cse38 0))) (.cse39 (+ c_main_~list~0.offset 4))) (let ((.cse35 (select (select .cse34 c_main_~list~0.base) .cse39))) (or (= 0 v_prenex_51) (= 0 (select (select .cse34 .cse35) (+ (select (select (store .cse36 .cse37 (store (select .cse36 .cse37) .cse38 0)) c_main_~list~0.base) .cse39) 4))) (<= v_prenex_51 |c_#StackHeapBarrier|) (not (= 0 (select |c_#valid| v_prenex_51))) (= .cse35 0)))))))))))))) is different from false [2019-10-07 03:50:29,677 WARN L191 SmtUtils]: Spent 17.02 s on a formula simplification. DAG size of input: 197 DAG size of output: 89 [2019-10-07 03:51:02,202 WARN L191 SmtUtils]: Spent 8.17 s on a formula simplification that was a NOOP. DAG size: 164 [2019-10-07 03:51:03,919 WARN L191 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 337 DAG size of output: 113