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-queue-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 03:48:17,912 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 03:48:17,915 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 03:48:17,933 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 03:48:17,933 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 03:48:17,935 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 03:48:17,937 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 03:48:17,946 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 03:48:17,952 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 03:48:17,955 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 03:48:17,957 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 03:48:17,958 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 03:48:17,958 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 03:48:17,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 03:48:17,963 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 03:48:17,965 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 03:48:17,966 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 03:48:17,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 03:48:17,970 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 03:48:17,975 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 03:48:17,980 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 03:48:17,983 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 03:48:17,986 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 03:48:17,987 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 03:48:17,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 03:48:17,990 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 03:48:17,990 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 03:48:17,992 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 03:48:17,993 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 03:48:17,994 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 03:48:17,995 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 03:48:17,996 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 03:48:17,996 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 03:48:17,997 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 03:48:17,998 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 03:48:17,999 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 03:48:17,999 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 03:48:18,000 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 03:48:18,000 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 03:48:18,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 03:48:18,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 03:48:18,003 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 03:48:18,027 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 03:48:18,027 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 03:48:18,028 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 03:48:18,029 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 03:48:18,029 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 03:48:18,029 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 03:48:18,029 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 03:48:18,030 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 03:48:18,030 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 03:48:18,030 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 03:48:18,030 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 03:48:18,030 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 03:48:18,030 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 03:48:18,031 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 03:48:18,031 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 03:48:18,031 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 03:48:18,031 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 03:48:18,032 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 03:48:18,032 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 03:48:18,032 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 03:48:18,032 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 03:48:18,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 03:48:18,033 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 03:48:18,033 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 03:48:18,033 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 03:48:18,033 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 03:48:18,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 03:48:18,034 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 03:48:18,034 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 03:48:18,315 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 03:48:18,335 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 03:48:18,339 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 03:48:18,340 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 03:48:18,341 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 03:48:18,341 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-queue-2.i [2019-10-07 03:48:18,420 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/813fe0402/ab6bc09f6e1543c49f2bfa357171f7bb/FLAG6b89f36df [2019-10-07 03:48:18,972 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 03:48:18,973 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-queue-2.i [2019-10-07 03:48:18,991 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/813fe0402/ab6bc09f6e1543c49f2bfa357171f7bb/FLAG6b89f36df [2019-10-07 03:48:19,274 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/813fe0402/ab6bc09f6e1543c49f2bfa357171f7bb [2019-10-07 03:48:19,284 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 03:48:19,286 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 03:48:19,287 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 03:48:19,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 03:48:19,290 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 03:48:19,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:48:19" (1/1) ... [2019-10-07 03:48:19,294 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@240d376e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:19, skipping insertion in model container [2019-10-07 03:48:19,294 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:48:19" (1/1) ... [2019-10-07 03:48:19,301 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 03:48:19,365 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 03:48:19,918 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:48:19,937 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 03:48:20,006 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:48:20,054 INFO L192 MainTranslator]: Completed translation [2019-10-07 03:48:20,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:20 WrapperNode [2019-10-07 03:48:20,055 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 03:48:20,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 03:48:20,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 03:48:20,056 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 03:48:20,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:20" (1/1) ... [2019-10-07 03:48:20,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:20" (1/1) ... [2019-10-07 03:48:20,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:20" (1/1) ... [2019-10-07 03:48:20,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:20" (1/1) ... [2019-10-07 03:48:20,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:20" (1/1) ... [2019-10-07 03:48:20,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:20" (1/1) ... [2019-10-07 03:48:20,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:20" (1/1) ... [2019-10-07 03:48:20,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 03:48:20,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 03:48:20,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 03:48:20,142 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 03:48:20,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 03:48:20,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 03:48:20,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 03:48:20,214 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 03:48:20,214 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-07 03:48:20,215 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-07 03:48:20,215 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-07 03:48:20,216 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-07 03:48:20,216 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-07 03:48:20,216 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-07 03:48:20,217 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-07 03:48:20,217 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-07 03:48:20,217 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-07 03:48:20,217 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-07 03:48:20,218 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-07 03:48:20,218 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-07 03:48:20,218 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-07 03:48:20,219 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-07 03:48:20,219 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-07 03:48:20,220 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-07 03:48:20,220 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-07 03:48:20,220 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-07 03:48:20,220 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-07 03:48:20,220 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-07 03:48:20,220 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-07 03:48:20,220 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-07 03:48:20,220 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-07 03:48:20,221 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-07 03:48:20,221 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-07 03:48:20,221 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-07 03:48:20,221 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-07 03:48:20,221 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-07 03:48:20,221 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-07 03:48:20,221 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-07 03:48:20,221 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-07 03:48:20,222 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-07 03:48:20,222 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-07 03:48:20,222 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-07 03:48:20,222 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-07 03:48:20,222 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-07 03:48:20,222 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-07 03:48:20,222 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-07 03:48:20,223 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-07 03:48:20,223 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-07 03:48:20,223 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-07 03:48:20,223 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-07 03:48:20,223 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-07 03:48:20,223 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-07 03:48:20,223 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-07 03:48:20,223 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-07 03:48:20,223 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-07 03:48:20,223 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-07 03:48:20,224 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-07 03:48:20,224 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-07 03:48:20,224 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 03:48:20,224 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-07 03:48:20,224 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-07 03:48:20,224 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-07 03:48:20,224 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-07 03:48:20,225 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-07 03:48:20,225 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-07 03:48:20,225 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-07 03:48:20,225 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-07 03:48:20,225 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-07 03:48:20,225 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-07 03:48:20,226 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-07 03:48:20,226 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-07 03:48:20,226 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 03:48:20,226 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-07 03:48:20,226 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-07 03:48:20,226 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-07 03:48:20,227 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-07 03:48:20,227 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-07 03:48:20,227 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-07 03:48:20,227 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-07 03:48:20,227 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-07 03:48:20,227 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-07 03:48:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-07 03:48:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-07 03:48:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-07 03:48:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-07 03:48:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-07 03:48:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-07 03:48:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-07 03:48:20,229 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-07 03:48:20,229 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-07 03:48:20,229 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-07 03:48:20,229 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-07 03:48:20,229 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-07 03:48:20,229 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-07 03:48:20,230 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-07 03:48:20,230 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-07 03:48:20,230 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-07 03:48:20,230 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-07 03:48:20,230 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-07 03:48:20,230 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-07 03:48:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-07 03:48:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-07 03:48:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-07 03:48:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-07 03:48:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-07 03:48:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-07 03:48:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-07 03:48:20,232 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-07 03:48:20,232 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-07 03:48:20,232 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-07 03:48:20,232 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-07 03:48:20,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 03:48:20,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 03:48:20,232 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 03:48:20,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 03:48:20,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 03:48:20,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 03:48:20,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 03:48:20,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 03:48:20,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 03:48:20,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 03:48:20,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 03:48:21,088 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 03:48:21,088 INFO L284 CfgBuilder]: Removed 31 assume(true) statements. [2019-10-07 03:48:21,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:48:21 BoogieIcfgContainer [2019-10-07 03:48:21,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 03:48:21,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 03:48:21,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 03:48:21,095 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 03:48:21,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:48:19" (1/3) ... [2019-10-07 03:48:21,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91b2ac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:48:21, skipping insertion in model container [2019-10-07 03:48:21,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:20" (2/3) ... [2019-10-07 03:48:21,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91b2ac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:48:21, skipping insertion in model container [2019-10-07 03:48:21,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:48:21" (3/3) ... [2019-10-07 03:48:21,100 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-queue-2.i [2019-10-07 03:48:21,110 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 03:48:21,120 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-10-07 03:48:21,132 INFO L249 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-10-07 03:48:21,156 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 03:48:21,156 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 03:48:21,157 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 03:48:21,157 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 03:48:21,157 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 03:48:21,157 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 03:48:21,158 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 03:48:21,158 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 03:48:21,176 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2019-10-07 03:48:21,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-07 03:48:21,181 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:21,182 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:21,184 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:21,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:21,190 INFO L82 PathProgramCache]: Analyzing trace with hash -720600283, now seen corresponding path program 1 times [2019-10-07 03:48:21,199 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:21,200 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:21,200 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:21,200 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:21,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:21,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:48:21,362 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:21,363 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:21,364 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-07 03:48:21,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-07 03:48:21,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-07 03:48:21,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 03:48:21,385 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 2 states. [2019-10-07 03:48:21,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:21,416 INFO L93 Difference]: Finished difference Result 159 states and 257 transitions. [2019-10-07 03:48:21,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-07 03:48:21,418 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-10-07 03:48:21,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:21,432 INFO L225 Difference]: With dead ends: 159 [2019-10-07 03:48:21,432 INFO L226 Difference]: Without dead ends: 78 [2019-10-07 03:48:21,438 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 03:48:21,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-07 03:48:21,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-10-07 03:48:21,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-07 03:48:21,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2019-10-07 03:48:21,484 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 8 [2019-10-07 03:48:21,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:21,484 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2019-10-07 03:48:21,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-07 03:48:21,485 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2019-10-07 03:48:21,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-07 03:48:21,485 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:21,485 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:21,486 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:21,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:21,487 INFO L82 PathProgramCache]: Analyzing trace with hash -865194756, now seen corresponding path program 1 times [2019-10-07 03:48:21,487 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:21,489 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:21,489 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:21,489 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:21,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:21,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:48:21,637 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:21,638 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:21,638 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 03:48:21,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 03:48:21,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 03:48:21,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:48:21,640 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand 3 states. [2019-10-07 03:48:21,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:21,714 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2019-10-07 03:48:21,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 03:48:21,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-10-07 03:48:21,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:21,717 INFO L225 Difference]: With dead ends: 78 [2019-10-07 03:48:21,717 INFO L226 Difference]: Without dead ends: 68 [2019-10-07 03:48:21,719 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:48:21,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-07 03:48:21,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-10-07 03:48:21,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-07 03:48:21,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-10-07 03:48:21,739 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 9 [2019-10-07 03:48:21,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:21,740 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-10-07 03:48:21,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 03:48:21,740 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-10-07 03:48:21,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 03:48:21,740 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:21,741 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:21,741 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:21,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:21,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1771622400, now seen corresponding path program 1 times [2019-10-07 03:48:21,742 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:21,742 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:21,742 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:21,742 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:21,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:21,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:48:21,893 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:21,894 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:21,894 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 03:48:21,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 03:48:21,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 03:48:21,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:48:21,895 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 4 states. [2019-10-07 03:48:21,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:21,953 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-10-07 03:48:21,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 03:48:21,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-07 03:48:21,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:21,955 INFO L225 Difference]: With dead ends: 68 [2019-10-07 03:48:21,955 INFO L226 Difference]: Without dead ends: 66 [2019-10-07 03:48:21,955 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:48:21,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-07 03:48:21,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-10-07 03:48:21,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-07 03:48:21,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-10-07 03:48:21,965 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 11 [2019-10-07 03:48:21,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:21,965 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-10-07 03:48:21,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 03:48:21,965 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-10-07 03:48:21,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 03:48:21,966 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:21,966 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:21,967 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:21,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:21,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1429193867, now seen corresponding path program 1 times [2019-10-07 03:48:21,968 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:21,968 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:21,968 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:21,968 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:21,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:22,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:48:22,015 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:22,015 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:22,016 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 03:48:22,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 03:48:22,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 03:48:22,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:48:22,017 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 3 states. [2019-10-07 03:48:22,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:22,092 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2019-10-07 03:48:22,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 03:48:22,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-07 03:48:22,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:22,094 INFO L225 Difference]: With dead ends: 134 [2019-10-07 03:48:22,094 INFO L226 Difference]: Without dead ends: 82 [2019-10-07 03:48:22,095 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:48:22,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-07 03:48:22,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 73. [2019-10-07 03:48:22,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-07 03:48:22,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2019-10-07 03:48:22,105 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 15 [2019-10-07 03:48:22,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:22,106 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2019-10-07 03:48:22,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 03:48:22,106 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2019-10-07 03:48:22,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-07 03:48:22,106 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:22,107 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:22,107 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:22,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:22,108 INFO L82 PathProgramCache]: Analyzing trace with hash -529264867, now seen corresponding path program 1 times [2019-10-07 03:48:22,108 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:22,108 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:22,108 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:22,108 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:22,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:22,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:22,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:48:22,152 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:22,152 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:22,152 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 03:48:22,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 03:48:22,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 03:48:22,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:48:22,154 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 4 states. [2019-10-07 03:48:22,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:22,244 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2019-10-07 03:48:22,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 03:48:22,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-07 03:48:22,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:22,249 INFO L225 Difference]: With dead ends: 82 [2019-10-07 03:48:22,249 INFO L226 Difference]: Without dead ends: 68 [2019-10-07 03:48:22,250 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:48:22,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-07 03:48:22,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-10-07 03:48:22,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-07 03:48:22,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-10-07 03:48:22,257 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 18 [2019-10-07 03:48:22,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:22,257 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-10-07 03:48:22,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 03:48:22,257 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-10-07 03:48:22,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 03:48:22,258 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:22,258 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:48:22,259 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:22,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:22,259 INFO L82 PathProgramCache]: Analyzing trace with hash -2109931812, now seen corresponding path program 1 times [2019-10-07 03:48:22,260 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:22,260 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:22,260 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:22,260 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:22,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:22,413 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:22,413 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:22,414 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:48:22,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:48:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:22,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-07 03:48:22,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:48:22,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-07 03:48:22,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:22,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:22,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-07 03:48:22,665 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-07 03:48:22,713 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:22,714 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:48:22,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:22,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:22,758 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|, |v_#memory_$Pointer$.offset_41|], 10=[|v_#memory_$Pointer$.base_41|]} [2019-10-07 03:48:22,768 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:22,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:22,786 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_41| vanished before elimination [2019-10-07 03:48:22,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:48:22,852 INFO L341 Elim1Store]: treesize reduction 73, result has 29.1 percent of original size [2019-10-07 03:48:22,853 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 43 treesize of output 37 [2019-10-07 03:48:22,854 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:22,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:22,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 03:48:22,898 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-07 03:48:22,898 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:343, output treesize:54 [2019-10-07 03:48:22,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 03:48:22,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 03:48:25,116 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:25,116 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 35 treesize of output 30 [2019-10-07 03:48:25,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:25,135 INFO L567 ElimStorePlain]: treesize reduction 12, result has 42.9 percent of original size [2019-10-07 03:48:25,135 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 03:48:25,136 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2019-10-07 03:48:25,149 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:25,149 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:48:25,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:48:25,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:48:25,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:48:25,222 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_10, |#memory_$Pointer$.offset|, v_prenex_11, v_prenex_18, v_prenex_17, |v_#memory_$Pointer$.offset_42|], 2=[v_prenex_13, |v_#memory_$Pointer$.base_42|, v_prenex_6], 7=[v_prenex_4], 10=[v_prenex_9, |#memory_$Pointer$.base|, v_prenex_16]} [2019-10-07 03:48:25,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:48:25,256 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-07 03:48:25,424 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-10-07 03:48:25,424 INFO L341 Elim1Store]: treesize reduction 344, result has 32.3 percent of original size [2019-10-07 03:48:25,425 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 3 case distinctions, treesize of input 358 treesize of output 356 [2019-10-07 03:48:25,427 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:40,493 WARN L191 SmtUtils]: Spent 15.06 s on a formula simplification. DAG size of input: 203 DAG size of output: 203 [2019-10-07 03:48:40,494 INFO L567 ElimStorePlain]: treesize reduction 9, result has 99.3 percent of original size [2019-10-07 03:48:40,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:48:40,525 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-07 03:48:40,691 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-10-07 03:48:40,692 INFO L341 Elim1Store]: treesize reduction 344, result has 32.3 percent of original size [2019-10-07 03:48:40,693 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 3 case distinctions, treesize of input 352 treesize of output 350 [2019-10-07 03:48:40,694 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:48,165 WARN L191 SmtUtils]: Spent 7.47 s on a formula simplification that was a NOOP. DAG size: 219 [2019-10-07 03:48:48,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:48,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:48:48,567 INFO L235 Elim1Store]: Index analysis took 228 ms [2019-10-07 03:48:48,769 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:48,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 350 treesize of output 378 [2019-10-07 03:48:48,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:48:48,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:48:48,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-07 03:48:48,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:48:48,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:48:48,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:48:48,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:48:48,778 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-07 03:49:00,009 WARN L191 SmtUtils]: Spent 11.23 s on a formula simplification. DAG size of input: 221 DAG size of output: 187 [2019-10-07 03:49:00,009 INFO L567 ElimStorePlain]: treesize reduction 371, result has 73.7 percent of original size [2019-10-07 03:49:00,036 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-07 03:49:02,814 WARN L191 SmtUtils]: Spent 2.78 s on a formula simplification that was a NOOP. DAG size: 171 [2019-10-07 03:49:02,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:49:02,815 INFO L464 ElimStorePlain]: Eliminatee v_prenex_17 vanished before elimination [2019-10-07 03:49:02,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:49:02,905 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:49:02,906 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 350 treesize of output 378 [2019-10-07 03:49:02,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:49:02,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:49:02,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 03:49:02,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-07 03:49:02,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 03:49:02,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:49:02,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 03:49:02,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:49:02,914 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-07 03:49:04,730 WARN L191 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 176 DAG size of output: 139 [2019-10-07 03:49:04,730 INFO L567 ElimStorePlain]: treesize reduction 350, result has 66.9 percent of original size [2019-10-07 03:49:04,735 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:49:05,194 WARN L191 SmtUtils]: Spent 458.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-10-07 03:49:05,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:49:05,200 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:49:05,361 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2019-10-07 03:49:05,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:49:05,367 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:49:05,514 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2019-10-07 03:49:05,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:49:05,539 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 1484 treesize of output 1452 [2019-10-07 03:49:05,561 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-10-07 03:49:06,358 WARN L191 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 127 [2019-10-07 03:49:06,358 INFO L567 ElimStorePlain]: treesize reduction 1348, result has 27.0 percent of original size [2019-10-07 03:49:06,389 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 8409 treesize of output 8377 [2019-10-07 03:49:06,395 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-10-07 03:49:08,150 WARN L191 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 201 DAG size of output: 129 [2019-10-07 03:49:08,151 INFO L567 ElimStorePlain]: treesize reduction 8252, result has 4.9 percent of original size [2019-10-07 03:49:08,169 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 12009 treesize of output 11945 [2019-10-07 03:49:08,175 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-10-07 03:49:09,948 WARN L191 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 244 DAG size of output: 129 [2019-10-07 03:49:09,949 INFO L567 ElimStorePlain]: treesize reduction 11778, result has 2.9 percent of original size [2019-10-07 03:49:09,975 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 6625 treesize of output 6593 [2019-10-07 03:49:09,980 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-10-07 03:49:11,254 WARN L191 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 204 DAG size of output: 132 [2019-10-07 03:49:11,255 INFO L567 ElimStorePlain]: treesize reduction 6462, result has 4.3 percent of original size [2019-10-07 03:49:11,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:49:11,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:49:11,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:49:11,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:49:11,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:49:11,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:49:11,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:49:11,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:49:11,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 03:49:11,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:49:11,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 03:49:11,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:49:11,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:49:11,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:49:11,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:49:11,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:49:11,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:49:11,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:49:11,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:49:11,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:49:11,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:49:11,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:49:11,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 13 dim-2 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-10-07 03:49:11,285 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 25 variables, input treesize:1213, output treesize:292 [2019-10-07 03:49:11,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:49:11,412 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 03:49:11,433 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-07 03:49:11,434 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 03:49:11,440 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 03:49:11,447 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 03:49:11,447 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 03:49:11,535 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-07 03:49:31,193 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= 12 (select |#length| |main_#t~malloc2.base|)) [2019-10-07 03:49:35,611 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= 12 (select |#length| |main_#t~malloc2.base|)) [2019-10-07 03:49:39,121 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= 12 (select |#length| |main_#t~malloc2.base|)) [2019-10-07 03:49:45,392 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= 12 (select |#length| |main_#t~malloc2.base|)) [2019-10-07 03:49:47,402 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= 12 (select |#length| |main_#t~malloc2.base|)) [2019-10-07 03:49:53,360 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= 12 (select |#length| |main_#t~malloc2.base|)) [2019-10-07 03:50:09,901 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= 1 (select |v_#valid_32| |main_#t~malloc2.base|)) [2019-10-07 03:50:12,466 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |#valid| |main_#t~malloc2.base|) 1) [2019-10-07 03:50:22,262 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |#valid| |main_#t~malloc2.base|) 1) [2019-10-07 03:50:27,941 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= 1 (select |v_#valid_32| |main_#t~malloc2.base|)) [2019-10-07 03:50:29,957 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= 1 (select |v_#valid_32| |main_#t~malloc2.base|)) [2019-10-07 03:50:38,794 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= 1 (select |v_#valid_32| |main_#t~malloc2.base|)) [2019-10-07 03:50:41,398 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |#valid| |main_#t~malloc2.base|) 1) [2019-10-07 03:51:08,834 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse1 (+ |main_#t~malloc2.offset| 4))) (= (select (select (let ((.cse0 (store v_prenex_71 v_prenex_73 (store (select v_prenex_71 v_prenex_73) v_prenex_68 |main_#t~malloc2.offset|)))) (store .cse0 |main_#t~malloc2.base| (store (select .cse0 |main_#t~malloc2.base|) .cse1 v_prenex_68))) v_prenex_73) v_prenex_68) .cse1)) [2019-10-07 03:51:16,038 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |#memory_int| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) 2) [2019-10-07 03:51:30,012 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 8)) 3) [2019-10-07 03:51:46,745 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (+ main_~item~0.offset 8) (select (select (let ((.cse0 (store v_prenex_101 v_prenex_104 (store (select v_prenex_101 v_prenex_104) v_prenex_103 |main_#t~malloc2.offset|)))) (store .cse0 |main_#t~malloc2.base| (store (select .cse0 |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4) v_prenex_103))) v_prenex_104) v_prenex_103)) [2019-10-07 03:51:51,479 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select (select |#memory_int| main_~item~0.base) main_~item~0.offset) 3) [2019-10-07 03:51:53,487 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |#memory_int| main_~item~0.base) main_~item~0.offset) 3) [2019-10-07 03:52:20,859 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-10-07 03:52:21,251 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-10-07 03:52:21,607 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-10-07 03:52:22,106 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2019-10-07 03:52:23,255 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2019-10-07 03:52:23,601 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2019-10-07 03:52:23,865 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2019-10-07 03:52:24,211 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-10-07 03:52:24,496 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-10-07 03:52:24,718 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2019-10-07 03:52:25,066 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-10-07 03:52:25,305 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2019-10-07 03:52:26,170 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 03:52:26,175 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 03:52:26,176 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 03:52:26,176 INFO L193 IcfgInterpreter]: Reachable states at location L993-1 satisfy 123#(and (<= 0 (+ |main_#t~nondet1| 2147483648)) (<= |main_#t~nondet1| 2147483647)) [2019-10-07 03:52:26,176 INFO L193 IcfgInterpreter]: Reachable states at location L1024 satisfy 308#(and (<= main_~status~0 1) (or (and (not (= 0 main_~head~0.offset)) (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem5.base|)) (and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem5.base|) (not (= 0 main_~head~0.base)))) (<= 1 main_~status~0)) [2019-10-07 03:52:26,177 INFO L193 IcfgInterpreter]: Reachable states at location L1017-4 satisfy 106#true [2019-10-07 03:52:26,178 INFO L193 IcfgInterpreter]: Reachable states at location L1016-3 satisfy 128#(or (exists ((v_prenex_68 Int) (v_prenex_64 Int) (v_prenex_61 Int) (v_prenex_56 Int) (v_prenex_96 Int) (v_prenex_95 Int) (v_prenex_54 Int) (v_prenex_103 Int) (v_prenex_104 Int) (v_prenex_88 Int) (v_main_~item~0.offset_32 Int) (v_prenex_84 Int) (v_prenex_81 Int) (v_prenex_73 Int) (v_prenex_76 Int) (v_main_~item~0.base_32 Int)) (or (and (or (= (select (select |#memory_int| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) (select (select |#memory_int| main_~item~0.base) main_~item~0.offset)) (not (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset))) (or (= (select (select |#memory_$Pointer$.offset| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) 0) (not (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset))) (not (= |main_#t~malloc2.base| 0)) (= 0 |main_#t~malloc2.offset|) (not (= 0 v_prenex_73)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (or (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| v_prenex_73) v_prenex_68)) (and (= main_~item~0.base v_prenex_73) (= v_prenex_68 main_~item~0.offset)) (and (= main_~item~0.base v_prenex_73) (= (+ main_~item~0.offset 8) v_prenex_68))) (or (not (= main_~item~0.base v_prenex_73)) (not (= v_prenex_68 main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| v_prenex_73) v_prenex_68))) (or (not (= (+ main_~item~0.offset 8) (+ |main_#t~malloc2.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) (select (select |#memory_$Pointer$.offset| main_~item~0.base) (+ main_~item~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (or (and (= main_~item~0.base v_prenex_73) (= v_prenex_68 main_~item~0.offset)) (and (= main_~item~0.base v_prenex_73) (= (+ main_~item~0.offset 8) v_prenex_68)) (= (select (select |#memory_$Pointer$.offset| v_prenex_73) v_prenex_68) |main_#t~malloc2.offset|)) (or (and (= |main_#t~malloc2.base| v_prenex_73) (= (+ |main_#t~malloc2.offset| 4) v_prenex_68) (= v_prenex_68 main_~item~0.offset)) (and (= |main_#t~malloc2.offset| main_~item~0.offset) (or (not (= (+ |main_#t~malloc2.offset| 4) v_prenex_68)) (not (= |main_#t~malloc2.base| v_prenex_73))))) (or (not (= |main_#t~malloc2.base| main_~item~0.base)) (not (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset)) (= (select (select |#memory_$Pointer$.base| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) 0)) (or (= (select (select |#memory_$Pointer$.base| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) v_prenex_73) (and (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset) (= |main_#t~malloc2.base| main_~item~0.base))) (= main_~status~0 2) (= 12 (select |#length| |main_#t~malloc2.base|)) (or (= (+ main_~item~0.offset 8) (+ |main_#t~malloc2.offset| 4)) (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset) (= (select (select |#memory_$Pointer$.offset| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) v_prenex_68)) (or (not (= main_~item~0.base v_prenex_73)) (not (= v_prenex_68 main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| v_prenex_73) v_prenex_68))) (= (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 8)) 2) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= (select |#valid| |main_#t~malloc2.base|) 1) (or (and (= main_~item~0.base v_prenex_73) (= |main_#t~malloc2.base| v_prenex_73) (= (+ |main_#t~malloc2.offset| 4) v_prenex_68)) (and (or (not (= (+ |main_#t~malloc2.offset| 4) v_prenex_68)) (not (= |main_#t~malloc2.base| v_prenex_73))) (= |main_#t~malloc2.base| main_~item~0.base)))) (and (or (= (+ main_~item~0.offset 8) (+ |main_#t~malloc2.offset| 4)) (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset) (= (select (select |#memory_$Pointer$.offset| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) v_prenex_76)) (not (= |main_#t~malloc2.base| 0)) (or (= (select (select |#memory_$Pointer$.offset| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) 0) (not (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset))) (= 0 |main_#t~malloc2.offset|) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (or (= (select (select |#memory_$Pointer$.base| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) v_prenex_81) (and (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset) (= |main_#t~malloc2.base| main_~item~0.base))) (or (not (= (+ main_~item~0.offset 8) (+ |main_#t~malloc2.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) (select (select |#memory_$Pointer$.offset| main_~item~0.base) (+ main_~item~0.offset 8)))) (or (and (= |main_#t~malloc2.base| v_prenex_81) (= v_prenex_76 main_~item~0.offset) (= (+ |main_#t~malloc2.offset| 4) v_prenex_76)) (and (or (not (= (+ |main_#t~malloc2.offset| 4) v_prenex_76)) (not (= |main_#t~malloc2.base| v_prenex_81))) (= |main_#t~malloc2.offset| main_~item~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (or (and (= (+ main_~item~0.offset 8) v_prenex_76) (= main_~item~0.base v_prenex_81)) (and (= main_~item~0.base v_prenex_81) (= v_prenex_76 main_~item~0.offset)) (= (select (select |#memory_$Pointer$.offset| v_prenex_81) v_prenex_76) |main_#t~malloc2.offset|)) (or (not (= |main_#t~malloc2.base| main_~item~0.base)) (not (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset)) (= (select (select |#memory_$Pointer$.base| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) 0)) (or (not (= v_prenex_76 main_~item~0.offset)) (not (= main_~item~0.base v_prenex_81)) (= 0 (select (select |#memory_$Pointer$.base| v_prenex_81) v_prenex_76))) (= main_~status~0 2) (= 12 (select |#length| |main_#t~malloc2.base|)) (or (and (= |main_#t~malloc2.base| v_prenex_81) (= main_~item~0.base v_prenex_81) (= (+ |main_#t~malloc2.offset| 4) v_prenex_76)) (and (or (not (= (+ |main_#t~malloc2.offset| 4) v_prenex_76)) (not (= |main_#t~malloc2.base| v_prenex_81))) (= |main_#t~malloc2.base| main_~item~0.base))) (= (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 8)) 2) (or (not (= v_prenex_76 main_~item~0.offset)) (not (= main_~item~0.base v_prenex_81)) (= (select (select |#memory_$Pointer$.offset| v_prenex_81) v_prenex_76) 0)) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= (select |#valid| |main_#t~malloc2.base|) 1) (not (= v_prenex_76 0)) (or (and (= (+ main_~item~0.offset 8) v_prenex_76) (= main_~item~0.base v_prenex_81)) (and (= main_~item~0.base v_prenex_81) (= v_prenex_76 main_~item~0.offset)) (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| v_prenex_81) v_prenex_76)))) (and (not (= |main_#t~malloc2.base| 0)) (or (= (select (select |#memory_$Pointer$.offset| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) 0) (not (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset))) (= (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 8)) 3) (not (= v_prenex_54 0)) (= 0 |main_#t~malloc2.offset|) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (or (= (+ main_~item~0.offset 8) (+ |main_#t~malloc2.offset| 4)) (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset) (= (select (select |#memory_$Pointer$.offset| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) v_prenex_54)) (or (= (select (select |#memory_$Pointer$.base| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) v_prenex_56) (and (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset) (= |main_#t~malloc2.base| main_~item~0.base))) (= main_~status~0 3) (or (not (= main_~item~0.base v_prenex_56)) (= (select (select |#memory_$Pointer$.base| v_prenex_56) v_prenex_54) 0) (not (= v_prenex_54 main_~item~0.offset))) (or (not (= (+ main_~item~0.offset 8) (+ |main_#t~malloc2.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) (select (select |#memory_$Pointer$.offset| main_~item~0.base) (+ main_~item~0.offset 8)))) (or (and (= main_~item~0.base v_prenex_56) (= v_prenex_54 main_~item~0.offset)) (= (select (select |#memory_$Pointer$.offset| v_prenex_56) v_prenex_54) |main_#t~malloc2.offset|) (and (= (+ main_~item~0.offset 8) v_prenex_54) (= main_~item~0.base v_prenex_56))) (or (and (= main_~item~0.base v_prenex_56) (= v_prenex_54 main_~item~0.offset)) (and (= (+ main_~item~0.offset 8) v_prenex_54) (= main_~item~0.base v_prenex_56)) (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| v_prenex_56) v_prenex_54))) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (or (and (= |main_#t~malloc2.base| v_prenex_56) (= v_prenex_54 main_~item~0.offset) (= (+ |main_#t~malloc2.offset| 4) v_prenex_54)) (and (= |main_#t~malloc2.offset| main_~item~0.offset) (or (not (= (+ |main_#t~malloc2.offset| 4) v_prenex_54)) (not (= |main_#t~malloc2.base| v_prenex_56))))) (or (not (= |main_#t~malloc2.base| main_~item~0.base)) (not (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset)) (= (select (select |#memory_$Pointer$.base| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) 0)) (or (not (= main_~item~0.base v_prenex_56)) (= (select (select |#memory_$Pointer$.offset| v_prenex_56) v_prenex_54) 0) (not (= v_prenex_54 main_~item~0.offset))) (= 12 (select |#length| |main_#t~malloc2.base|)) (or (and (= |main_#t~malloc2.base| v_prenex_56) (= main_~item~0.base v_prenex_56) (= (+ |main_#t~malloc2.offset| 4) v_prenex_54)) (and (or (not (= (+ |main_#t~malloc2.offset| 4) v_prenex_54)) (not (= |main_#t~malloc2.base| v_prenex_56))) (= |main_#t~malloc2.base| main_~item~0.base))) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= (select |#valid| |main_#t~malloc2.base|) 1)) (and (or (= (select (select |#memory_int| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) (select (select |#memory_int| main_~item~0.base) main_~item~0.offset)) (not (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset))) (or (= (select (select |#memory_$Pointer$.offset| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) 0) (not (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset))) (not (= |main_#t~malloc2.base| 0)) (or (= (select (select |#memory_$Pointer$.offset| v_prenex_96) v_prenex_95) 0) (not (= main_~item~0.base v_prenex_96)) (not (= v_prenex_95 main_~item~0.offset))) (= 0 |main_#t~malloc2.offset|) (or (= (select (select |#memory_$Pointer$.base| v_prenex_96) v_prenex_95) 0) (not (= main_~item~0.base v_prenex_96)) (not (= v_prenex_95 main_~item~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (or (and (= v_prenex_95 main_~item~0.offset) (= main_~item~0.base v_prenex_96)) (and (= main_~item~0.base v_prenex_96) (= (+ main_~item~0.offset 8) v_prenex_95)) (= (select (select |#memory_$Pointer$.offset| v_prenex_96) v_prenex_95) |main_#t~malloc2.offset|)) (not (= v_prenex_95 0)) (or (not (= (+ main_~item~0.offset 8) (+ |main_#t~malloc2.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) (select (select |#memory_$Pointer$.offset| main_~item~0.base) (+ main_~item~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (or (and (= v_prenex_95 main_~item~0.offset) (= main_~item~0.base v_prenex_96)) (= (select (select |#memory_$Pointer$.base| v_prenex_96) v_prenex_95) |main_#t~malloc2.base|) (and (= main_~item~0.base v_prenex_96) (= (+ main_~item~0.offset 8) v_prenex_95))) (or (not (= |main_#t~malloc2.base| main_~item~0.base)) (not (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset)) (= (select (select |#memory_$Pointer$.base| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) 0)) (= 12 (select |#length| |main_#t~malloc2.base|)) (or (= (+ main_~item~0.offset 8) (+ |main_#t~malloc2.offset| 4)) (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset) (= (select (select |#memory_$Pointer$.offset| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) v_prenex_95)) (= main_~status~0 1) (or (and (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset) (= |main_#t~malloc2.base| main_~item~0.base)) (= (select (select |#memory_$Pointer$.base| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) v_prenex_96)) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= (select |#valid| |main_#t~malloc2.base|) 1) (= (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 8)) 1) (or (and (= |main_#t~malloc2.offset| main_~item~0.offset) (or (not (= (+ |main_#t~malloc2.offset| 4) v_prenex_95)) (not (= |main_#t~malloc2.base| v_prenex_96)))) (and (= |main_#t~malloc2.base| v_prenex_96) (= v_prenex_95 main_~item~0.offset) (= (+ |main_#t~malloc2.offset| 4) v_prenex_95))) (or (and (= |main_#t~malloc2.base| v_prenex_96) (= (+ |main_#t~malloc2.offset| 4) v_prenex_95) (= main_~item~0.base v_prenex_96)) (and (or (not (= (+ |main_#t~malloc2.offset| 4) v_prenex_95)) (not (= |main_#t~malloc2.base| v_prenex_96))) (= |main_#t~malloc2.base| main_~item~0.base)))) (and (or (= (select (select |#memory_int| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) (select (select |#memory_int| main_~item~0.base) main_~item~0.offset)) (not (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset))) (or (= (select (select |#memory_$Pointer$.offset| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) 0) (not (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset))) (not (= |main_#t~malloc2.base| 0)) (not (= 0 v_prenex_64)) (= 0 |main_#t~malloc2.offset|) (or (and (= main_~item~0.base v_prenex_64) (= v_prenex_61 main_~item~0.offset)) (and (= (+ main_~item~0.offset 8) v_prenex_61) (= main_~item~0.base v_prenex_64)) (= (select (select |#memory_$Pointer$.offset| v_prenex_64) v_prenex_61) |main_#t~malloc2.offset|)) (or (and (or (not (= |main_#t~malloc2.base| v_prenex_64)) (not (= (+ |main_#t~malloc2.offset| 4) v_prenex_61))) (= |main_#t~malloc2.offset| main_~item~0.offset)) (and (= (+ |main_#t~malloc2.offset| 4) v_prenex_61) (= |main_#t~malloc2.base| v_prenex_64) (= v_prenex_61 main_~item~0.offset))) (or (not (= main_~item~0.base v_prenex_64)) (= (select (select |#memory_$Pointer$.offset| v_prenex_64) v_prenex_61) 0) (not (= v_prenex_61 main_~item~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (or (and (= (+ |main_#t~malloc2.offset| 4) v_prenex_61) (= |main_#t~malloc2.base| v_prenex_64) (= main_~item~0.base v_prenex_64)) (and (or (not (= |main_#t~malloc2.base| v_prenex_64)) (not (= (+ |main_#t~malloc2.offset| 4) v_prenex_61))) (= |main_#t~malloc2.base| main_~item~0.base))) (or (not (= (+ main_~item~0.offset 8) (+ |main_#t~malloc2.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) (select (select |#memory_$Pointer$.offset| main_~item~0.base) (+ main_~item~0.offset 8)))) (or (= (+ main_~item~0.offset 8) (+ |main_#t~malloc2.offset| 4)) (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset) (= (select (select |#memory_$Pointer$.offset| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) v_prenex_61)) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (or (not (= |main_#t~malloc2.base| main_~item~0.base)) (not (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset)) (= (select (select |#memory_$Pointer$.base| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) 0)) (= 12 (select |#length| |main_#t~malloc2.base|)) (= main_~status~0 1) (or (and (= main_~item~0.base v_prenex_64) (= v_prenex_61 main_~item~0.offset)) (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| v_prenex_64) v_prenex_61)) (and (= (+ main_~item~0.offset 8) v_prenex_61) (= main_~item~0.base v_prenex_64))) (or (= (select (select |#memory_$Pointer$.base| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) v_prenex_64) (and (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset) (= |main_#t~malloc2.base| main_~item~0.base))) (or (not (= main_~item~0.base v_prenex_64)) (not (= v_prenex_61 main_~item~0.offset)) (= (select (select |#memory_$Pointer$.base| v_prenex_64) v_prenex_61) 0)) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= (select |#valid| |main_#t~malloc2.base|) 1) (= (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 8)) 1)) (and (not (= main_~status~0 0)) (or (= (select (select |#memory_$Pointer$.offset| v_main_~item~0.base_32) v_main_~item~0.offset_32) |main_#t~malloc2.offset|) (and (= v_main_~item~0.offset_32 main_~item~0.offset) (= main_~item~0.base v_main_~item~0.base_32))) (not (= |main_#t~malloc2.base| 0)) (or (= (select (select |#memory_$Pointer$.offset| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) 0) (not (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset))) (< main_~status~0 2) (or (and (or (not (= v_main_~item~0.offset_32 (+ |main_#t~malloc2.offset| 4))) (not (= |main_#t~malloc2.base| v_main_~item~0.base_32))) (= |main_#t~malloc2.offset| main_~item~0.offset)) (and (= |main_#t~malloc2.base| v_main_~item~0.base_32) (= v_main_~item~0.offset_32 main_~item~0.offset) (= v_main_~item~0.offset_32 (+ |main_#t~malloc2.offset| 4)))) (or (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset) (= (select (select |#memory_$Pointer$.offset| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) v_main_~item~0.offset_32)) (= 0 |main_#t~malloc2.offset|) (or (= 0 (select (select |#memory_$Pointer$.offset| v_main_~item~0.base_32) v_main_~item~0.offset_32)) (not (= main_~item~0.base v_main_~item~0.base_32)) (not (= v_main_~item~0.offset_32 main_~item~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (or (= (select (select |#memory_$Pointer$.base| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) v_main_~item~0.base_32) (and (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset) (= |main_#t~malloc2.base| main_~item~0.base))) (or (not (= main_~item~0.base v_main_~item~0.base_32)) (not (= v_main_~item~0.offset_32 main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| v_main_~item~0.base_32) v_main_~item~0.offset_32))) (not (= v_main_~item~0.offset_32 0)) (or (not (= |main_#t~malloc2.base| main_~item~0.base)) (not (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset)) (= (select (select |#memory_$Pointer$.base| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) 0)) (= 12 (select |#length| |main_#t~malloc2.base|)) (or (and (= |main_#t~malloc2.base| v_main_~item~0.base_32) (= main_~item~0.base v_main_~item~0.base_32) (= v_main_~item~0.offset_32 (+ |main_#t~malloc2.offset| 4))) (and (or (not (= v_main_~item~0.offset_32 (+ |main_#t~malloc2.offset| 4))) (not (= |main_#t~malloc2.base| v_main_~item~0.base_32))) (= |main_#t~malloc2.base| main_~item~0.base))) (not (= main_~status~0 1)) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= (select |#valid| |main_#t~malloc2.base|) 1) (or (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| v_main_~item~0.base_32) v_main_~item~0.offset_32)) (and (= v_main_~item~0.offset_32 main_~item~0.offset) (= main_~item~0.base v_main_~item~0.base_32)))) (and (or (and (= main_~item~0.base v_prenex_88) (= v_prenex_84 main_~item~0.offset)) (= (select (select |#memory_$Pointer$.offset| v_prenex_88) v_prenex_84) |main_#t~malloc2.offset|)) (not (= 0 v_prenex_88)) (not (= main_~status~0 0)) (not (= |main_#t~malloc2.base| 0)) (or (= (select (select |#memory_$Pointer$.offset| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) 0) (not (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset))) (< main_~status~0 2) (or (= 0 (select (select |#memory_$Pointer$.offset| v_prenex_88) v_prenex_84)) (not (= main_~item~0.base v_prenex_88)) (not (= v_prenex_84 main_~item~0.offset))) (= 0 |main_#t~malloc2.offset|) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (or (= 0 (select (select |#memory_$Pointer$.base| v_prenex_88) v_prenex_84)) (not (= main_~item~0.base v_prenex_88)) (not (= v_prenex_84 main_~item~0.offset))) (or (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset) (= (select (select |#memory_$Pointer$.offset| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) v_prenex_84)) (or (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| v_prenex_88) v_prenex_84)) (and (= main_~item~0.base v_prenex_88) (= v_prenex_84 main_~item~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (or (and (= (+ |main_#t~malloc2.offset| 4) v_prenex_84) (= |main_#t~malloc2.base| v_prenex_88) (= v_prenex_84 main_~item~0.offset)) (and (or (not (= (+ |main_#t~malloc2.offset| 4) v_prenex_84)) (not (= |main_#t~malloc2.base| v_prenex_88))) (= |main_#t~malloc2.offset| main_~item~0.offset))) (or (not (= |main_#t~malloc2.base| main_~item~0.base)) (not (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset)) (= (select (select |#memory_$Pointer$.base| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) 0)) (= 12 (select |#length| |main_#t~malloc2.base|)) (not (= main_~status~0 1)) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= (select |#valid| |main_#t~malloc2.base|) 1) (or (and (or (not (= (+ |main_#t~malloc2.offset| 4) v_prenex_84)) (not (= |main_#t~malloc2.base| v_prenex_88))) (= |main_#t~malloc2.base| main_~item~0.base)) (and (= (+ |main_#t~malloc2.offset| 4) v_prenex_84) (= |main_#t~malloc2.base| v_prenex_88) (= main_~item~0.base v_prenex_88))) (or (= (select (select |#memory_$Pointer$.base| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) v_prenex_88) (and (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset) (= |main_#t~malloc2.base| main_~item~0.base)))) (and (or (= (+ main_~item~0.offset 8) (+ |main_#t~malloc2.offset| 4)) (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset) (= (select (select |#memory_$Pointer$.offset| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) v_prenex_103)) (not (= |main_#t~malloc2.base| 0)) (or (= (select (select |#memory_$Pointer$.offset| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) 0) (not (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset))) (= (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 8)) 3) (= 0 |main_#t~malloc2.offset|) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~status~0 3) (or (and (= |main_#t~malloc2.offset| main_~item~0.offset) (or (not (= |main_#t~malloc2.base| v_prenex_104)) (not (= (+ |main_#t~malloc2.offset| 4) v_prenex_103)))) (and (= v_prenex_103 main_~item~0.offset) (= |main_#t~malloc2.base| v_prenex_104) (= (+ |main_#t~malloc2.offset| 4) v_prenex_103))) (or (not (= (+ main_~item~0.offset 8) (+ |main_#t~malloc2.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) (select (select |#memory_$Pointer$.offset| main_~item~0.base) (+ main_~item~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (or (= (select (select |#memory_$Pointer$.base| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) v_prenex_104) (and (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset) (= |main_#t~malloc2.base| main_~item~0.base))) (or (not (= |main_#t~malloc2.base| main_~item~0.base)) (not (= (+ |main_#t~malloc2.offset| 4) main_~item~0.offset)) (= (select (select |#memory_$Pointer$.base| |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4)) 0)) (or (= (select (select |#memory_$Pointer$.offset| v_prenex_104) v_prenex_103) |main_#t~malloc2.offset|) (and (= (+ main_~item~0.offset 8) v_prenex_103) (= main_~item~0.base v_prenex_104)) (and (= v_prenex_103 main_~item~0.offset) (= main_~item~0.base v_prenex_104))) (= 12 (select |#length| |main_#t~malloc2.base|)) (or (not (= main_~item~0.base v_prenex_104)) (not (= v_prenex_103 main_~item~0.offset)) (= (select (select |#memory_$Pointer$.offset| v_prenex_104) v_prenex_103) 0)) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= (select |#valid| |main_#t~malloc2.base|) 1) (or (and (= (+ main_~item~0.offset 8) v_prenex_103) (= main_~item~0.base v_prenex_104)) (and (= v_prenex_103 main_~item~0.offset) (= main_~item~0.base v_prenex_104)) (= (select (select |#memory_$Pointer$.base| v_prenex_104) v_prenex_103) |main_#t~malloc2.base|)) (or (not (= main_~item~0.base v_prenex_104)) (= (select (select |#memory_$Pointer$.base| v_prenex_104) v_prenex_103) 0) (not (= v_prenex_103 main_~item~0.offset))) (or (and (= |main_#t~malloc2.base| v_prenex_104) (= (+ |main_#t~malloc2.offset| 4) v_prenex_103) (= main_~item~0.base v_prenex_104)) (and (or (not (= |main_#t~malloc2.base| v_prenex_104)) (not (= (+ |main_#t~malloc2.offset| 4) v_prenex_103))) (= |main_#t~malloc2.base| main_~item~0.base))) (not (= 0 v_prenex_104))))) (exists ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_12 Int) (v_DerPreprocessor_9 Int) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_7 Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_10 Int)) (and (= 0 |#NULL.base|) (= 0 |main_#t~malloc2.offset|) (= 0 |main_#t~malloc0.offset|) (<= 0 |#NULL.base|) (= |#valid| (store (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (= |main_#t~malloc0.base| main_~head~0.base) (= (store (store (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) 0) (+ main_~head~0.offset 8) v_DerPreprocessor_11) main_~head~0.offset |main_#t~malloc2.base|)) |main_#t~malloc2.base| (store (select (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) 0) (+ main_~head~0.offset 8) v_DerPreprocessor_11) main_~head~0.offset |main_#t~malloc2.base|)) |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4) main_~head~0.base)) main_~item~0.base (store (store (select (store (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) 0) (+ main_~head~0.offset 8) v_DerPreprocessor_11) main_~head~0.offset |main_#t~malloc2.base|)) |main_#t~malloc2.base| (store (select (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) 0) (+ main_~head~0.offset 8) v_DerPreprocessor_11) main_~head~0.offset |main_#t~malloc2.base|)) |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4) main_~head~0.base)) main_~item~0.base) main_~item~0.offset 0) (+ main_~item~0.offset 8) (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 8)))) |#memory_$Pointer$.base|) (= main_~status~0 1) (= (select (select (store (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) 0) (+ main_~head~0.offset 8) v_DerPreprocessor_12) main_~head~0.offset |main_#t~malloc2.offset|)) |main_#t~malloc2.base| (store (select (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) 0) (+ main_~head~0.offset 8) v_DerPreprocessor_12) main_~head~0.offset |main_#t~malloc2.offset|)) |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4) main_~head~0.offset)) main_~head~0.base) main_~head~0.offset) main_~item~0.offset) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= (store (store |old(#length)| |main_#t~malloc0.base| 12) |main_#t~malloc2.base| 12) |#length|) (= (store (store (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) 0) (+ main_~head~0.offset 8) v_DerPreprocessor_12) main_~head~0.offset |main_#t~malloc2.offset|)) |main_#t~malloc2.base| (store (select (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) 0) (+ main_~head~0.offset 8) v_DerPreprocessor_12) main_~head~0.offset |main_#t~malloc2.offset|)) |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4) main_~head~0.offset)) main_~item~0.base (store (store (select (store (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) 0) (+ main_~head~0.offset 8) v_DerPreprocessor_12) main_~head~0.offset |main_#t~malloc2.offset|)) |main_#t~malloc2.base| (store (select (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) 0) (+ main_~head~0.offset 8) v_DerPreprocessor_12) main_~head~0.offset |main_#t~malloc2.offset|)) |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4) main_~head~0.offset)) main_~item~0.base) main_~item~0.offset 0) (+ main_~item~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~item~0.base) (+ main_~item~0.offset 8)))) |#memory_$Pointer$.offset|) (= (store (store (store |old(#memory_int)| main_~head~0.base (store (store (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_DerPreprocessor_6) (+ main_~head~0.offset 4) v_DerPreprocessor_7) (+ main_~head~0.offset 8) 0) main_~head~0.offset v_DerPreprocessor_8)) |main_#t~malloc2.base| (store (select (store |old(#memory_int)| main_~head~0.base (store (store (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_DerPreprocessor_6) (+ main_~head~0.offset 4) v_DerPreprocessor_7) (+ main_~head~0.offset 8) 0) main_~head~0.offset v_DerPreprocessor_8)) |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4) v_DerPreprocessor_10)) main_~item~0.base (store (store (select (store (store |old(#memory_int)| main_~head~0.base (store (store (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_DerPreprocessor_6) (+ main_~head~0.offset 4) v_DerPreprocessor_7) (+ main_~head~0.offset 8) 0) main_~head~0.offset v_DerPreprocessor_8)) |main_#t~malloc2.base| (store (select (store |old(#memory_int)| main_~head~0.base (store (store (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_DerPreprocessor_6) (+ main_~head~0.offset 4) v_DerPreprocessor_7) (+ main_~head~0.offset 8) 0) main_~head~0.offset v_DerPreprocessor_8)) |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4) v_DerPreprocessor_10)) main_~item~0.base) main_~item~0.offset v_DerPreprocessor_9) (+ main_~item~0.offset 8) 1)) |#memory_int|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= main_~item~0.base (select (select (store (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) 0) (+ main_~head~0.offset 8) v_DerPreprocessor_11) main_~head~0.offset |main_#t~malloc2.base|)) |main_#t~malloc2.base| (store (select (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) 0) (+ main_~head~0.offset 8) v_DerPreprocessor_11) main_~head~0.offset |main_#t~malloc2.base|)) |main_#t~malloc2.base|) (+ |main_#t~malloc2.offset| 4) main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset |main_#t~malloc0.offset|) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (= 0 (select (store |old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc2.base|)) (= |#NULL.offset| 0)))) [2019-10-07 03:52:26,179 INFO L193 IcfgInterpreter]: Reachable states at location L1024-1 satisfy 288#(and (or (and (not (= 0 main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) (= main_~status~0 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) (= main_~status~0 1) (not (= 0 main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (<= main_~status~0 1) (<= 1 main_~status~0)) [2019-10-07 03:52:26,179 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 342#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 03:52:26,180 INFO L193 IcfgInterpreter]: Reachable states at location L1023-3 satisfy 333#(and (or (and (= main_~status~0 1) (not (= 0 main_~head~0.base))) (and (not (= 0 main_~head~0.offset)) (= main_~status~0 1))) (<= main_~status~0 1) (<= 1 main_~status~0)) [2019-10-07 03:52:26,180 INFO L193 IcfgInterpreter]: Reachable states at location L1024-4 satisfy 323#(and (or (and (= main_~status~0 1) (not (= 0 main_~head~0.base))) (and (not (= 0 main_~head~0.offset)) (= main_~status~0 1))) (<= main_~status~0 1) (<= 1 main_~status~0)) [2019-10-07 03:52:26,182 INFO L193 IcfgInterpreter]: Reachable states at location L1023-4 satisfy 338#(and (= main_~status~0 1) (<= main_~status~0 1) (<= 1 main_~status~0)) [2019-10-07 03:52:26,182 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:52:26,183 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:52:26,183 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 347#(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:52:26,183 INFO L193 IcfgInterpreter]: Reachable states at location L1020-2 satisfy 162#(or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) [2019-10-07 03:52:26,184 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 03:52:26,184 INFO L193 IcfgInterpreter]: Reachable states at location mainErr4ASSERT_VIOLATIONERROR_FUNCTION satisfy 263#(and (or (and (= main_~status~0 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) (not (= 0 main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (not (= 0 main_~head~0.offset)) (= main_~status~0 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (<= main_~status~0 1) (<= 1 main_~status~0)) [2019-10-07 03:52:26,184 INFO L193 IcfgInterpreter]: Reachable states at location L1020-3 satisfy 145#true [2019-10-07 03:52:26,185 INFO L193 IcfgInterpreter]: Reachable states at location L1020-4 satisfy 173#true [2019-10-07 03:52:26,185 INFO L193 IcfgInterpreter]: Reachable states at location L1017-2 satisfy 98#(or (not (= 0 main_~item~0.offset)) (not (= main_~item~0.base 0))) [2019-10-07 03:52:26,185 INFO L193 IcfgInterpreter]: Reachable states at location L1016-2 satisfy 137#true [2019-10-07 03:52:26,186 INFO L193 IcfgInterpreter]: Reachable states at location L1017-3 satisfy 93#true [2019-10-07 03:54:00,191 WARN L191 SmtUtils]: Spent 1.55 m on a formula simplification that was a NOOP. DAG size: 477 [2019-10-07 03:54:00,532 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 03:54:00,532 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5, 13] total 21 [2019-10-07 03:54:00,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-07 03:54:00,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-07 03:54:00,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=364, Unknown=1, NotChecked=0, Total=420 [2019-10-07 03:54:00,534 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 21 states. [2019-10-07 03:56:47,716 WARN L191 SmtUtils]: Spent 2.78 m on a formula simplification. DAG size of input: 504 DAG size of output: 405