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-circular-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 03:46:58,784 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 03:46:58,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 03:46:58,804 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 03:46:58,804 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 03:46:58,806 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 03:46:58,808 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 03:46:58,810 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 03:46:58,812 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 03:46:58,816 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 03:46:58,817 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 03:46:58,818 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 03:46:58,818 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 03:46:58,819 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 03:46:58,822 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 03:46:58,823 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 03:46:58,826 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 03:46:58,827 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 03:46:58,832 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 03:46:58,834 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 03:46:58,839 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 03:46:58,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 03:46:58,843 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 03:46:58,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 03:46:58,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 03:46:58,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 03:46:58,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 03:46:58,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 03:46:58,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 03:46:58,851 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 03:46:58,851 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 03:46:58,852 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 03:46:58,853 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 03:46:58,854 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 03:46:58,855 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 03:46:58,856 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 03:46:58,856 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 03:46:58,856 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 03:46:58,857 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 03:46:58,858 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 03:46:58,859 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 03:46:58,860 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:58,882 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 03:46:58,882 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 03:46:58,883 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 03:46:58,883 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 03:46:58,884 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 03:46:58,884 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 03:46:58,886 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 03:46:58,886 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 03:46:58,887 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 03:46:58,887 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 03:46:58,887 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 03:46:58,887 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 03:46:58,887 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 03:46:58,888 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 03:46:58,888 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 03:46:58,889 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 03:46:58,889 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 03:46:58,890 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 03:46:58,890 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 03:46:58,890 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 03:46:58,891 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 03:46:58,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 03:46:58,891 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 03:46:58,891 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 03:46:58,892 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 03:46:58,892 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 03:46:58,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 03:46:58,892 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 03:46:58,892 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:59,172 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 03:46:59,185 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 03:46:59,189 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 03:46:59,191 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 03:46:59,191 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 03:46:59,192 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-circular-2.i [2019-10-07 03:46:59,258 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d4171ec8/660461dfe53c40f9a8dba90c8c30d703/FLAGac139fe42 [2019-10-07 03:46:59,712 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 03:46:59,713 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-circular-2.i [2019-10-07 03:46:59,726 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d4171ec8/660461dfe53c40f9a8dba90c8c30d703/FLAGac139fe42 [2019-10-07 03:47:00,073 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d4171ec8/660461dfe53c40f9a8dba90c8c30d703 [2019-10-07 03:47:00,080 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 03:47:00,082 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 03:47:00,082 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 03:47:00,083 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 03:47:00,085 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 03:47:00,086 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:47:00" (1/1) ... [2019-10-07 03:47:00,089 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@166d7fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:47:00, skipping insertion in model container [2019-10-07 03:47:00,089 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:47:00" (1/1) ... [2019-10-07 03:47:00,096 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 03:47:00,144 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 03:47:00,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:47:00,541 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 03:47:00,596 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:47:00,653 INFO L192 MainTranslator]: Completed translation [2019-10-07 03:47:00,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:47:00 WrapperNode [2019-10-07 03:47:00,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 03:47:00,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 03:47:00,655 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 03:47:00,655 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 03:47:00,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:47:00" (1/1) ... [2019-10-07 03:47:00,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:47:00" (1/1) ... [2019-10-07 03:47:00,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:47:00" (1/1) ... [2019-10-07 03:47:00,698 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:47:00" (1/1) ... [2019-10-07 03:47:00,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:47:00" (1/1) ... [2019-10-07 03:47:00,743 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:47:00" (1/1) ... [2019-10-07 03:47:00,746 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:47:00" (1/1) ... [2019-10-07 03:47:00,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 03:47:00,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 03:47:00,759 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 03:47:00,760 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 03:47:00,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:47:00" (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:47:00,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 03:47:00,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 03:47:00,838 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 03:47:00,839 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-07 03:47:00,839 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-07 03:47:00,840 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-07 03:47:00,840 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-07 03:47:00,841 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-07 03:47:00,841 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-07 03:47:00,841 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-07 03:47:00,841 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-07 03:47:00,842 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-07 03:47:00,842 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-07 03:47:00,843 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-07 03:47:00,843 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-07 03:47:00,843 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-07 03:47:00,845 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-07 03:47:00,845 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-07 03:47:00,846 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-07 03:47:00,846 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-07 03:47:00,846 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-07 03:47:00,846 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-07 03:47:00,846 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-07 03:47:00,846 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-07 03:47:00,846 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-07 03:47:00,847 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-07 03:47:00,847 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-07 03:47:00,847 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-07 03:47:00,847 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-07 03:47:00,847 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-07 03:47:00,847 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-07 03:47:00,847 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-07 03:47:00,848 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-07 03:47:00,848 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-07 03:47:00,848 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-07 03:47:00,848 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-07 03:47:00,849 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-07 03:47:00,849 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-07 03:47:00,849 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-07 03:47:00,849 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-07 03:47:00,849 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-07 03:47:00,850 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-07 03:47:00,850 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-07 03:47:00,850 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-07 03:47:00,850 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-07 03:47:00,850 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-07 03:47:00,850 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-07 03:47:00,850 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-07 03:47:00,851 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-07 03:47:00,851 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-07 03:47:00,851 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-07 03:47:00,851 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-07 03:47:00,851 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-07 03:47:00,851 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 03:47:00,851 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-07 03:47:00,852 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-07 03:47:00,852 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-07 03:47:00,852 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-07 03:47:00,852 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-07 03:47:00,852 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-07 03:47:00,853 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-07 03:47:00,853 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-07 03:47:00,853 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-07 03:47:00,853 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-07 03:47:00,853 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-07 03:47:00,853 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-07 03:47:00,854 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 03:47:00,854 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-07 03:47:00,855 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-07 03:47:00,855 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-07 03:47:00,855 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-07 03:47:00,855 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-07 03:47:00,855 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-07 03:47:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-07 03:47:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-07 03:47:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-07 03:47:00,857 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-07 03:47:00,857 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-07 03:47:00,857 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-07 03:47:00,857 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-07 03:47:00,858 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-07 03:47:00,858 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-07 03:47:00,858 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-07 03:47:00,858 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-07 03:47:00,859 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-07 03:47:00,859 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-07 03:47:00,859 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-07 03:47:00,860 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-07 03:47:00,860 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-07 03:47:00,860 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-07 03:47:00,860 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-07 03:47:00,860 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-07 03:47:00,860 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-07 03:47:00,860 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-07 03:47:00,861 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-07 03:47:00,861 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-07 03:47:00,861 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-07 03:47:00,861 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-07 03:47:00,861 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-07 03:47:00,861 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-07 03:47:00,861 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-07 03:47:00,862 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-07 03:47:00,862 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-07 03:47:00,862 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-07 03:47:00,862 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-07 03:47:00,862 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-07 03:47:00,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 03:47:00,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 03:47:00,862 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 03:47:00,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 03:47:00,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 03:47:00,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 03:47:00,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 03:47:00,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 03:47:00,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 03:47:00,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 03:47:00,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 03:47:01,551 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 03:47:01,552 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-07 03:47:01,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:47:01 BoogieIcfgContainer [2019-10-07 03:47:01,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 03:47:01,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 03:47:01,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 03:47:01,558 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 03:47:01,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:47:00" (1/3) ... [2019-10-07 03:47:01,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eddc885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:47:01, skipping insertion in model container [2019-10-07 03:47:01,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:47:00" (2/3) ... [2019-10-07 03:47:01,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eddc885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:47:01, skipping insertion in model container [2019-10-07 03:47:01,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:47:01" (3/3) ... [2019-10-07 03:47:01,565 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-circular-2.i [2019-10-07 03:47:01,575 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 03:47:01,583 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-07 03:47:01,595 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-07 03:47:01,632 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 03:47:01,633 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 03:47:01,633 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 03:47:01,633 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 03:47:01,634 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 03:47:01,634 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 03:47:01,635 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 03:47:01,635 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 03:47:01,658 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-10-07 03:47:01,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-07 03:47:01,666 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:47:01,677 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:47:01,681 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:47:01,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:47:01,688 INFO L82 PathProgramCache]: Analyzing trace with hash 749315359, now seen corresponding path program 1 times [2019-10-07 03:47:01,698 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:47:01,698 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:47:01,698 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:47:01,699 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:47:01,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:47:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:47:01,841 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:47:01,842 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:47:01,843 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:47:01,843 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-07 03:47:01,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-07 03:47:01,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-07 03:47:01,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 03:47:01,859 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2019-10-07 03:47:01,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:47:01,879 INFO L93 Difference]: Finished difference Result 65 states and 99 transitions. [2019-10-07 03:47:01,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-07 03:47:01,881 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-10-07 03:47:01,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:47:01,891 INFO L225 Difference]: With dead ends: 65 [2019-10-07 03:47:01,891 INFO L226 Difference]: Without dead ends: 28 [2019-10-07 03:47:01,894 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 03:47:01,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-07 03:47:01,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-10-07 03:47:01,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-07 03:47:01,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-07 03:47:01,931 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 9 [2019-10-07 03:47:01,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:47:01,931 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-07 03:47:01,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-07 03:47:01,932 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-07 03:47:01,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-07 03:47:01,932 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:47:01,932 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:47:01,933 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:47:01,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:47:01,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1712971286, now seen corresponding path program 1 times [2019-10-07 03:47:01,934 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:47:01,934 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:47:01,934 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:47:01,934 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:47:01,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:47:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:47:02,106 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:47:02,108 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:47:02,108 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:47:02,109 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 03:47:02,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 03:47:02,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 03:47:02,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:47:02,112 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 4 states. [2019-10-07 03:47:02,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:47:02,218 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-10-07 03:47:02,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 03:47:02,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-07 03:47:02,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:47:02,220 INFO L225 Difference]: With dead ends: 43 [2019-10-07 03:47:02,220 INFO L226 Difference]: Without dead ends: 39 [2019-10-07 03:47:02,221 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:47:02,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-07 03:47:02,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2019-10-07 03:47:02,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-07 03:47:02,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-10-07 03:47:02,228 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2019-10-07 03:47:02,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:47:02,228 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-10-07 03:47:02,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 03:47:02,228 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-10-07 03:47:02,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 03:47:02,229 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:47:02,229 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:47:02,230 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:47:02,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:47:02,230 INFO L82 PathProgramCache]: Analyzing trace with hash -994155934, now seen corresponding path program 1 times [2019-10-07 03:47:02,230 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:47:02,230 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:47:02,231 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:47:02,231 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:47:02,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:47:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:47:02,283 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:47:02,284 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:47:02,284 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:47:02,284 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 03:47:02,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 03:47:02,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 03:47:02,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:47:02,286 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 3 states. [2019-10-07 03:47:02,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:47:02,323 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2019-10-07 03:47:02,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 03:47:02,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-07 03:47:02,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:47:02,327 INFO L225 Difference]: With dead ends: 71 [2019-10-07 03:47:02,327 INFO L226 Difference]: Without dead ends: 50 [2019-10-07 03:47:02,329 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:47:02,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-07 03:47:02,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 37. [2019-10-07 03:47:02,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-07 03:47:02,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2019-10-07 03:47:02,345 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 13 [2019-10-07 03:47:02,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:47:02,345 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2019-10-07 03:47:02,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 03:47:02,345 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2019-10-07 03:47:02,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 03:47:02,347 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:47:02,347 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:47:02,348 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:47:02,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:47:02,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1588532202, now seen corresponding path program 1 times [2019-10-07 03:47:02,348 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:47:02,349 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:47:02,349 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:47:02,351 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:47:02,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:47:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:47:02,701 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 21 [2019-10-07 03:47:02,745 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:47:02,746 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:47:02,746 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:47:02,746 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 03:47:02,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:47:02,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:47:02,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:47:02,747 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 5 states. [2019-10-07 03:47:02,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:47:02,926 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-10-07 03:47:02,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 03:47:02,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-07 03:47:02,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:47:02,927 INFO L225 Difference]: With dead ends: 46 [2019-10-07 03:47:02,928 INFO L226 Difference]: Without dead ends: 35 [2019-10-07 03:47:02,928 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-07 03:47:02,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-07 03:47:02,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-10-07 03:47:02,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-07 03:47:02,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2019-10-07 03:47:02,934 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 15 [2019-10-07 03:47:02,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:47:02,934 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2019-10-07 03:47:02,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:47:02,935 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2019-10-07 03:47:02,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-07 03:47:02,935 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:47:02,936 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:47:02,936 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:47:02,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:47:02,936 INFO L82 PathProgramCache]: Analyzing trace with hash -428681333, now seen corresponding path program 1 times [2019-10-07 03:47:02,936 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:47:02,937 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:47:02,937 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:47:02,937 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:47:02,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:47:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:47: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:47:03,028 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:47:03,029 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:47:03,029 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:47:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:47:03,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-07 03:47:03,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:47:03,227 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:47:03,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:47:03,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:47:03,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-07 03:47:03,235 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-07 03:47:03,280 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:47:03,281 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 11 treesize of output 15 [2019-10-07 03:47:03,282 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:47:03,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:47:03,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:47:03,375 INFO L341 Elim1Store]: treesize reduction 30, result has 57.7 percent of original size [2019-10-07 03:47:03,376 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 51 [2019-10-07 03:47:03,376 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:47:03,413 INFO L567 ElimStorePlain]: treesize reduction 24, result has 59.3 percent of original size [2019-10-07 03:47:03,415 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:47:03,415 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:111, output treesize:32 [2019-10-07 03:47:05,457 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 23 [2019-10-07 03:47:05,523 INFO L341 Elim1Store]: treesize reduction 60, result has 29.4 percent of original size [2019-10-07 03:47:05,524 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 41 [2019-10-07 03:47:05,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:47:05,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:47:05,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 03:47:05,543 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:23 [2019-10-07 03:47:07,627 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 6=[|v_#memory_$Pointer$.base_24|]} [2019-10-07 03:47:07,637 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:47:07,661 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:47:07,682 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:47:07,682 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 55 [2019-10-07 03:47:07,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:47:07,691 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:47:07,704 INFO L567 ElimStorePlain]: treesize reduction 23, result has 28.1 percent of original size [2019-10-07 03:47:07,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 03:47:07,705 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:4 [2019-10-07 03:47:07,707 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:07,710 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:47:07,724 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:47:07,729 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:47:07,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:47:07,731 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2019-10-07 03:47:07,783 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:47:07,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:47:07,788 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:47:07,789 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:18 [2019-10-07 03:47:07,818 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1861 treesize of output 1853 [2019-10-07 03:47:07,826 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-07 03:47:08,203 WARN L191 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 43 [2019-10-07 03:47:08,204 INFO L567 ElimStorePlain]: treesize reduction 1774, result has 4.2 percent of original size [2019-10-07 03:47:08,205 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-07 03:47:08,206 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:143, output treesize:75 [2019-10-07 03:47:08,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:47:08,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:47:08,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:47:08,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:47:08,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:47:08,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:47:08,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:47:08,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:47:08,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:47:08,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:47:08,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:47:08,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:47:08,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:47:08,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:47:08,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:47:08,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:47:08,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:47:08,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:47:08,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:47:08,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:47:08,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:47:08,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:47:08,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:47:08,304 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:08,305 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 03:47:08,329 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-07 03:47:08,329 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 03:47:08,335 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 03:47:08,343 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 03:47:08,343 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 03:47:08,470 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-07 03:47:34,161 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 03:47:34,165 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 03:47:34,165 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 03:47:34,166 INFO L193 IcfgInterpreter]: Reachable states at location L995-3 satisfy 162#true [2019-10-07 03:47:34,166 INFO L193 IcfgInterpreter]: Reachable states at location L1003-1 satisfy 102#true [2019-10-07 03:47:34,166 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 188#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 03:47:34,166 INFO L193 IcfgInterpreter]: Reachable states at location L1015-3 satisfy 112#(or (and (not (= 0 main_~x~0.base)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) main_~state~0)) (and (not (= main_~x~0.offset 0)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) main_~state~0))) [2019-10-07 03:47:34,167 INFO L193 IcfgInterpreter]: Reachable states at location L1015-4 satisfy 107#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) main_~state~0) [2019-10-07 03:47:34,167 INFO L193 IcfgInterpreter]: Reachable states at location L1015-5 satisfy 120#true [2019-10-07 03:47:34,167 INFO L193 IcfgInterpreter]: Reachable states at location L1020-1 satisfy 175#(and (<= 0 main_~x~0.base) (<= main_~x~0.offset 0) (<= main_~x~0.base 0) (<= 0 main_~x~0.offset) (or (and (= 0 main_~x~0.base) (exists ((v_prenex_55 Int) (v_main_~x~0.offset_33 Int) (v_main_~x~0.base_35 Int) (v_prenex_54 Int)) (or (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~state~0 (select (select |#memory_int| v_main_~x~0.base_35) (+ v_main_~x~0.offset_33 8))) (not (= 0 v_main_~x~0.base_35)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base)) (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= 0 v_prenex_54)) (= main_~state~0 (select (select |#memory_int| v_prenex_55) (+ v_prenex_54 8))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base)))) (= main_~x~0.offset 0)) (and (= 0 main_~x~0.base) (= main_~x~0.offset 0) (exists ((v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int)) (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (<= 0 |#NULL.base|) (= 1 main_~state~0) (= (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset main_~head~0.offset) (+ main_~head~0.offset 4) 0) (+ main_~head~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 8)))) |#memory_$Pointer$.offset|) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset main_~head~0.base) (+ main_~head~0.offset 4) 0) (+ main_~head~0.offset 8) (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))))) (= |main_#t~malloc0.base| main_~head~0.base) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset |main_#t~malloc0.offset|) (= (store |old(#memory_int)| main_~head~0.base (store (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_DerPreprocessor_4) (+ main_~head~0.offset 4) v_DerPreprocessor_5) (+ main_~head~0.offset 8) main_~state~0)) |#memory_int|) (= (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|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base)))))) [2019-10-07 03:47:34,167 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:34,168 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 03:47:34,168 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 193#(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:34,168 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 03:47:34,168 INFO L193 IcfgInterpreter]: Reachable states at location L1020-4 satisfy 170#true [2019-10-07 03:47:34,169 INFO L193 IcfgInterpreter]: Reachable states at location mainErr1ASSERT_VIOLATIONERROR_FUNCTION satisfy 184#(or (and (<= 0 main_~x~0.base) (= 0 main_~x~0.base) (<= main_~x~0.offset 0) (exists ((v_prenex_55 Int) (v_main_~x~0.offset_33 Int) (v_main_~x~0.base_35 Int) (v_prenex_54 Int)) (or (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~state~0 (select (select |#memory_int| v_main_~x~0.base_35) (+ v_main_~x~0.offset_33 8))) (not (= 0 v_main_~x~0.base_35)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base)) (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= 0 v_prenex_54)) (= main_~state~0 (select (select |#memory_int| v_prenex_55) (+ v_prenex_54 8))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base)))) (<= main_~x~0.base 0) (= main_~x~0.offset 0) (<= 0 main_~x~0.offset)) (and (<= 0 main_~x~0.base) (= 0 main_~x~0.base) (<= main_~x~0.offset 0) (<= main_~x~0.base 0) (= main_~x~0.offset 0) (<= 0 main_~x~0.offset) (exists ((v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int)) (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 12)) (<= 0 |#NULL.base|) (= 1 main_~state~0) (= (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset main_~head~0.offset) (+ main_~head~0.offset 4) 0) (+ main_~head~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 8)))) |#memory_$Pointer$.offset|) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset main_~head~0.base) (+ main_~head~0.offset 4) 0) (+ main_~head~0.offset 8) (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))))) (= |main_#t~malloc0.base| main_~head~0.base) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset |main_#t~malloc0.offset|) (= (store |old(#memory_int)| main_~head~0.base (store (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_DerPreprocessor_4) (+ main_~head~0.offset 4) v_DerPreprocessor_5) (+ main_~head~0.offset 8) main_~state~0)) |#memory_int|) (= (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|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base))))) [2019-10-07 03:47:34,169 INFO L193 IcfgInterpreter]: Reachable states at location L995-1 satisfy 128#(and (<= 0 (+ |main_#t~nondet1| 2147483648)) (<= |main_#t~nondet1| 2147483647)) [2019-10-07 03:47:34,169 INFO L193 IcfgInterpreter]: Reachable states at location L1003 satisfy 97#true [2019-10-07 03:47:34,530 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 03:47:34,530 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5, 9] total 17 [2019-10-07 03:47:34,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-07 03:47:34,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-07 03:47:34,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=227, Unknown=1, NotChecked=0, Total=272 [2019-10-07 03:47:34,533 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 17 states. [2019-10-07 03:47:36,829 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 32 [2019-10-07 03:47:55,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:47:55,453 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2019-10-07 03:47:55,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-07 03:47:55,454 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-10-07 03:47:55,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:47:55,455 INFO L225 Difference]: With dead ends: 61 [2019-10-07 03:47:55,455 INFO L226 Difference]: Without dead ends: 59 [2019-10-07 03:47:55,456 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=136, Invalid=615, Unknown=5, NotChecked=0, Total=756 [2019-10-07 03:47:55,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-07 03:47:55,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2019-10-07 03:47:55,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-07 03:47:55,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2019-10-07 03:47:55,466 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 16 [2019-10-07 03:47:55,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:47:55,467 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2019-10-07 03:47:55,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-07 03:47:55,467 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2019-10-07 03:47:55,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-07 03:47:55,468 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:47:55,468 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:47:55,680 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:47:55,680 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:47:55,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:47:55,681 INFO L82 PathProgramCache]: Analyzing trace with hash -963397692, now seen corresponding path program 1 times [2019-10-07 03:47:55,681 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:47:55,682 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:47:55,682 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:47:55,682 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:47:55,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:47:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:47:55,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:47:55,752 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:47:55,753 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:47:55,753 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 03:47:55,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 03:47:55,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 03:47:55,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:47:55,754 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand 3 states. [2019-10-07 03:47:55,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:47:55,786 INFO L93 Difference]: Finished difference Result 93 states and 110 transitions. [2019-10-07 03:47:55,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 03:47:55,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-07 03:47:55,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:47:55,787 INFO L225 Difference]: With dead ends: 93 [2019-10-07 03:47:55,788 INFO L226 Difference]: Without dead ends: 72 [2019-10-07 03:47:55,788 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:47:55,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-07 03:47:55,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 57. [2019-10-07 03:47:55,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-07 03:47:55,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2019-10-07 03:47:55,803 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 20 [2019-10-07 03:47:55,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:47:55,803 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2019-10-07 03:47:55,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 03:47:55,805 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2019-10-07 03:47:55,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 03:47:55,806 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:47:55,806 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] [2019-10-07 03:47:55,807 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:47:55,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:47:55,807 INFO L82 PathProgramCache]: Analyzing trace with hash 61914005, now seen corresponding path program 1 times [2019-10-07 03:47:55,807 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:47:55,807 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:47:55,807 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:47:55,808 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:47:55,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:47:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:47:56,080 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:56,081 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:47:56,081 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:47:56,081 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:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:47:56,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-07 03:47:56,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:47:57,248 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:57,248 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:48:00,771 WARN L191 SmtUtils]: Spent 2.90 s on a formula simplification. DAG size of input: 416 DAG size of output: 216