java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/forester-heap/dll-01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 03:46:48,660 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 03:46:48,663 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 03:46:48,681 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 03:46:48,681 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 03:46:48,683 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 03:46:48,685 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 03:46:48,692 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 03:46:48,694 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 03:46:48,699 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 03:46:48,700 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 03:46:48,701 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 03:46:48,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 03:46:48,703 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 03:46:48,706 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 03:46:48,707 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 03:46:48,709 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 03:46:48,710 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 03:46:48,711 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 03:46:48,716 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 03:46:48,720 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 03:46:48,723 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 03:46:48,725 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 03:46:48,726 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 03:46:48,729 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 03:46:48,729 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 03:46:48,729 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 03:46:48,731 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 03:46:48,732 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 03:46:48,732 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 03:46:48,733 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 03:46:48,734 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 03:46:48,735 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 03:46:48,735 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 03:46:48,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 03:46:48,737 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 03:46:48,737 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 03:46:48,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 03:46:48,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 03:46:48,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 03:46:48,740 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 03:46:48,741 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:46:48,758 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 03:46:48,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 03:46:48,760 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 03:46:48,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 03:46:48,760 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 03:46:48,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 03:46:48,761 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 03:46:48,761 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 03:46:48,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 03:46:48,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 03:46:48,762 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 03:46:48,762 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 03:46:48,763 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 03:46:48,763 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 03:46:48,763 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 03:46:48,763 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 03:46:48,764 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 03:46:48,764 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 03:46:48,764 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 03:46:48,764 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 03:46:48,764 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 03:46:48,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 03:46:48,765 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 03:46:48,765 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 03:46:48,765 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 03:46:48,765 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 03:46:48,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 03:46:48,766 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 03:46:48,766 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:46:49,079 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 03:46:49,097 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 03:46:49,103 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 03:46:49,106 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 03:46:49,106 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 03:46:49,107 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-01-2.i [2019-10-07 03:46:49,178 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f5ee4e9b/dd87b58aea534e72b04aee1fd04ddc23/FLAGf2416b64e [2019-10-07 03:46:49,695 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 03:46:49,696 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i [2019-10-07 03:46:49,707 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f5ee4e9b/dd87b58aea534e72b04aee1fd04ddc23/FLAGf2416b64e [2019-10-07 03:46:50,005 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f5ee4e9b/dd87b58aea534e72b04aee1fd04ddc23 [2019-10-07 03:46:50,015 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 03:46:50,017 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 03:46:50,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 03:46:50,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 03:46:50,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 03:46:50,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:46:50" (1/1) ... [2019-10-07 03:46:50,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fb49e93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:46:50, skipping insertion in model container [2019-10-07 03:46:50,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:46:50" (1/1) ... [2019-10-07 03:46:50,033 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 03:46:50,103 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 03:46:50,623 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:46:50,633 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 03:46:50,703 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:46:50,746 INFO L192 MainTranslator]: Completed translation [2019-10-07 03:46:50,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:46:50 WrapperNode [2019-10-07 03:46:50,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 03:46:50,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 03:46:50,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 03:46:50,747 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 03:46:50,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:46:50" (1/1) ... [2019-10-07 03:46:50,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:46:50" (1/1) ... [2019-10-07 03:46:50,779 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:46:50" (1/1) ... [2019-10-07 03:46:50,780 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:46:50" (1/1) ... [2019-10-07 03:46:50,798 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:46:50" (1/1) ... [2019-10-07 03:46:50,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:46:50" (1/1) ... [2019-10-07 03:46:50,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:46:50" (1/1) ... [2019-10-07 03:46:50,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 03:46:50,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 03:46:50,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 03:46:50,819 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 03:46:50,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:46:50" (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:46:50,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 03:46:50,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 03:46:50,879 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 03:46:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-07 03:46:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-07 03:46:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-07 03:46:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-07 03:46:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-07 03:46:50,882 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-07 03:46:50,882 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-07 03:46:50,882 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-07 03:46:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-07 03:46:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-07 03:46:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-07 03:46:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-07 03:46:50,884 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-07 03:46:50,886 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-07 03:46:50,886 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-07 03:46:50,886 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-07 03:46:50,886 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-07 03:46:50,887 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-07 03:46:50,887 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-07 03:46:50,887 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-07 03:46:50,888 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-07 03:46:50,888 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-07 03:46:50,889 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-07 03:46:50,889 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-07 03:46:50,890 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-07 03:46:50,890 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-07 03:46:50,890 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-07 03:46:50,890 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-07 03:46:50,890 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-07 03:46:50,890 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-07 03:46:50,890 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-07 03:46:50,890 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-07 03:46:50,891 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-07 03:46:50,891 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-07 03:46:50,891 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-07 03:46:50,891 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-07 03:46:50,891 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-07 03:46:50,891 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-07 03:46:50,891 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-07 03:46:50,891 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-07 03:46:50,891 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-07 03:46:50,892 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-07 03:46:50,892 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-07 03:46:50,892 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-07 03:46:50,892 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-07 03:46:50,892 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-07 03:46:50,892 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-07 03:46:50,892 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-07 03:46:50,893 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-07 03:46:50,893 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-07 03:46:50,893 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 03:46:50,893 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-07 03:46:50,893 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-07 03:46:50,893 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-07 03:46:50,893 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-07 03:46:50,893 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-07 03:46:50,893 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-07 03:46:50,894 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-07 03:46:50,894 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-07 03:46:50,894 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-07 03:46:50,894 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-07 03:46:50,894 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-07 03:46:50,894 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-07 03:46:50,894 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 03:46:50,894 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-07 03:46:50,895 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-07 03:46:50,895 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-07 03:46:50,895 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-07 03:46:50,895 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-07 03:46:50,895 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-07 03:46:50,895 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-07 03:46:50,895 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-07 03:46:50,896 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-07 03:46:50,896 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-07 03:46:50,896 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-07 03:46:50,896 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-07 03:46:50,896 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-07 03:46:50,896 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-07 03:46:50,896 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-07 03:46:50,897 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-07 03:46:50,897 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-07 03:46:50,897 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-07 03:46:50,897 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-07 03:46:50,897 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-07 03:46:50,897 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-07 03:46:50,898 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-07 03:46:50,898 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-07 03:46:50,898 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-07 03:46:50,898 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-07 03:46:50,898 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-07 03:46:50,898 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-07 03:46:50,898 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-07 03:46:50,898 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-07 03:46:50,898 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-07 03:46:50,899 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-07 03:46:50,899 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-07 03:46:50,899 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-07 03:46:50,899 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-07 03:46:50,899 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-07 03:46:50,899 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-07 03:46:50,899 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-07 03:46:50,899 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-07 03:46:50,899 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-07 03:46:50,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 03:46:50,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 03:46:50,900 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 03:46:50,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 03:46:50,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 03:46:50,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 03:46:50,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 03:46:50,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 03:46:50,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 03:46:51,709 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 03:46:51,710 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-10-07 03:46:51,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:46:51 BoogieIcfgContainer [2019-10-07 03:46:51,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 03:46:51,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 03:46:51,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 03:46:51,717 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 03:46:51,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:46:50" (1/3) ... [2019-10-07 03:46:51,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20114a2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:46:51, skipping insertion in model container [2019-10-07 03:46:51,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:46:50" (2/3) ... [2019-10-07 03:46:51,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20114a2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:46:51, skipping insertion in model container [2019-10-07 03:46:51,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:46:51" (3/3) ... [2019-10-07 03:46:51,720 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-01-2.i [2019-10-07 03:46:51,730 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 03:46:51,738 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-10-07 03:46:51,750 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-10-07 03:46:51,776 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 03:46:51,776 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 03:46:51,776 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 03:46:51,777 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 03:46:51,778 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 03:46:51,779 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 03:46:51,779 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 03:46:51,780 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 03:46:51,805 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-10-07 03:46:51,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-10-07 03:46:51,811 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:46:51,812 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:46:51,815 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:46:51,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:46:51,825 INFO L82 PathProgramCache]: Analyzing trace with hash -445938275, now seen corresponding path program 1 times [2019-10-07 03:46:51,834 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:46:51,834 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:46:51,834 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:46:51,834 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:46:51,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:46:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:46:52,023 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:46:52,024 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:46:52,025 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:46:52,026 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 03:46:52,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 03:46:52,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 03:46:52,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:46:52,042 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 3 states. [2019-10-07 03:46:52,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:46:52,114 INFO L93 Difference]: Finished difference Result 171 states and 270 transitions. [2019-10-07 03:46:52,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 03:46:52,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-10-07 03:46:52,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:46:52,126 INFO L225 Difference]: With dead ends: 171 [2019-10-07 03:46:52,126 INFO L226 Difference]: Without dead ends: 93 [2019-10-07 03:46:52,130 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:46:52,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-07 03:46:52,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2019-10-07 03:46:52,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-07 03:46:52,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-10-07 03:46:52,171 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 7 [2019-10-07 03:46:52,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:46:52,172 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-10-07 03:46:52,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 03:46:52,172 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2019-10-07 03:46:52,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 03:46:52,172 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:46:52,173 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:46:52,173 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:46:52,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:46:52,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1701000262, now seen corresponding path program 1 times [2019-10-07 03:46:52,174 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:46:52,174 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:46:52,174 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:46:52,174 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:46:52,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:46:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:46:52,264 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:46:52,264 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:46:52,265 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:46:52,265 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 03:46:52,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 03:46:52,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 03:46:52,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:46:52,267 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 3 states. [2019-10-07 03:46:52,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:46:52,276 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-10-07 03:46:52,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 03:46:52,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-07 03:46:52,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:46:52,278 INFO L225 Difference]: With dead ends: 75 [2019-10-07 03:46:52,278 INFO L226 Difference]: Without dead ends: 73 [2019-10-07 03:46:52,279 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:46:52,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-07 03:46:52,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-10-07 03:46:52,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-07 03:46:52,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-10-07 03:46:52,289 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 11 [2019-10-07 03:46:52,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:46:52,289 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-10-07 03:46:52,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 03:46:52,290 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-10-07 03:46:52,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-07 03:46:52,290 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:46:52,291 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:46:52,291 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:46:52,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:46:52,291 INFO L82 PathProgramCache]: Analyzing trace with hash 781316733, now seen corresponding path program 1 times [2019-10-07 03:46:52,292 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:46:52,292 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:46:52,292 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:46:52,292 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:46:52,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:46:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:46:52,468 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:46:52,469 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:46:52,469 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:46:52,469 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 03:46:52,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 03:46:52,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 03:46:52,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:46:52,470 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 6 states. [2019-10-07 03:46:52,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:46:52,624 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2019-10-07 03:46:52,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 03:46:52,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-07 03:46:52,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:46:52,626 INFO L225 Difference]: With dead ends: 131 [2019-10-07 03:46:52,626 INFO L226 Difference]: Without dead ends: 107 [2019-10-07 03:46:52,627 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-07 03:46:52,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-07 03:46:52,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 68. [2019-10-07 03:46:52,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-07 03:46:52,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-10-07 03:46:52,636 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 16 [2019-10-07 03:46:52,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:46:52,636 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-10-07 03:46:52,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 03:46:52,637 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-10-07 03:46:52,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 03:46:52,637 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:46:52,638 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:46:52,638 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:46:52,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:46:52,640 INFO L82 PathProgramCache]: Analyzing trace with hash -52979580, now seen corresponding path program 1 times [2019-10-07 03:46:52,640 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:46:52,640 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:46:52,640 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:46:52,641 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:46:52,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:46:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:46:52,725 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:46:52,725 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:46:52,726 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:46:52,726 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 03:46:52,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 03:46:52,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 03:46:52,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:46:52,727 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 3 states. [2019-10-07 03:46:52,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:46:52,747 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-10-07 03:46:52,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 03:46:52,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-07 03:46:52,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:46:52,750 INFO L225 Difference]: With dead ends: 68 [2019-10-07 03:46:52,750 INFO L226 Difference]: Without dead ends: 66 [2019-10-07 03:46:52,751 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:46:52,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-07 03:46:52,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-10-07 03:46:52,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-07 03:46:52,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-10-07 03:46:52,757 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 21 [2019-10-07 03:46:52,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:46:52,758 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-10-07 03:46:52,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 03:46:52,758 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-10-07 03:46:52,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 03:46:52,759 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:46:52,759 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:46:52,759 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:46:52,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:46:52,760 INFO L82 PathProgramCache]: Analyzing trace with hash -52970068, now seen corresponding path program 1 times [2019-10-07 03:46:52,760 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:46:52,760 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:46:52,760 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:46:52,761 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:46:52,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:46:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:46:52,799 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:46:52,799 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:46:52,800 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:46:52,800 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 03:46:52,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 03:46:52,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 03:46:52,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:46:52,801 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 3 states. [2019-10-07 03:46:52,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:46:52,814 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2019-10-07 03:46:52,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 03:46:52,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-07 03:46:52,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:46:52,818 INFO L225 Difference]: With dead ends: 91 [2019-10-07 03:46:52,818 INFO L226 Difference]: Without dead ends: 89 [2019-10-07 03:46:52,819 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:46:52,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-07 03:46:52,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 68. [2019-10-07 03:46:52,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-07 03:46:52,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2019-10-07 03:46:52,826 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 21 [2019-10-07 03:46:52,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:46:52,826 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2019-10-07 03:46:52,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 03:46:52,826 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2019-10-07 03:46:52,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-07 03:46:52,830 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:46:52,830 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:46:52,830 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:46:52,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:46:52,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1706116094, now seen corresponding path program 1 times [2019-10-07 03:46:52,831 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:46:52,831 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:46:52,831 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:46:52,831 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:46:52,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:46:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:46:52,914 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:46:52,915 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:46:52,915 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:46:52,915 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 03:46:52,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 03:46:52,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 03:46:52,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:46:52,917 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 3 states. [2019-10-07 03:46:52,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:46:52,923 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2019-10-07 03:46:52,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 03:46:52,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-07 03:46:52,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:46:52,926 INFO L225 Difference]: With dead ends: 68 [2019-10-07 03:46:52,926 INFO L226 Difference]: Without dead ends: 66 [2019-10-07 03:46:52,926 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:46:52,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-07 03:46:52,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-10-07 03:46:52,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-07 03:46:52,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2019-10-07 03:46:52,938 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 22 [2019-10-07 03:46:52,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:46:52,939 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2019-10-07 03:46:52,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 03:46:52,939 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2019-10-07 03:46:52,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-07 03:46:52,940 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:46:52,940 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:46:52,941 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:46:52,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:46:52,944 INFO L82 PathProgramCache]: Analyzing trace with hash -2057575781, now seen corresponding path program 1 times [2019-10-07 03:46:52,944 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:46:52,944 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:46:52,944 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:46:52,944 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:46:52,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:46:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:46:53,383 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:46:53,383 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:46:53,384 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:46:53,384 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 03:46:53,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 03:46:53,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 03:46:53,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-07 03:46:53,385 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 9 states. [2019-10-07 03:46:53,783 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-10-07 03:46:53,933 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-10-07 03:46:54,154 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-10-07 03:46:54,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:46:54,471 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2019-10-07 03:46:54,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 03:46:54,472 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-10-07 03:46:54,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:46:54,479 INFO L225 Difference]: With dead ends: 152 [2019-10-07 03:46:54,480 INFO L226 Difference]: Without dead ends: 150 [2019-10-07 03:46:54,480 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2019-10-07 03:46:54,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-10-07 03:46:54,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 83. [2019-10-07 03:46:54,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-07 03:46:54,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2019-10-07 03:46:54,499 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 24 [2019-10-07 03:46:54,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:46:54,500 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2019-10-07 03:46:54,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 03:46:54,500 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2019-10-07 03:46:54,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-07 03:46:54,501 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:46:54,501 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:46:54,501 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:46:54,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:46:54,502 INFO L82 PathProgramCache]: Analyzing trace with hash 537268982, now seen corresponding path program 1 times [2019-10-07 03:46:54,502 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:46:54,502 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:46:54,502 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:46:54,502 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:46:54,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:46:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:46:54,789 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:46:54,789 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:46:54,789 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:46:54,790 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 03:46:54,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 03:46:54,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 03:46:54,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-07 03:46:54,791 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 9 states. [2019-10-07 03:46:55,167 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-10-07 03:46:55,308 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-10-07 03:46:55,628 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-10-07 03:46:55,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:46:55,851 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2019-10-07 03:46:55,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 03:46:55,851 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-10-07 03:46:55,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:46:55,853 INFO L225 Difference]: With dead ends: 161 [2019-10-07 03:46:55,853 INFO L226 Difference]: Without dead ends: 159 [2019-10-07 03:46:55,854 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2019-10-07 03:46:55,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-07 03:46:55,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 90. [2019-10-07 03:46:55,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-07 03:46:55,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-10-07 03:46:55,863 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 27 [2019-10-07 03:46:55,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:46:55,863 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-10-07 03:46:55,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 03:46:55,863 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-10-07 03:46:55,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-07 03:46:55,864 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:46:55,865 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:46:55,865 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:46:55,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:46:55,865 INFO L82 PathProgramCache]: Analyzing trace with hash 272164207, now seen corresponding path program 1 times [2019-10-07 03:46:55,866 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:46:55,866 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:46:55,866 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:46:55,866 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:46:55,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:46:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:46:55,907 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:46:55,908 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:46:55,908 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:46:55,908 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 03:46:55,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 03:46:55,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 03:46:55,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:46:55,909 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 3 states. [2019-10-07 03:46:55,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:46:55,948 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2019-10-07 03:46:55,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 03:46:55,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-07 03:46:55,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:46:55,949 INFO L225 Difference]: With dead ends: 91 [2019-10-07 03:46:55,949 INFO L226 Difference]: Without dead ends: 89 [2019-10-07 03:46:55,950 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:46:55,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-07 03:46:55,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-10-07 03:46:55,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-07 03:46:55,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2019-10-07 03:46:55,957 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 27 [2019-10-07 03:46:55,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:46:55,957 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2019-10-07 03:46:55,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 03:46:55,957 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2019-10-07 03:46:55,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-07 03:46:55,959 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:46:55,959 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:46:55,959 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:46:55,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:46:55,960 INFO L82 PathProgramCache]: Analyzing trace with hash -841141344, now seen corresponding path program 1 times [2019-10-07 03:46:55,960 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:46:55,960 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:46:55,960 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:46:55,960 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:46:55,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:46:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:46:56,069 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:46:56,070 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:46:56,070 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:46:56,070 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:46:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:46:56,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-07 03:46:56,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:46:56,245 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:46:56,245 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:46:56,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:46:56,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:46:56,272 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2019-10-07 03:46:56,272 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:46:56,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:46:56,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:46:56,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2019-10-07 03:46:56,294 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-07 03:46:56,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:46:56,306 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:46:56,306 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:42, output treesize:41 [2019-10-07 03:46:56,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:46:56,355 INFO L392 ElimStorePlain]: Different costs {0=[|v_#valid_32|], 1=[v_prenex_1]} [2019-10-07 03:46:56,370 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 67 treesize of output 65 [2019-10-07 03:46:56,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:46:56,592 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-10-07 03:46:56,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:46:56,620 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:46:56,620 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 392 treesize of output 396 [2019-10-07 03:46:56,622 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:46:56,786 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-10-07 03:46:56,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:46:56,793 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_50|, |v_#memory_$Pointer$.offset_50|], 26=[v_prenex_2, v_prenex_3]} [2019-10-07 03:46:56,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:46:56,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:46:56,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:46:56,831 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 64 [2019-10-07 03:46:56,832 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-07 03:46:57,003 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-10-07 03:46:57,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:46:57,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:46:57,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:46:57,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:46:57,035 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 60 [2019-10-07 03:46:57,036 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-07 03:46:57,336 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-10-07 03:46:57,337 INFO L567 ElimStorePlain]: treesize reduction 8, result has 98.2 percent of original size [2019-10-07 03:46:57,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:46:57,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:46:57,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:46:57,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:46:57,524 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-10-07 03:46:57,524 INFO L341 Elim1Store]: treesize reduction 226, result has 52.8 percent of original size [2019-10-07 03:46:57,525 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 176 treesize of output 391 [2019-10-07 03:46:57,527 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-07 03:46:57,701 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-10-07 03:46:57,701 INFO L567 ElimStorePlain]: treesize reduction 220, result has 50.0 percent of original size [2019-10-07 03:46:57,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:46:57,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:46:57,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:46:57,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:46:57,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:46:57,728 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-07 03:46:57,772 INFO L341 Elim1Store]: treesize reduction 18, result has 64.7 percent of original size [2019-10-07 03:46:57,773 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 104 [2019-10-07 03:46:57,774 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-07 03:46:57,883 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-10-07 03:46:57,884 INFO L567 ElimStorePlain]: treesize reduction 16, result has 89.5 percent of original size [2019-10-07 03:46:57,885 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:46:57,885 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:460, output treesize:152 [2019-10-07 03:46:58,163 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-10-07 03:46:58,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:46:58,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:46:58,176 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:46:58,176 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 13 [2019-10-07 03:46:58,177 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:46:58,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:46:58,181 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:46:58,181 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2019-10-07 03:46:58,189 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:46:58,189 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:46:58,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:46:58,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:46:58,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:47:00,315 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_main_~list~0.offset 8))) (and (forall ((|v_main_#t~malloc2.base_7| Int)) (let ((.cse1 (+ c_main_~list~0.offset 8))) (let ((.cse0 (select (let ((.cse2 (let ((.cse5 (store |c_#memory_$Pointer$.base| c_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) .cse1 |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 ((.cse3 (select (select .cse2 c_main_~list~0.base) .cse1))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| c_main_~list~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~list~0.base) .cse1 0)))) (store .cse4 |v_main_#t~malloc2.base_7| (store (select .cse4 |v_main_#t~malloc2.base_7|) 0 0))) c_main_~list~0.base) .cse1) 8) 0)))) c_main_~list~0.base))) (or (= 0 (select .cse0 c_main_~list~0.offset)) (not (= (select |c_#valid| |v_main_#t~malloc2.base_7|) 0)) (not (= 0 (select .cse0 .cse1))) (= |v_main_#t~malloc2.base_7| 0))))) (= (select (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) .cse6 0) c_main_~list~0.offset) 0) (= (select (store (select |c_#memory_$Pointer$.offset| c_main_~list~0.base) .cse6 0) c_main_~list~0.offset) 0) (forall ((v_prenex_4 Int)) (let ((.cse10 (+ c_main_~list~0.offset 8))) (let ((.cse11 (let ((.cse13 (store |c_#memory_$Pointer$.offset| c_main_~list~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~list~0.base) .cse10 0)))) (store .cse13 v_prenex_4 (store (select .cse13 v_prenex_4) 0 0)))) (.cse7 (let ((.cse12 (store |c_#memory_$Pointer$.base| c_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) .cse10 v_prenex_4)))) (store .cse12 v_prenex_4 (store (select .cse12 v_prenex_4) 0 0))))) (let ((.cse8 (select (select .cse7 c_main_~list~0.base) .cse10)) (.cse9 (+ (select (select .cse11 c_main_~list~0.base) .cse10) 8))) (or (= v_prenex_4 0) (not (= (select |c_#valid| v_prenex_4) 0)) (not (= 0 (select (select (store .cse7 .cse8 (store (select .cse7 .cse8) .cse9 0)) c_main_~list~0.base) .cse10))) (= (select (select (store .cse11 .cse8 (store (select .cse11 .cse8) .cse9 0)) c_main_~list~0.base) c_main_~list~0.offset) 0)))))))) is different from false [2019-10-07 03:47:00,357 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:47:00,357 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 03:47:00,380 INFO L162 IcfgInterpreter]: Started Sifa with 28 locations of interest [2019-10-07 03:47:00,381 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 03:47:00,386 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 03:47:00,393 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 03:47:00,394 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 03:47:00,480 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2019-10-07 03:47:01,019 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 03:47:01,032 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 03:47:01,032 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 03:47:01,032 INFO L193 IcfgInterpreter]: Reachable states at location L1027-3 satisfy 252#(and (<= 1 main_~len~0) (<= main_~len~0 1) (= main_~len~0 1)) [2019-10-07 03:47:01,033 INFO L193 IcfgInterpreter]: Reachable states at location L995-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:47:01,033 INFO L193 IcfgInterpreter]: Reachable states at location L995-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:47:01,033 INFO L193 IcfgInterpreter]: Reachable states at location L995-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:47:01,034 INFO L193 IcfgInterpreter]: Reachable states at location L1032-2 satisfy 238#(and (<= 0 main_~inner~0.offset) (<= main_~len~0 0) (<= main_~inner~0.base 0) (<= 0 main_~len~0) (<= 0 main_~inner~0.base) (or (and (= 0 main_~inner~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)) main_~inner~0.offset) (= main_~len~0 0) (not (= main_~end~0.offset 0)) (<= main_~len~0 1) (= main_~inner~0.base 0) (= main_~inner~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (and (= 0 main_~inner~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)) main_~inner~0.offset) (= main_~len~0 0) (not (= 0 main_~end~0.base)) (<= main_~len~0 1) (= main_~inner~0.base 0) (= main_~inner~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))) (<= main_~inner~0.offset 0)) [2019-10-07 03:47:01,034 INFO L193 IcfgInterpreter]: Reachable states at location L1021-2 satisfy 228#(and (<= main_~len~0 0) (or (and (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)) main_~inner~0.offset) (= main_~len~0 0) (not (= main_~end~0.offset 0)) (= main_~inner~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (and (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)) main_~inner~0.offset) (= main_~len~0 0) (not (= 0 main_~end~0.base)) (= main_~inner~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))) (<= 0 main_~len~0)) [2019-10-07 03:47:01,034 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:47:01,035 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:47:01,035 INFO L193 IcfgInterpreter]: Reachable states at location L1032-3 satisfy 233#(and (<= 0 main_~inner~0.offset) (<= main_~len~0 0) (<= main_~inner~0.base 0) (<= 0 main_~len~0) (<= 0 main_~inner~0.base) (or (and (= 0 main_~inner~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)) main_~inner~0.offset) (= main_~len~0 0) (not (= main_~end~0.offset 0)) (= main_~inner~0.base 0) (= main_~inner~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (and (= 0 main_~inner~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)) main_~inner~0.offset) (= main_~len~0 0) (not (= 0 main_~end~0.base)) (= main_~inner~0.base 0) (= main_~inner~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))) (<= main_~inner~0.offset 0)) [2019-10-07 03:47:01,035 INFO L193 IcfgInterpreter]: Reachable states at location L1032-4 satisfy 243#(and (<= 0 main_~inner~0.offset) (<= main_~len~0 0) (<= main_~inner~0.base 0) (<= 0 main_~len~0) (<= 0 main_~inner~0.base) (or (and (= 0 main_~inner~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)) main_~inner~0.offset) (= main_~len~0 0) (not (= main_~end~0.offset 0)) (<= main_~len~0 1) (= main_~inner~0.base 0) (= main_~inner~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (and (= 0 main_~inner~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)) main_~inner~0.offset) (= main_~len~0 0) (not (= 0 main_~end~0.base)) (<= main_~len~0 1) (= main_~inner~0.base 0) (= main_~inner~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))) (<= main_~inner~0.offset 0)) [2019-10-07 03:47:01,036 INFO L193 IcfgInterpreter]: Reachable states at location L1028 satisfy 279#(and (<= 1 main_~len~0) (<= main_~len~0 1) (= main_~len~0 1)) [2019-10-07 03:47:01,036 INFO L193 IcfgInterpreter]: Reachable states at location L1028-1 satisfy 292#(and (<= 1 main_~len~0) (<= main_~len~0 1) (= main_~len~0 1)) [2019-10-07 03:47:01,036 INFO L193 IcfgInterpreter]: Reachable states at location L1017-1 satisfy 223#true [2019-10-07 03:47:01,037 INFO L193 IcfgInterpreter]: Reachable states at location L995-3 satisfy 43#(and (<= 0 |main_#t~malloc0.offset|) (or (and (= 0 |#NULL.base|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0)) |#memory_$Pointer$.offset|) (= 0 |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (= 0 (select |old(#valid)| 0)) (not (= main_~list~0.offset 0)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |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 (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0))) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)) (and (= 0 |#NULL.base|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0)) |#memory_$Pointer$.offset|) (= 0 |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (= 0 (select |old(#valid)| 0)) (not (= 0 main_~list~0.base)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |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 (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0))) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|))) (<= |#NULL.base| 0) (<= 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:47:01,037 INFO L193 IcfgInterpreter]: Reachable states at location L1028-4 satisfy 270#(and (<= 1 main_~len~0) (<= main_~len~0 1) (= main_~len~0 1)) [2019-10-07 03:47:01,037 INFO L193 IcfgInterpreter]: Reachable states at location L995-4 satisfy 38#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0)) |#memory_$Pointer$.offset|) (= 0 |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (<= 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|) (= |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 (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0))) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)) [2019-10-07 03:47:01,038 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 309#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 03:47:01,038 INFO L193 IcfgInterpreter]: Reachable states at location L1015-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:47:01,038 INFO L193 IcfgInterpreter]: Reachable states at location L995-5 satisfy 48#(and (<= 0 |main_#t~malloc0.offset|) (or (and (= 0 |#NULL.base|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0)) |#memory_$Pointer$.offset|) (= 0 |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (= 0 (select |old(#valid)| 0)) (not (= main_~list~0.offset 0)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |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 (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0))) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)) (and (= 0 |#NULL.base|) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0)) |#memory_$Pointer$.offset|) (= 0 |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (= 0 (select |old(#valid)| 0)) (not (= 0 main_~list~0.base)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |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 (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0))) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|))) (<= |#NULL.base| 0) (<= 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:47:01,039 INFO L193 IcfgInterpreter]: Reachable states at location L1015-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:47:01,039 INFO L193 IcfgInterpreter]: Reachable states at location mainErr7ASSERT_VIOLATIONERROR_FUNCTION satisfy 305#(and (<= 1 main_~len~0) (<= main_~len~0 1) (= main_~len~0 1)) [2019-10-07 03:47:01,039 INFO L193 IcfgInterpreter]: Reachable states at location L1000-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:47:01,039 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 314#(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:47:01,040 INFO L193 IcfgInterpreter]: Reachable states at location L1000-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:47:01,040 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 03:47:01,040 INFO L193 IcfgInterpreter]: Reachable states at location L995-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:47:01,041 INFO L193 IcfgInterpreter]: Reachable states at location L1008-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:47:01,041 INFO L193 IcfgInterpreter]: Reachable states at location L1027-2 satisfy 261#(and (<= 1 main_~len~0) (<= main_~len~0 1) (= main_~len~0 1)) [2019-10-07 03:47:01,424 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-10-07 03:47:02,016 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 03:47:02,016 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8, 12] total 26 [2019-10-07 03:47:02,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-07 03:47:02,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-07 03:47:02,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=520, Unknown=1, NotChecked=46, Total=650 [2019-10-07 03:47:02,018 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 26 states. [2019-10-07 03:47:04,134 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~list~0.offset 8)) (.cse1 (+ c_main_~list~0.offset 4))) (and (= (select (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) .cse0 0) c_main_~list~0.offset) 0) (= (store |c_old(#memory_$Pointer$.offset)| c_main_~list~0.base (store (store (select |c_old(#memory_$Pointer$.offset)| c_main_~list~0.base) c_main_~list~0.offset 0) .cse1 0)) |c_#memory_$Pointer$.offset|) (<= |c_#NULL.base| 0) (= |c_#length| (store |c_old(#length)| |c_main_#t~malloc0.base| 12)) (= (select (store (select |c_#memory_$Pointer$.offset| c_main_~list~0.base) .cse0 0) c_main_~list~0.offset) 0) (<= 0 |c_#NULL.base|) (= 0 (select |c_old(#valid)| 0)) (forall ((|v_main_#t~malloc2.base_7| Int)) (let ((.cse3 (+ c_main_~list~0.offset 8))) (let ((.cse2 (select (let ((.cse4 (let ((.cse7 (store |c_#memory_$Pointer$.base| c_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) .cse3 |v_main_#t~malloc2.base_7|)))) (store .cse7 |v_main_#t~malloc2.base_7| (store (select .cse7 |v_main_#t~malloc2.base_7|) 0 0))))) (let ((.cse5 (select (select .cse4 c_main_~list~0.base) .cse3))) (store .cse4 .cse5 (store (select .cse4 .cse5) (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| c_main_~list~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~list~0.base) .cse3 0)))) (store .cse6 |v_main_#t~malloc2.base_7| (store (select .cse6 |v_main_#t~malloc2.base_7|) 0 0))) c_main_~list~0.base) .cse3) 8) 0)))) c_main_~list~0.base))) (or (= 0 (select .cse2 c_main_~list~0.offset)) (not (= (select |c_#valid| |v_main_#t~malloc2.base_7|) 0)) (not (= 0 (select .cse2 .cse3))) (= |v_main_#t~malloc2.base_7| 0))))) (= c_main_~list~0.offset |c_main_#t~malloc0.offset|) (= |c_main_#t~malloc0.base| c_main_~list~0.base) (<= 0 c_main_~list~0.offset) (= (select |c_old(#valid)| |c_main_#t~malloc0.base|) 0) (< |c_#StackHeapBarrier| |c_main_#t~malloc0.base|) (= |c_#NULL.offset| 0) (not (= |c_main_#t~malloc0.base| 0)) (<= c_main_~list~0.offset 0) (forall ((v_prenex_4 Int)) (let ((.cse11 (+ c_main_~list~0.offset 8))) (let ((.cse12 (let ((.cse14 (store |c_#memory_$Pointer$.offset| c_main_~list~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~list~0.base) .cse11 0)))) (store .cse14 v_prenex_4 (store (select .cse14 v_prenex_4) 0 0)))) (.cse8 (let ((.cse13 (store |c_#memory_$Pointer$.base| c_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) .cse11 v_prenex_4)))) (store .cse13 v_prenex_4 (store (select .cse13 v_prenex_4) 0 0))))) (let ((.cse9 (select (select .cse8 c_main_~list~0.base) .cse11)) (.cse10 (+ (select (select .cse12 c_main_~list~0.base) .cse11) 8))) (or (= v_prenex_4 0) (not (= (select |c_#valid| v_prenex_4) 0)) (not (= 0 (select (select (store .cse8 .cse9 (store (select .cse8 .cse9) .cse10 0)) c_main_~list~0.base) .cse11))) (= (select (select (store .cse12 .cse9 (store (select .cse12 .cse9) .cse10 0)) c_main_~list~0.base) c_main_~list~0.offset) 0)))))) (= (store |c_old(#valid)| |c_main_#t~malloc0.base| 1) |c_#valid|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| c_main_~list~0.base (store (store (select |c_old(#memory_$Pointer$.base)| c_main_~list~0.base) c_main_~list~0.offset 0) .cse1 0))))) is different from false [2019-10-07 03:47:04,322 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-10-07 03:47:04,683 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2019-10-07 03:47:05,031 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2019-10-07 03:47:05,567 WARN L191 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2019-10-07 03:47:05,909 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 83 [2019-10-07 03:47:06,232 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2019-10-07 03:47:06,570 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-10-07 03:47:06,812 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-10-07 03:47:07,293 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2019-10-07 03:47:07,876 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-10-07 03:47:08,152 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-10-07 03:47:08,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:47:08,650 INFO L93 Difference]: Finished difference Result 290 states and 318 transitions. [2019-10-07 03:47:08,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-07 03:47:08,650 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 29 [2019-10-07 03:47:08,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:47:08,652 INFO L225 Difference]: With dead ends: 290 [2019-10-07 03:47:08,652 INFO L226 Difference]: Without dead ends: 252 [2019-10-07 03:47:08,657 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=330, Invalid=1932, Unknown=2, NotChecked=186, Total=2450 [2019-10-07 03:47:08,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-10-07 03:47:08,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 106. [2019-10-07 03:47:08,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-07 03:47:08,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2019-10-07 03:47:08,675 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 29 [2019-10-07 03:47:08,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:47:08,675 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2019-10-07 03:47:08,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-07 03:47:08,676 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2019-10-07 03:47:08,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-07 03:47:08,679 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:47:08,680 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:47:08,880 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:47:08,881 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:47:08,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:47:08,881 INFO L82 PathProgramCache]: Analyzing trace with hash -850180374, now seen corresponding path program 1 times [2019-10-07 03:47:08,882 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:47:08,882 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:47:08,882 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:47:08,882 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:47:08,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:47:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:47:09,118 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:47:09,118 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:47:09,119 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:47:09,119 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:47:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:47:09,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-07 03:47:09,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:47:09,321 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:47:09,321 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:47:09,374 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:47:09,374 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 03:47:09,375 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 13 [2019-10-07 03:47:09,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 03:47:09,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 03:47:09,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-10-07 03:47:09,376 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 6 states. [2019-10-07 03:47:09,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:47:09,640 INFO L93 Difference]: Finished difference Result 194 states and 221 transitions. [2019-10-07 03:47:09,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 03:47:09,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-10-07 03:47:09,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:47:09,642 INFO L225 Difference]: With dead ends: 194 [2019-10-07 03:47:09,642 INFO L226 Difference]: Without dead ends: 178 [2019-10-07 03:47:09,642 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-10-07 03:47:09,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-10-07 03:47:09,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 139. [2019-10-07 03:47:09,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-10-07 03:47:09,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 163 transitions. [2019-10-07 03:47:09,654 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 163 transitions. Word has length 30 [2019-10-07 03:47:09,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:47:09,654 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 163 transitions. [2019-10-07 03:47:09,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 03:47:09,655 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 163 transitions. [2019-10-07 03:47:09,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-07 03:47:09,658 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:47:09,658 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:47:09,861 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:47:09,862 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:47:09,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:47:09,863 INFO L82 PathProgramCache]: Analyzing trace with hash 729412443, now seen corresponding path program 1 times [2019-10-07 03:47:09,863 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:47:09,864 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:47:09,864 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:47:09,864 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:47:09,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:47:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:47:09,972 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:47:09,972 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:47:09,972 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:47:09,973 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:47:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:47:10,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-07 03:47:10,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:47:10,166 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:47:10,166 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:47:10,251 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:47:10,252 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 03:47:10,254 INFO L162 IcfgInterpreter]: Started Sifa with 31 locations of interest [2019-10-07 03:47:10,254 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 03:47:10,254 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 03:47:10,255 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 03:47:10,255 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 03:47:10,297 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2019-10-07 03:47:10,706 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 03:47:10,709 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 03:47:10,709 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 03:47:10,710 INFO L193 IcfgInterpreter]: Reachable states at location L995-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:47:10,710 INFO L193 IcfgInterpreter]: Reachable states at location L1045 satisfy 311#true [2019-10-07 03:47:10,710 INFO L193 IcfgInterpreter]: Reachable states at location L995-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:47:10,710 INFO L193 IcfgInterpreter]: Reachable states at location L1045-1 satisfy 324#true [2019-10-07 03:47:10,711 INFO L193 IcfgInterpreter]: Reachable states at location L995-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:47:10,711 INFO L193 IcfgInterpreter]: Reachable states at location L1045-4 satisfy 302#true [2019-10-07 03:47:10,711 INFO L193 IcfgInterpreter]: Reachable states at location L1032-2 satisfy 238#(and (<= 0 main_~inner~0.offset) (<= main_~len~0 0) (<= main_~inner~0.base 0) (<= 0 main_~len~0) (<= 0 main_~inner~0.base) (or (and (= 0 main_~inner~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)) main_~inner~0.offset) (= main_~len~0 0) (not (= main_~end~0.offset 0)) (<= main_~len~0 1) (= main_~inner~0.base 0) (= main_~inner~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (and (= 0 main_~inner~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)) main_~inner~0.offset) (= main_~len~0 0) (not (= 0 main_~end~0.base)) (<= main_~len~0 1) (= main_~inner~0.base 0) (= main_~inner~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))) (<= main_~inner~0.offset 0)) [2019-10-07 03:47:10,711 INFO L193 IcfgInterpreter]: Reachable states at location L1021-2 satisfy 228#(and (<= main_~len~0 0) (or (and (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)) main_~inner~0.offset) (= main_~len~0 0) (not (= main_~end~0.offset 0)) (= main_~inner~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (and (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)) main_~inner~0.offset) (= main_~len~0 0) (not (= 0 main_~end~0.base)) (= main_~inner~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))) (<= 0 main_~len~0)) [2019-10-07 03:47:10,712 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:47:10,712 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:47:10,712 INFO L193 IcfgInterpreter]: Reachable states at location L1032-3 satisfy 233#(and (<= 0 main_~inner~0.offset) (<= main_~len~0 0) (<= main_~inner~0.base 0) (<= 0 main_~len~0) (<= 0 main_~inner~0.base) (or (and (= 0 main_~inner~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)) main_~inner~0.offset) (= main_~len~0 0) (not (= main_~end~0.offset 0)) (= main_~inner~0.base 0) (= main_~inner~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (and (= 0 main_~inner~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)) main_~inner~0.offset) (= main_~len~0 0) (not (= 0 main_~end~0.base)) (= main_~inner~0.base 0) (= main_~inner~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))) (<= main_~inner~0.offset 0)) [2019-10-07 03:47:10,712 INFO L193 IcfgInterpreter]: Reachable states at location L1032-4 satisfy 243#(and (<= 0 main_~inner~0.offset) (<= main_~len~0 0) (<= main_~inner~0.base 0) (<= 0 main_~len~0) (<= 0 main_~inner~0.base) (or (and (= 0 main_~inner~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)) main_~inner~0.offset) (= main_~len~0 0) (not (= main_~end~0.offset 0)) (<= main_~len~0 1) (= main_~inner~0.base 0) (= main_~inner~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))) (and (= 0 main_~inner~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)) main_~inner~0.offset) (= main_~len~0 0) (not (= 0 main_~end~0.base)) (<= main_~len~0 1) (= main_~inner~0.base 0) (= main_~inner~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))) (<= main_~inner~0.offset 0)) [2019-10-07 03:47:10,712 INFO L193 IcfgInterpreter]: Reachable states at location L1017-1 satisfy 223#true [2019-10-07 03:47:10,713 INFO L193 IcfgInterpreter]: Reachable states at location L995-3 satisfy 43#(and (<= 0 |main_#t~malloc0.offset|) (or (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0)) |#memory_$Pointer$.offset|) (= 0 |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (= 0 (select |old(#valid)| 0)) (not (= 0 main_~list~0.base)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0)))) (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0)) |#memory_$Pointer$.offset|) (= 0 |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (= 0 (select |old(#valid)| 0)) (not (= main_~list~0.offset 0)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0))))) (<= 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:47:10,713 INFO L193 IcfgInterpreter]: Reachable states at location L995-4 satisfy 38#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0)) |#memory_$Pointer$.offset|) (= 0 |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (<= 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|) (= |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) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0)))) [2019-10-07 03:47:10,713 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 346#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 03:47:10,713 INFO L193 IcfgInterpreter]: Reachable states at location L1015-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:47:10,713 INFO L193 IcfgInterpreter]: Reachable states at location L995-5 satisfy 48#(and (<= 0 |main_#t~malloc0.offset|) (or (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0)) |#memory_$Pointer$.offset|) (= 0 |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (= 0 (select |old(#valid)| 0)) (not (= 0 main_~list~0.base)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0)))) (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0)) |#memory_$Pointer$.offset|) (= 0 |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (= 0 (select |old(#valid)| 0)) (not (= main_~list~0.offset 0)) (= main_~list~0.offset |main_#t~malloc0.offset|) (= |main_#t~malloc0.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) main_~list~0.offset 0) (+ main_~list~0.offset 4) 0))))) (<= 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:47:10,713 INFO L193 IcfgInterpreter]: Reachable states at location L1015-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:47:10,714 INFO L193 IcfgInterpreter]: Reachable states at location L1042 satisfy 275#(or (and (not (= main_~list~0.offset 0)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) (and (not (= 0 main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))) [2019-10-07 03:47:10,714 INFO L193 IcfgInterpreter]: Reachable states at location L1000-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:47:10,714 INFO L193 IcfgInterpreter]: Reachable states at location L1044-3 satisfy 293#true [2019-10-07 03:47:10,714 INFO L193 IcfgInterpreter]: Reachable states at location mainErr11ASSERT_VIOLATIONERROR_FUNCTION satisfy 337#true [2019-10-07 03:47:10,714 INFO L193 IcfgInterpreter]: Reachable states at location L1042-2 satisfy 342#(and (or (and (= 0 main_~end~0.base) (not (= main_~list~0.offset 0)) (= main_~end~0.offset 0) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))) (and (= 0 main_~end~0.base) (not (= 0 main_~list~0.base)) (= main_~end~0.offset 0) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))) (<= 0 main_~end~0.base) (<= 0 main_~end~0.offset) (<= main_~end~0.offset 0) (<= main_~end~0.base 0)) [2019-10-07 03:47:10,715 INFO L193 IcfgInterpreter]: Reachable states at location L1044-4 satisfy 284#true [2019-10-07 03:47:10,715 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 351#(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:47:10,715 INFO L193 IcfgInterpreter]: Reachable states at location L1000-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:47:10,715 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 03:47:10,715 INFO L193 IcfgInterpreter]: Reachable states at location L995-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:47:10,716 INFO L193 IcfgInterpreter]: Reachable states at location L1038-1 satisfy 270#(or (exists ((v_prenex_18 Int) (v_prenex_17 Int) (v_main_~list~0.base_24 Int) (v_main_~list~0.offset_24 Int)) (or (and (= main_~list~0.offset main_~end~0.offset) (= (select (select |#memory_$Pointer$.base| v_main_~list~0.base_24) v_main_~list~0.offset_24) main_~end~0.base) (= (select |#valid| v_main_~list~0.base_24) 0) (= main_~list~0.base main_~end~0.base) (not (= 0 v_main_~list~0.base_24)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| v_main_~list~0.base_24) v_main_~list~0.offset_24)) (= 0 (select (select |#memory_$Pointer$.offset| v_main_~list~0.base_24) (+ v_main_~list~0.offset_24 8))) (= (select (select |#memory_$Pointer$.base| v_main_~list~0.base_24) (+ v_main_~list~0.offset_24 8)) 0)) (and (= main_~list~0.offset main_~end~0.offset) (= (select (select |#memory_$Pointer$.base| v_prenex_17) v_prenex_18) main_~end~0.base) (= (select |#valid| v_prenex_17) 0) (= main_~list~0.base main_~end~0.base) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| v_prenex_17) v_prenex_18)) (= 0 (select (select |#memory_$Pointer$.offset| v_prenex_17) (+ v_prenex_18 8))) (= (select (select |#memory_$Pointer$.base| v_prenex_17) (+ v_prenex_18 8)) 0) (not (= 0 v_prenex_18))))) (and (= 0 main_~end~0.base) (= main_~end~0.offset 0))) [2019-10-07 03:47:10,716 INFO L193 IcfgInterpreter]: Reachable states at location L1008-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:47:11,616 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 03:47:11,616 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 14] total 21 [2019-10-07 03:47:11,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-07 03:47:11,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-07 03:47:11,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-10-07 03:47:11,618 INFO L87 Difference]: Start difference. First operand 139 states and 163 transitions. Second operand 21 states. [2019-10-07 03:47:15,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:47:15,094 INFO L93 Difference]: Finished difference Result 303 states and 347 transitions. [2019-10-07 03:47:15,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-07 03:47:15,095 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2019-10-07 03:47:15,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:47:15,097 INFO L225 Difference]: With dead ends: 303 [2019-10-07 03:47:15,097 INFO L226 Difference]: Without dead ends: 274 [2019-10-07 03:47:15,099 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 90 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=450, Invalid=2412, Unknown=0, NotChecked=0, Total=2862 [2019-10-07 03:47:15,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-10-07 03:47:15,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 173. [2019-10-07 03:47:15,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-10-07 03:47:15,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 205 transitions. [2019-10-07 03:47:15,111 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 205 transitions. Word has length 33 [2019-10-07 03:47:15,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:47:15,111 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 205 transitions. [2019-10-07 03:47:15,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-07 03:47:15,112 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 205 transitions. [2019-10-07 03:47:15,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-07 03:47:15,113 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:47:15,113 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:47:15,316 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:47:15,317 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:47:15,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:47:15,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1665686661, now seen corresponding path program 1 times [2019-10-07 03:47:15,318 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:47:15,319 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:47:15,319 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:47:15,319 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:47:15,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:47:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:47:15,762 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2019-10-07 03:47:16,039 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:47:16,039 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:47:16,039 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:47:16,039 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:47:16,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:47:16,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-07 03:47:16,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:47:16,562 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-10-07 03:47:16,862 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-10-07 03:47:17,064 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-10-07 03:47:18,015 WARN L191 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2019-10-07 03:47:18,774 WARN L191 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-10-07 03:47:18,987 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-10-07 03:47:19,296 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-10-07 03:47:19,659 WARN L191 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 83 [2019-10-07 03:47:29,012 WARN L191 SmtUtils]: Spent 9.24 s on a formula simplification. DAG size of input: 226 DAG size of output: 218 [2019-10-07 03:47:34,078 WARN L191 SmtUtils]: Spent 4.81 s on a formula simplification that was a NOOP. DAG size: 211 [2019-10-07 03:47:38,215 WARN L191 SmtUtils]: Spent 3.96 s on a formula simplification that was a NOOP. DAG size: 208 [2019-10-07 03:47:42,441 WARN L191 SmtUtils]: Spent 3.88 s on a formula simplification that was a NOOP. DAG size: 204 [2019-10-07 03:47:45,858 WARN L191 SmtUtils]: Spent 2.97 s on a formula simplification that was a NOOP. DAG size: 202 [2019-10-07 03:47:50,435 WARN L191 SmtUtils]: Spent 4.44 s on a formula simplification. DAG size of input: 205 DAG size of output: 196 [2019-10-07 03:47:52,703 WARN L191 SmtUtils]: Spent 1.98 s on a formula simplification that was a NOOP. DAG size: 189 [2019-10-07 03:47:56,283 WARN L191 SmtUtils]: Spent 3.43 s on a formula simplification. DAG size of input: 186 DAG size of output: 170 [2019-10-07 03:47:56,482 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-10-07 03:47:58,416 WARN L191 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 172 DAG size of output: 150 [2019-10-07 03:47:59,471 WARN L191 SmtUtils]: Spent 941.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 133 [2019-10-07 03:47:59,763 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2019-10-07 03:48:00,765 WARN L191 SmtUtils]: Spent 982.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 112 [2019-10-07 03:48:01,321 WARN L191 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 95 [2019-10-07 03:48:01,592 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-10-07 03:48:01,879 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-10-07 03:48:02,332 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 109 [2019-10-07 03:48:02,867 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 94 [2019-10-07 03:48:03,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:48:03,028 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:48:05,171 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse50 (+ c_main_~end~0.offset 8))) (let ((.cse44 (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 8))) (let ((.cse48 (select (select .cse44 c_main_~list~0.base) .cse49)) (.cse47 (store |c_#memory_$Pointer$.base| c_main_~end~0.base (store (select |c_#memory_$Pointer$.base| c_main_~end~0.base) .cse50 0)))) (let ((.cse45 (select (select .cse47 c_main_~list~0.base) .cse49)) (.cse46 (+ .cse48 8))) (let ((.cse0 (= .cse48 0)) (.cse42 (= (select (select .cse47 .cse45) .cse46) 0)) (.cse43 (= .cse45 0)) (.cse1 (= (select (select .cse44 .cse45) .cse46) 0))) (and (or .cse0 .cse1) (forall ((|v_main_#t~malloc13.base_7| Int)) (let ((.cse9 (+ c_main_~end~0.offset 8))) (let ((.cse8 (let ((.cse11 (store |c_#memory_$Pointer$.offset| c_main_~end~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~end~0.base) .cse9 0)))) (store .cse11 |v_main_#t~malloc13.base_7| (store (select .cse11 |v_main_#t~malloc13.base_7|) 0 0)))) (.cse3 (let ((.cse10 (store |c_#memory_$Pointer$.base| c_main_~end~0.base (store (select |c_#memory_$Pointer$.base| c_main_~end~0.base) .cse9 |v_main_#t~malloc13.base_7|)))) (store .cse10 |v_main_#t~malloc13.base_7| (store (select .cse10 |v_main_#t~malloc13.base_7|) 0 0))))) (let ((.cse4 (select (select .cse3 c_main_~end~0.base) .cse9)) (.cse5 (+ (select (select .cse8 c_main_~end~0.base) .cse9) 8))) (let ((.cse2 (store .cse8 .cse4 (store (select .cse8 .cse4) .cse5 0))) (.cse6 (+ c_main_~list~0.offset 8))) (let ((.cse7 (select (select .cse2 c_main_~list~0.base) .cse6))) (or (= 0 |v_main_#t~malloc13.base_7|) (= (select (select .cse2 (select (select (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 0)) c_main_~list~0.base) .cse6)) (+ .cse7 8)) 0) (<= |v_main_#t~malloc13.base_7| |c_#StackHeapBarrier|) (= .cse7 0) (not (= 0 (select |c_#valid| |v_main_#t~malloc13.base_7|)))))))))) (forall ((|v_main_#t~malloc13.base_7| Int)) (let ((.cse19 (+ c_main_~end~0.offset 8))) (let ((.cse18 (let ((.cse21 (store |c_#memory_$Pointer$.offset| c_main_~end~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~end~0.base) .cse19 0)))) (store .cse21 |v_main_#t~malloc13.base_7| (store (select .cse21 |v_main_#t~malloc13.base_7|) 0 0)))) (.cse15 (let ((.cse20 (store |c_#memory_$Pointer$.base| c_main_~end~0.base (store (select |c_#memory_$Pointer$.base| c_main_~end~0.base) .cse19 |v_main_#t~malloc13.base_7|)))) (store .cse20 |v_main_#t~malloc13.base_7| (store (select .cse20 |v_main_#t~malloc13.base_7|) 0 0))))) (let ((.cse16 (select (select .cse15 c_main_~end~0.base) .cse19)) (.cse17 (+ (select (select .cse18 c_main_~end~0.base) .cse19) 8)) (.cse14 (+ c_main_~list~0.offset 8))) (let ((.cse12 (select (select (store .cse18 .cse16 (store (select .cse18 .cse16) .cse17 0)) c_main_~list~0.base) .cse14))) (or (= 0 |v_main_#t~malloc13.base_7|) (<= |v_main_#t~malloc13.base_7| |c_#StackHeapBarrier|) (= .cse12 0) (not (= 0 (select |c_#valid| |v_main_#t~malloc13.base_7|))) (= 0 (select (let ((.cse13 (store .cse15 .cse16 (store (select .cse15 .cse16) .cse17 0)))) (select .cse13 (select (select .cse13 c_main_~list~0.base) .cse14))) (+ .cse12 8))))))))) (forall ((|v_main_#t~malloc13.base_7| Int)) (let ((.cse29 (+ c_main_~end~0.offset 8))) (let ((.cse24 (let ((.cse31 (store |c_#memory_$Pointer$.offset| c_main_~end~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~end~0.base) .cse29 0)))) (store .cse31 |v_main_#t~malloc13.base_7| (store (select .cse31 |v_main_#t~malloc13.base_7|) 0 0)))) (.cse28 (let ((.cse30 (store |c_#memory_$Pointer$.base| c_main_~end~0.base (store (select |c_#memory_$Pointer$.base| c_main_~end~0.base) .cse29 |v_main_#t~malloc13.base_7|)))) (store .cse30 |v_main_#t~malloc13.base_7| (store (select .cse30 |v_main_#t~malloc13.base_7|) 0 0))))) (let ((.cse25 (select (select .cse28 c_main_~end~0.base) .cse29)) (.cse26 (+ (select (select .cse24 c_main_~end~0.base) .cse29) 8))) (let ((.cse23 (store .cse28 .cse25 (store (select .cse28 .cse25) .cse26 0))) (.cse27 (+ c_main_~list~0.offset 8))) (let ((.cse22 (select (select .cse23 c_main_~list~0.base) .cse27))) (or (= 0 |v_main_#t~malloc13.base_7|) (<= |v_main_#t~malloc13.base_7| |c_#StackHeapBarrier|) (= 0 .cse22) (not (= 0 (select |c_#valid| |v_main_#t~malloc13.base_7|))) (= 0 (select (select .cse23 .cse22) (+ (select (select (store .cse24 .cse25 (store (select .cse24 .cse25) .cse26 0)) c_main_~list~0.base) .cse27) 8)))))))))) (forall ((|v_main_#t~malloc13.base_7| Int)) (let ((.cse39 (+ c_main_~end~0.offset 8))) (let ((.cse35 (let ((.cse41 (store |c_#memory_$Pointer$.offset| c_main_~end~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~end~0.base) .cse39 0)))) (store .cse41 |v_main_#t~malloc13.base_7| (store (select .cse41 |v_main_#t~malloc13.base_7|) 0 0)))) (.cse38 (let ((.cse40 (store |c_#memory_$Pointer$.base| c_main_~end~0.base (store (select |c_#memory_$Pointer$.base| c_main_~end~0.base) .cse39 |v_main_#t~malloc13.base_7|)))) (store .cse40 |v_main_#t~malloc13.base_7| (store (select .cse40 |v_main_#t~malloc13.base_7|) 0 0))))) (let ((.cse36 (select (select .cse38 c_main_~end~0.base) .cse39)) (.cse37 (+ (select (select .cse35 c_main_~end~0.base) .cse39) 8)) (.cse34 (+ c_main_~list~0.offset 8))) (let ((.cse33 (select (select (store .cse38 .cse36 (store (select .cse38 .cse36) .cse37 0)) c_main_~list~0.base) .cse34))) (or (= 0 |v_main_#t~malloc13.base_7|) (= (let ((.cse32 (store .cse35 .cse36 (store (select .cse35 .cse36) .cse37 0)))) (select (select .cse32 .cse33) (+ (select (select .cse32 c_main_~list~0.base) .cse34) 8))) 0) (<= |v_main_#t~malloc13.base_7| |c_#StackHeapBarrier|) (= 0 .cse33) (not (= 0 (select |c_#valid| |v_main_#t~malloc13.base_7|))))))))) (or .cse0 .cse42) (or .cse42 .cse43) (or .cse43 .cse1))))))) is different from false [2019-10-07 03:48:07,218 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse50 (+ c_main_~end~0.offset 8))) (let ((.cse44 (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 8))) (let ((.cse48 (select (select .cse44 c_main_~list~0.base) .cse49)) (.cse47 (store |c_#memory_$Pointer$.base| c_main_~end~0.base (store (select |c_#memory_$Pointer$.base| c_main_~end~0.base) .cse50 0)))) (let ((.cse45 (select (select .cse47 c_main_~list~0.base) .cse49)) (.cse46 (+ .cse48 8))) (let ((.cse10 (= .cse48 0)) (.cse42 (= (select (select .cse47 .cse45) .cse46) 0)) (.cse43 (= .cse45 0)) (.cse11 (= (select (select .cse44 .cse45) .cse46) 0))) (and (forall ((v_prenex_36 Int)) (let ((.cse7 (+ c_main_~end~0.offset 8))) (let ((.cse2 (let ((.cse9 (store |c_#memory_$Pointer$.offset| c_main_~end~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~end~0.base) .cse7 0)))) (store .cse9 v_prenex_36 (store (select .cse9 v_prenex_36) 0 0)))) (.cse6 (let ((.cse8 (store |c_#memory_$Pointer$.base| c_main_~end~0.base (store (select |c_#memory_$Pointer$.base| c_main_~end~0.base) .cse7 v_prenex_36)))) (store .cse8 v_prenex_36 (store (select .cse8 v_prenex_36) 0 0))))) (let ((.cse3 (select (select .cse6 c_main_~end~0.base) .cse7)) (.cse4 (+ (select (select .cse2 c_main_~end~0.base) .cse7) 8))) (let ((.cse0 (store .cse6 .cse3 (store (select .cse6 .cse3) .cse4 0))) (.cse5 (+ c_main_~list~0.offset 8))) (let ((.cse1 (select (select .cse0 c_main_~list~0.base) .cse5))) (or (= 0 v_prenex_36) (= 0 (select (select .cse0 .cse1) (+ (select (select (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 0)) c_main_~list~0.base) .cse5) 8))) (<= v_prenex_36 |c_#StackHeapBarrier|) (not (= 0 (select |c_#valid| v_prenex_36))) (= 0 .cse1)))))))) (or .cse10 .cse11) (forall ((|v_main_#t~malloc13.base_7| Int)) (let ((.cse19 (+ c_main_~end~0.offset 8))) (let ((.cse18 (let ((.cse21 (store |c_#memory_$Pointer$.offset| c_main_~end~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~end~0.base) .cse19 0)))) (store .cse21 |v_main_#t~malloc13.base_7| (store (select .cse21 |v_main_#t~malloc13.base_7|) 0 0)))) (.cse13 (let ((.cse20 (store |c_#memory_$Pointer$.base| c_main_~end~0.base (store (select |c_#memory_$Pointer$.base| c_main_~end~0.base) .cse19 |v_main_#t~malloc13.base_7|)))) (store .cse20 |v_main_#t~malloc13.base_7| (store (select .cse20 |v_main_#t~malloc13.base_7|) 0 0))))) (let ((.cse14 (select (select .cse13 c_main_~end~0.base) .cse19)) (.cse15 (+ (select (select .cse18 c_main_~end~0.base) .cse19) 8))) (let ((.cse12 (store .cse18 .cse14 (store (select .cse18 .cse14) .cse15 0))) (.cse16 (+ c_main_~list~0.offset 8))) (let ((.cse17 (select (select .cse12 c_main_~list~0.base) .cse16))) (or (= 0 |v_main_#t~malloc13.base_7|) (= (select (select .cse12 (select (select (store .cse13 .cse14 (store (select .cse13 .cse14) .cse15 0)) c_main_~list~0.base) .cse16)) (+ .cse17 8)) 0) (<= |v_main_#t~malloc13.base_7| |c_#StackHeapBarrier|) (= .cse17 0) (not (= 0 (select |c_#valid| |v_main_#t~malloc13.base_7|)))))))))) (forall ((v_prenex_37 Int)) (let ((.cse29 (+ c_main_~end~0.offset 8))) (let ((.cse25 (let ((.cse31 (store |c_#memory_$Pointer$.offset| c_main_~end~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~end~0.base) .cse29 0)))) (store .cse31 v_prenex_37 (store (select .cse31 v_prenex_37) 0 0)))) (.cse28 (let ((.cse30 (store |c_#memory_$Pointer$.base| c_main_~end~0.base (store (select |c_#memory_$Pointer$.base| c_main_~end~0.base) .cse29 v_prenex_37)))) (store .cse30 v_prenex_37 (store (select .cse30 v_prenex_37) 0 0))))) (let ((.cse26 (select (select .cse28 c_main_~end~0.base) .cse29)) (.cse27 (+ (select (select .cse25 c_main_~end~0.base) .cse29) 8)) (.cse24 (+ c_main_~list~0.offset 8))) (let ((.cse23 (select (select (store .cse28 .cse26 (store (select .cse28 .cse26) .cse27 0)) c_main_~list~0.base) .cse24))) (or (= 0 v_prenex_37) (<= v_prenex_37 |c_#StackHeapBarrier|) (= (let ((.cse22 (store .cse25 .cse26 (store (select .cse25 .cse26) .cse27 0)))) (select (select .cse22 .cse23) (+ (select (select .cse22 c_main_~list~0.base) .cse24) 8))) 0) (not (= 0 (select |c_#valid| v_prenex_37))) (= 0 .cse23))))))) (forall ((v_prenex_35 Int)) (let ((.cse39 (+ c_main_~end~0.offset 8))) (let ((.cse38 (let ((.cse41 (store |c_#memory_$Pointer$.offset| c_main_~end~0.base (store (select |c_#memory_$Pointer$.offset| c_main_~end~0.base) .cse39 0)))) (store .cse41 v_prenex_35 (store (select .cse41 v_prenex_35) 0 0)))) (.cse34 (let ((.cse40 (store |c_#memory_$Pointer$.base| c_main_~end~0.base (store (select |c_#memory_$Pointer$.base| c_main_~end~0.base) .cse39 v_prenex_35)))) (store .cse40 v_prenex_35 (store (select .cse40 v_prenex_35) 0 0))))) (let ((.cse35 (select (select .cse34 c_main_~end~0.base) .cse39)) (.cse36 (+ (select (select .cse38 c_main_~end~0.base) .cse39) 8)) (.cse33 (+ c_main_~list~0.offset 8))) (let ((.cse37 (select (select (store .cse38 .cse35 (store (select .cse38 .cse35) .cse36 0)) c_main_~list~0.base) .cse33))) (or (not (= 0 (select |c_#valid| v_prenex_35))) (= 0 (select (let ((.cse32 (store .cse34 .cse35 (store (select .cse34 .cse35) .cse36 0)))) (select .cse32 (select (select .cse32 c_main_~list~0.base) .cse33))) (+ .cse37 8))) (<= v_prenex_35 |c_#StackHeapBarrier|) (= .cse37 0) (= 0 v_prenex_35))))))) (or .cse10 .cse42) (or .cse42 .cse43) (or .cse43 .cse11))))))) is different from false [2019-10-07 03:49:12,705 WARN L191 SmtUtils]: Spent 21.50 s on a formula simplification. DAG size of input: 210 DAG size of output: 102 [2019-10-07 03:50:34,104 WARN L191 SmtUtils]: Spent 10.56 s on a formula simplification that was a NOOP. DAG size: 225 [2019-10-07 03:50:38,312 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= v_prenex_63 main_~list~0.base) [2019-10-07 03:50:40,322 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= v_prenex_63 main_~list~0.base) [2019-10-07 03:50:43,368 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= 4 (+ main_~list~0.offset 8)) [2019-10-07 03:50:47,018 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= main_~list~0.offset 4)