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/heap-data/running_example.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 03:53:25,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 03:53:25,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 03:53:25,239 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 03:53:25,239 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 03:53:25,241 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 03:53:25,243 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 03:53:25,253 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 03:53:25,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 03:53:25,262 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 03:53:25,263 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 03:53:25,265 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 03:53:25,265 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 03:53:25,267 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 03:53:25,270 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 03:53:25,271 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 03:53:25,273 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 03:53:25,274 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 03:53:25,275 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 03:53:25,280 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 03:53:25,286 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 03:53:25,289 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 03:53:25,293 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 03:53:25,294 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 03:53:25,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 03:53:25,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 03:53:25,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 03:53:25,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 03:53:25,300 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 03:53:25,301 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 03:53:25,301 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 03:53:25,302 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 03:53:25,302 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 03:53:25,303 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 03:53:25,305 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 03:53:25,305 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 03:53:25,306 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 03:53:25,306 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 03:53:25,306 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 03:53:25,307 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 03:53:25,308 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 03:53:25,309 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:53:25,342 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 03:53:25,343 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 03:53:25,346 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 03:53:25,346 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 03:53:25,347 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 03:53:25,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 03:53:25,347 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 03:53:25,347 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 03:53:25,347 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 03:53:25,348 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 03:53:25,348 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 03:53:25,348 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 03:53:25,351 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 03:53:25,351 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 03:53:25,352 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 03:53:25,352 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 03:53:25,352 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 03:53:25,352 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 03:53:25,352 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 03:53:25,353 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 03:53:25,353 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 03:53:25,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 03:53:25,353 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 03:53:25,353 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 03:53:25,354 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 03:53:25,354 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 03:53:25,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 03:53:25,354 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 03:53:25,354 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:53:25,655 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 03:53:25,668 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 03:53:25,672 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 03:53:25,673 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 03:53:25,674 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 03:53:25,675 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/running_example.i [2019-10-07 03:53:25,742 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/113311022/8e045683c7824b3b94701bf693953be3/FLAG18ccc9d36 [2019-10-07 03:53:26,296 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 03:53:26,296 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/running_example.i [2019-10-07 03:53:26,311 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/113311022/8e045683c7824b3b94701bf693953be3/FLAG18ccc9d36 [2019-10-07 03:53:26,599 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/113311022/8e045683c7824b3b94701bf693953be3 [2019-10-07 03:53:26,609 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 03:53:26,610 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 03:53:26,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 03:53:26,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 03:53:26,616 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 03:53:26,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:53:26" (1/1) ... [2019-10-07 03:53:26,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c635417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:53:26, skipping insertion in model container [2019-10-07 03:53:26,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:53:26" (1/1) ... [2019-10-07 03:53:26,628 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 03:53:26,685 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 03:53:27,148 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:53:27,167 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 03:53:27,211 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:53:27,276 INFO L192 MainTranslator]: Completed translation [2019-10-07 03:53:27,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:53:27 WrapperNode [2019-10-07 03:53:27,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 03:53:27,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 03:53:27,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 03:53:27,278 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 03:53:27,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:53:27" (1/1) ... [2019-10-07 03:53:27,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:53:27" (1/1) ... [2019-10-07 03:53:27,307 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:53:27" (1/1) ... [2019-10-07 03:53:27,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:53:27" (1/1) ... [2019-10-07 03:53:27,322 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:53:27" (1/1) ... [2019-10-07 03:53:27,327 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:53:27" (1/1) ... [2019-10-07 03:53:27,331 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:53:27" (1/1) ... [2019-10-07 03:53:27,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 03:53:27,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 03:53:27,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 03:53:27,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 03:53:27,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:53:27" (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:53:27,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 03:53:27,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 03:53:27,408 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-07 03:53:27,408 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-07 03:53:27,409 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 03:53:27,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 03:53:27,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 03:53:27,410 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-07 03:53:27,411 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-07 03:53:27,411 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-07 03:53:27,411 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-07 03:53:27,412 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-07 03:53:27,412 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-07 03:53:27,413 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-07 03:53:27,413 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-07 03:53:27,413 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-07 03:53:27,414 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-07 03:53:27,414 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-07 03:53:27,414 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-07 03:53:27,414 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-07 03:53:27,414 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-07 03:53:27,415 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-07 03:53:27,415 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-07 03:53:27,416 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-07 03:53:27,416 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-07 03:53:27,418 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-07 03:53:27,418 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-07 03:53:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-07 03:53:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-07 03:53:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-07 03:53:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-07 03:53:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-07 03:53:27,420 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-07 03:53:27,420 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-07 03:53:27,420 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-07 03:53:27,420 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-07 03:53:27,420 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-07 03:53:27,420 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-07 03:53:27,421 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-07 03:53:27,421 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-07 03:53:27,421 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-07 03:53:27,422 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-07 03:53:27,422 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-07 03:53:27,422 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-07 03:53:27,422 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-07 03:53:27,422 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-07 03:53:27,422 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-07 03:53:27,422 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-07 03:53:27,423 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-07 03:53:27,423 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-07 03:53:27,423 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-07 03:53:27,423 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-07 03:53:27,423 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-07 03:53:27,423 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-07 03:53:27,423 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-07 03:53:27,424 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-07 03:53:27,424 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-07 03:53:27,424 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-07 03:53:27,424 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-07 03:53:27,425 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 03:53:27,425 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-07 03:53:27,426 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-07 03:53:27,426 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-07 03:53:27,426 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-07 03:53:27,426 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-07 03:53:27,426 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-07 03:53:27,426 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-07 03:53:27,426 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-07 03:53:27,427 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-07 03:53:27,428 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-07 03:53:27,428 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-07 03:53:27,428 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-07 03:53:27,428 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 03:53:27,429 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-07 03:53:27,429 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-07 03:53:27,429 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-07 03:53:27,430 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-07 03:53:27,430 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-07 03:53:27,430 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-07 03:53:27,430 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-07 03:53:27,431 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-07 03:53:27,432 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-07 03:53:27,432 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-07 03:53:27,433 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-07 03:53:27,433 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-07 03:53:27,433 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-07 03:53:27,433 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-07 03:53:27,433 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-07 03:53:27,433 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-07 03:53:27,433 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-07 03:53:27,434 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-07 03:53:27,434 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-07 03:53:27,434 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-07 03:53:27,434 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-07 03:53:27,434 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-07 03:53:27,434 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-07 03:53:27,434 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-07 03:53:27,435 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-07 03:53:27,435 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-07 03:53:27,435 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-07 03:53:27,435 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-07 03:53:27,435 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-07 03:53:27,435 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-07 03:53:27,435 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-07 03:53:27,436 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-07 03:53:27,436 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-07 03:53:27,436 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-07 03:53:27,436 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-07 03:53:27,436 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-07 03:53:27,436 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-07 03:53:27,437 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-07 03:53:27,437 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-07 03:53:27,437 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 03:53:27,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 03:53:27,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 03:53:27,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 03:53:27,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 03:53:27,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 03:53:27,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 03:53:27,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 03:53:27,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 03:53:28,058 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 03:53:28,059 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-07 03:53:28,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:53:28 BoogieIcfgContainer [2019-10-07 03:53:28,060 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 03:53:28,062 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 03:53:28,062 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 03:53:28,065 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 03:53:28,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:53:26" (1/3) ... [2019-10-07 03:53:28,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a77ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:53:28, skipping insertion in model container [2019-10-07 03:53:28,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:53:27" (2/3) ... [2019-10-07 03:53:28,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a77ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:53:28, skipping insertion in model container [2019-10-07 03:53:28,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:53:28" (3/3) ... [2019-10-07 03:53:28,069 INFO L109 eAbstractionObserver]: Analyzing ICFG running_example.i [2019-10-07 03:53:28,080 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 03:53:28,089 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 03:53:28,100 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 03:53:28,124 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 03:53:28,125 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 03:53:28,125 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 03:53:28,125 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 03:53:28,126 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 03:53:28,126 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 03:53:28,126 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 03:53:28,126 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 03:53:28,141 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-10-07 03:53:28,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-07 03:53:28,147 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:53:28,148 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:53:28,150 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:53:28,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:53:28,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1694487947, now seen corresponding path program 1 times [2019-10-07 03:53:28,163 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:53:28,163 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:53:28,163 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:53:28,164 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:53:28,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:53:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:53:28,345 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:53:28,346 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:53:28,347 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:53:28,348 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-07 03:53:28,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-07 03:53:28,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-07 03:53:28,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 03:53:28,372 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-10-07 03:53:28,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:53:28,398 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2019-10-07 03:53:28,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-07 03:53:28,400 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-10-07 03:53:28,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:53:28,413 INFO L225 Difference]: With dead ends: 24 [2019-10-07 03:53:28,413 INFO L226 Difference]: Without dead ends: 15 [2019-10-07 03:53:28,421 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:53:28,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-10-07 03:53:28,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-10-07 03:53:28,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-07 03:53:28,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-10-07 03:53:28,456 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 10 [2019-10-07 03:53:28,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:53:28,457 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-10-07 03:53:28,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-07 03:53:28,457 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2019-10-07 03:53:28,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 03:53:28,458 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:53:28,458 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:53:28,458 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:53:28,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:53:28,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1292257569, now seen corresponding path program 1 times [2019-10-07 03:53:28,459 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:53:28,460 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:53:28,460 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:53:28,460 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:53:28,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:53:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:53:28,636 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:53:28,636 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:53:28,637 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:53:28,637 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 03:53:28,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:53:28,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:53:28,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:53:28,640 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand 5 states. [2019-10-07 03:53:28,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:53:28,756 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2019-10-07 03:53:28,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 03:53:28,757 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-10-07 03:53:28,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:53:28,758 INFO L225 Difference]: With dead ends: 26 [2019-10-07 03:53:28,758 INFO L226 Difference]: Without dead ends: 24 [2019-10-07 03:53:28,759 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-07 03:53:28,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-07 03:53:28,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-10-07 03:53:28,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-07 03:53:28,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-10-07 03:53:28,766 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 12 [2019-10-07 03:53:28,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:53:28,767 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-10-07 03:53:28,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:53:28,767 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2019-10-07 03:53:28,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 03:53:28,768 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:53:28,768 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:53:28,768 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:53:28,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:53:28,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1858299310, now seen corresponding path program 1 times [2019-10-07 03:53:28,769 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:53:28,769 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:53:28,770 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:53:28,770 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:53:28,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:53:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:53:29,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:53:29,050 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:53:29,051 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:53:29,051 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:53:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:53:29,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-07 03:53:29,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:53:29,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:53:29,279 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2019-10-07 03:53:29,279 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:53:29,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:53:29,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:53:29,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2019-10-07 03:53:29,310 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:53:29,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:53:29,328 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-07 03:53:29,329 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-07 03:53:29,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:53:29,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 03:53:29,340 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:55, output treesize:29 [2019-10-07 03:53:29,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:53:29,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:53:29,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:53:29,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:53:29,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:53:29,483 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 91 treesize of output 75 [2019-10-07 03:53:29,486 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:53:29,579 INFO L567 ElimStorePlain]: treesize reduction 173, result has 27.6 percent of original size [2019-10-07 03:53:29,591 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-10-07 03:53:29,592 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:53:29,612 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:53:29,612 INFO L464 ElimStorePlain]: Eliminatee v_prenex_9 vanished before elimination [2019-10-07 03:53:29,612 INFO L464 ElimStorePlain]: Eliminatee v_prenex_10 vanished before elimination [2019-10-07 03:53:29,612 INFO L464 ElimStorePlain]: Eliminatee v_prenex_12 vanished before elimination [2019-10-07 03:53:29,618 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 7 treesize of output 3 [2019-10-07 03:53:29,619 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-07 03:53:29,635 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:53:29,645 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 15 treesize of output 7 [2019-10-07 03:53:29,646 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-07 03:53:29,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:53:29,671 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:53:29,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:53:29,684 INFO L464 ElimStorePlain]: Eliminatee v_prenex_1 vanished before elimination [2019-10-07 03:53:29,684 INFO L464 ElimStorePlain]: Eliminatee v_prenex_2 vanished before elimination [2019-10-07 03:53:29,690 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 18 treesize of output 14 [2019-10-07 03:53:29,706 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-07 03:53:29,707 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-07 03:53:29,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:53:29,709 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-07 03:53:29,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:53:29,715 INFO L464 ElimStorePlain]: Eliminatee v_prenex_3 vanished before elimination [2019-10-07 03:53:29,715 INFO L464 ElimStorePlain]: Eliminatee v_prenex_5 vanished before elimination [2019-10-07 03:53:29,716 INFO L464 ElimStorePlain]: Eliminatee v_prenex_6 vanished before elimination [2019-10-07 03:53:29,716 INFO L464 ElimStorePlain]: Eliminatee v_prenex_7 vanished before elimination [2019-10-07 03:53:29,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 15 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 03:53:29,717 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 18 variables, input treesize:330, output treesize:7 [2019-10-07 03:53:29,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:53:29,720 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:53:29,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:53:29,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:53:29,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:53:29,748 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:53:29,753 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:53:29,923 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-10-07 03:53:29,923 INFO L567 ElimStorePlain]: treesize reduction 264, result has 39.2 percent of original size [2019-10-07 03:53:29,929 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:53:29,935 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-07 03:53:30,036 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-10-07 03:53:30,038 INFO L567 ElimStorePlain]: treesize reduction 14, result has 90.1 percent of original size [2019-10-07 03:53:30,048 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 03:53:30,052 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-07 03:53:30,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:53:30,119 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:53:30,125 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-07 03:53:30,144 INFO L567 ElimStorePlain]: treesize reduction 42, result has 37.3 percent of original size [2019-10-07 03:53:30,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-10-07 03:53:30,146 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:463, output treesize:25 [2019-10-07 03:53:30,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:53:30,232 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 03:53:30,269 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 03:53:30,270 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 03:53:30,278 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 03:53:30,298 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 03:53:30,299 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 03:53:30,411 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-07 03:53:30,744 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 03:53:30,786 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 03:53:30,902 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 03:53:30,916 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 03:53:30,955 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 03:53:30,963 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 03:53:30,964 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 03:53:30,964 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 115#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 03:53:30,964 INFO L193 IcfgInterpreter]: Reachable states at location L568-1 satisfy 43#(exists ((v_DerPreprocessor_10 Int)) (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= main_~list~0.offset main_~tail~0.offset) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= |#memory_int| (store |old(#memory_int)| main_~list~0.base (store (store (select |old(#memory_int)| main_~list~0.base) (+ main_~list~0.offset 4) v_DerPreprocessor_10) main_~list~0.offset 10))) (= |main_#t~malloc2.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= main_~list~0.offset |main_#t~malloc2.offset|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (= main_~tail~0.base main_~list~0.base))) [2019-10-07 03:53:30,964 INFO L193 IcfgInterpreter]: Reachable states at location L578 satisfy 106#true [2019-10-07 03:53:30,965 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:53:30,965 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:53:30,965 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 120#(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:53:30,965 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 03:53:30,966 INFO L193 IcfgInterpreter]: Reachable states at location L576-4 satisfy 53#(exists ((v_DerPreprocessor_10 Int)) (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= main_~list~0.offset main_~tail~0.offset) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= |#memory_int| (store |old(#memory_int)| main_~list~0.base (store (store (select |old(#memory_int)| main_~list~0.base) (+ main_~list~0.offset 4) v_DerPreprocessor_10) main_~list~0.offset 10))) (= |main_#t~malloc2.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= main_~list~0.offset |main_#t~malloc2.offset|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (= main_~tail~0.base main_~list~0.base))) [2019-10-07 03:53:30,966 INFO L193 IcfgInterpreter]: Reachable states at location L576-3 satisfy 101#(or (exists ((v_prenex_49 Int) (v_prenex_48 Int) (v_main_~p~0.base_26 Int) (v_main_~p~0.offset_26 Int) (v_arrayElimCell_10 Int)) (or (and (not (< v_arrayElimCell_10 20)) (not (< v_arrayElimCell_10 0)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_26) (+ v_main_~p~0.offset_26 4))) (= (select (select |#memory_int| v_main_~p~0.base_26) v_main_~p~0.offset_26) (div v_arrayElimCell_10 2)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| v_main_~p~0.base_26) (+ v_main_~p~0.offset_26 4)))) (and (= main_~p~0.base (select (select |#memory_$Pointer$.base| v_prenex_48) (+ v_prenex_49 4))) (< (select (select |#memory_int| v_prenex_48) v_prenex_49) 21) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| v_prenex_48) (+ v_prenex_49 4)))))) (and (exists ((v_DerPreprocessor_10 Int)) (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= main_~list~0.offset main_~tail~0.offset) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= |#memory_int| (store |old(#memory_int)| main_~list~0.base (store (store (select |old(#memory_int)| main_~list~0.base) (+ main_~list~0.offset 4) v_DerPreprocessor_10) main_~list~0.offset 10))) (= |main_#t~malloc2.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= main_~list~0.offset |main_#t~malloc2.offset|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (= main_~tail~0.base main_~list~0.base))) (= main_~list~0.base main_~p~0.base) (= main_~list~0.offset main_~p~0.offset))) [2019-10-07 03:53:30,966 INFO L193 IcfgInterpreter]: Reachable states at location L577-4 satisfy 96#true [2019-10-07 03:53:30,967 INFO L193 IcfgInterpreter]: Reachable states at location L566-3 satisfy 38#(exists ((v_DerPreprocessor_10 Int)) (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= main_~list~0.offset main_~tail~0.offset) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= |#memory_int| (store |old(#memory_int)| main_~list~0.base (store (store (select |old(#memory_int)| main_~list~0.base) (+ main_~list~0.offset 4) v_DerPreprocessor_10) main_~list~0.offset 10))) (= |main_#t~malloc2.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= main_~list~0.offset |main_#t~malloc2.offset|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (= main_~tail~0.base main_~list~0.base))) [2019-10-07 03:53:30,967 INFO L193 IcfgInterpreter]: Reachable states at location L577-2 satisfy 91#true [2019-10-07 03:53:30,967 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 111#true [2019-10-07 03:53:30,968 INFO L193 IcfgInterpreter]: Reachable states at location L566-1 satisfy 48#(and (exists ((v_DerPreprocessor_10 Int)) (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= main_~list~0.offset main_~tail~0.offset) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= |#memory_int| (store |old(#memory_int)| main_~list~0.base (store (store (select |old(#memory_int)| main_~list~0.base) (+ main_~list~0.offset 4) v_DerPreprocessor_10) main_~list~0.offset 10))) (= |main_#t~malloc2.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= main_~list~0.offset |main_#t~malloc2.offset|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (= main_~tail~0.base main_~list~0.base))) (<= |main_#t~nondet3| 2147483647) (<= 0 (+ |main_#t~nondet3| 2147483648))) [2019-10-07 03:53:31,381 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 03:53:31,381 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 8] total 15 [2019-10-07 03:53:31,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-07 03:53:31,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-07 03:53:31,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-10-07 03:53:31,384 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 15 states. [2019-10-07 03:53:31,706 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 119 [2019-10-07 03:53:40,562 WARN L191 SmtUtils]: Spent 8.12 s on a formula simplification. DAG size of input: 125 DAG size of output: 69 [2019-10-07 03:53:55,408 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 54 [2019-10-07 03:53:57,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:53:57,498 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2019-10-07 03:53:57,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-07 03:53:57,499 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-10-07 03:53:57,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:53:57,503 INFO L225 Difference]: With dead ends: 51 [2019-10-07 03:53:57,503 INFO L226 Difference]: Without dead ends: 45 [2019-10-07 03:53:57,504 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=131, Invalid=514, Unknown=5, NotChecked=0, Total=650 [2019-10-07 03:53:57,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-07 03:53:57,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 29. [2019-10-07 03:53:57,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-07 03:53:57,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2019-10-07 03:53:57,517 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 15 [2019-10-07 03:53:57,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:53:57,518 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2019-10-07 03:53:57,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-07 03:53:57,518 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2019-10-07 03:53:57,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-07 03:53:57,519 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:53:57,519 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:53:57,719 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:53:57,720 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:53:57,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:53:57,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1174716709, now seen corresponding path program 1 times [2019-10-07 03:53:57,721 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:53:57,721 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:53:57,722 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:53:57,722 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:53:57,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:53:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:53:57,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:53:57,832 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:53:57,833 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:53:57,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:53:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:53:57,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-07 03:53:57,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:53:58,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:53:58,219 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:53:58,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:53:58,460 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 03:53:58,462 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 03:53:58,462 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 03:53:58,462 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 03:53:58,463 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 03:53:58,463 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 03:53:58,510 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-07 03:54:00,290 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 03:54:00,295 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 03:54:00,295 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 03:54:00,296 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 152#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 03:54:00,296 INFO L193 IcfgInterpreter]: Reachable states at location L568-1 satisfy 109#(or (exists ((v_DerPreprocessor_21 Int)) (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= main_~list~0.offset main_~tail~0.offset) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= |main_#t~malloc2.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= (store |old(#memory_int)| main_~list~0.base (store (store (select |old(#memory_int)| main_~list~0.base) (+ main_~list~0.offset 4) v_DerPreprocessor_21) main_~list~0.offset 10)) |#memory_int|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= main_~list~0.offset |main_#t~malloc2.offset|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (= main_~tail~0.base main_~list~0.base))) (exists ((v_main_~tail~0.offset_11 Int) (v_main_~tail~0.base_11 Int)) (and (= main_~x~0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (or (= main_~p~0.base (select (select |#memory_$Pointer$.base| v_main_~tail~0.base_11) (+ v_main_~tail~0.offset_11 4))) (and (= v_main_~tail~0.base_11 main_~p~0.base) (= (+ v_main_~tail~0.offset_11 4) main_~p~0.offset)) (and (= (+ v_main_~tail~0.offset_11 4) (+ main_~p~0.offset 4)) (= v_main_~tail~0.base_11 main_~p~0.base))) (or (not (= v_main_~tail~0.base_11 main_~p~0.base)) (= (select (select |#memory_$Pointer$.offset| v_main_~tail~0.base_11) (+ v_main_~tail~0.offset_11 4)) 0) (not (= (+ v_main_~tail~0.offset_11 4) (+ main_~p~0.offset 4)))) (= main_~p~0.offset main_~tail~0.offset) (= 1 (select |#valid| |main_#t~malloc5.base|)) (or (not (= v_main_~tail~0.base_11 main_~p~0.base)) (not (= (+ v_main_~tail~0.offset_11 4) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| v_main_~tail~0.base_11) (+ v_main_~tail~0.offset_11 4)))) (or (and (= v_main_~tail~0.base_11 main_~p~0.base) (= (+ v_main_~tail~0.offset_11 4) main_~p~0.offset)) (and (= (+ v_main_~tail~0.offset_11 4) (+ main_~p~0.offset 4)) (= v_main_~tail~0.base_11 main_~p~0.base)) (= (select (select |#memory_$Pointer$.offset| v_main_~tail~0.base_11) (+ v_main_~tail~0.offset_11 4)) main_~p~0.offset)) (= 0 |main_#t~malloc5.offset|) (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (not (< 20 main_~x~0)) (= |main_#t~malloc5.base| main_~p~0.base) (= main_~tail~0.base main_~p~0.base) (<= main_~x~0 2147483647) (<= 0 (+ main_~x~0 2147483648)) (= main_~p~0.offset |main_#t~malloc5.offset|) (not (= |main_#t~malloc5.base| 0)) (= (select |#length| |main_#t~malloc5.base|) 8) (not (< main_~x~0 10)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (< |#StackHeapBarrier| |main_#t~malloc5.base|)))) [2019-10-07 03:54:00,296 INFO L193 IcfgInterpreter]: Reachable states at location L578 satisfy 139#true [2019-10-07 03:54:00,296 INFO L193 IcfgInterpreter]: Reachable states at location L568 satisfy 95#(and (<= main_~x~0 2147483647) (<= 0 (+ main_~x~0 2147483648))) [2019-10-07 03:54:00,297 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:54:00,297 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 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 03:54:00,300 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 157#(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:54:00,300 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 03:54:00,301 INFO L193 IcfgInterpreter]: Reachable states at location L576-4 satisfy 114#true [2019-10-07 03:54:00,301 INFO L193 IcfgInterpreter]: Reachable states at location L576-3 satisfy 119#(and (= main_~list~0.base main_~p~0.base) (= main_~list~0.offset main_~p~0.offset)) [2019-10-07 03:54:00,301 INFO L193 IcfgInterpreter]: Reachable states at location L566-3 satisfy 100#(or (exists ((v_DerPreprocessor_21 Int)) (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= main_~list~0.offset main_~tail~0.offset) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= |main_#t~malloc2.base| main_~list~0.base) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= (store |old(#memory_int)| main_~list~0.base (store (store (select |old(#memory_int)| main_~list~0.base) (+ main_~list~0.offset 4) v_DerPreprocessor_21) main_~list~0.offset 10)) |#memory_int|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= main_~list~0.offset |main_#t~malloc2.offset|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| main_~list~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (= main_~tail~0.base main_~list~0.base))) (exists ((v_main_~tail~0.offset_11 Int) (v_main_~tail~0.base_11 Int)) (and (= main_~x~0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (or (= main_~p~0.base (select (select |#memory_$Pointer$.base| v_main_~tail~0.base_11) (+ v_main_~tail~0.offset_11 4))) (and (= v_main_~tail~0.base_11 main_~p~0.base) (= (+ v_main_~tail~0.offset_11 4) main_~p~0.offset)) (and (= (+ v_main_~tail~0.offset_11 4) (+ main_~p~0.offset 4)) (= v_main_~tail~0.base_11 main_~p~0.base))) (or (not (= v_main_~tail~0.base_11 main_~p~0.base)) (= (select (select |#memory_$Pointer$.offset| v_main_~tail~0.base_11) (+ v_main_~tail~0.offset_11 4)) 0) (not (= (+ v_main_~tail~0.offset_11 4) (+ main_~p~0.offset 4)))) (= main_~p~0.offset main_~tail~0.offset) (= 1 (select |#valid| |main_#t~malloc5.base|)) (or (not (= v_main_~tail~0.base_11 main_~p~0.base)) (not (= (+ v_main_~tail~0.offset_11 4) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| v_main_~tail~0.base_11) (+ v_main_~tail~0.offset_11 4)))) (or (and (= v_main_~tail~0.base_11 main_~p~0.base) (= (+ v_main_~tail~0.offset_11 4) main_~p~0.offset)) (and (= (+ v_main_~tail~0.offset_11 4) (+ main_~p~0.offset 4)) (= v_main_~tail~0.base_11 main_~p~0.base)) (= (select (select |#memory_$Pointer$.offset| v_main_~tail~0.base_11) (+ v_main_~tail~0.offset_11 4)) main_~p~0.offset)) (= 0 |main_#t~malloc5.offset|) (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (not (< 20 main_~x~0)) (= |main_#t~malloc5.base| main_~p~0.base) (= main_~tail~0.base main_~p~0.base) (<= main_~x~0 2147483647) (<= 0 (+ main_~x~0 2147483648)) (= main_~p~0.offset |main_#t~malloc5.offset|) (not (= |main_#t~malloc5.base| 0)) (= (select |#length| |main_#t~malloc5.base|) 8) (not (< main_~x~0 10)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (< |#StackHeapBarrier| |main_#t~malloc5.base|)))) [2019-10-07 03:54:00,301 INFO L193 IcfgInterpreter]: Reachable states at location L577-2 satisfy 130#true [2019-10-07 03:54:00,302 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 148#true [2019-10-07 03:54:00,302 INFO L193 IcfgInterpreter]: Reachable states at location L566-1 satisfy 90#(and (<= |main_#t~nondet3| 2147483647) (<= 0 (+ |main_#t~nondet3| 2147483648))) [2019-10-07 03:54:00,724 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 03:54:00,724 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 9] total 20 [2019-10-07 03:54:00,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-07 03:54:00,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-07 03:54:00,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-10-07 03:54:00,726 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 20 states. [2019-10-07 03:54:01,079 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 136 [2019-10-07 03:54:01,307 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 140 [2019-10-07 03:54:01,604 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 137 [2019-10-07 03:54:01,985 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 161 [2019-10-07 03:54:02,177 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 138 [2019-10-07 03:54:02,621 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 165 [2019-10-07 03:54:02,891 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-10-07 03:54:03,184 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-10-07 03:54:03,994 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2019-10-07 03:54:04,182 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-10-07 03:54:04,347 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-10-07 03:54:04,678 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 49 [2019-10-07 03:54:06,907 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-10-07 03:54:11,387 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2019-10-07 03:54:11,682 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2019-10-07 03:54:14,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:54:14,305 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2019-10-07 03:54:14,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-07 03:54:14,306 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 16 [2019-10-07 03:54:14,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:54:14,307 INFO L225 Difference]: With dead ends: 78 [2019-10-07 03:54:14,308 INFO L226 Difference]: Without dead ends: 62 [2019-10-07 03:54:14,309 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=445, Invalid=1716, Unknown=1, NotChecked=0, Total=2162 [2019-10-07 03:54:14,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-07 03:54:14,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 33. [2019-10-07 03:54:14,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-07 03:54:14,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2019-10-07 03:54:14,329 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 16 [2019-10-07 03:54:14,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:54:14,329 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-10-07 03:54:14,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-07 03:54:14,329 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2019-10-07 03:54:14,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-07 03:54:14,331 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:54:14,332 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:54:14,535 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:54:14,536 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:54:14,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:54:14,536 INFO L82 PathProgramCache]: Analyzing trace with hash -587014732, now seen corresponding path program 1 times [2019-10-07 03:54:14,536 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:54:14,537 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:54:14,537 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:54:14,537 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:54:14,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:54:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:54:14,959 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:54:14,959 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:54:14,959 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:54:14,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:54:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:54:15,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-07 03:54:15,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:54:15,809 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 53 [2019-10-07 03:54:16,097 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:54:16,099 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-07 03:54:16,104 INFO L168 Benchmark]: Toolchain (without parser) took 49493.72 ms. Allocated memory was 145.8 MB in the beginning and 309.9 MB in the end (delta: 164.1 MB). Free memory was 102.5 MB in the beginning and 108.3 MB in the end (delta: -5.8 MB). Peak memory consumption was 158.3 MB. Max. memory is 7.1 GB. [2019-10-07 03:54:16,104 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-10-07 03:54:16,105 INFO L168 Benchmark]: CACSL2BoogieTranslator took 665.91 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 102.3 MB in the beginning and 169.4 MB in the end (delta: -67.1 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. [2019-10-07 03:54:16,105 INFO L168 Benchmark]: Boogie Preprocessor took 60.10 ms. Allocated memory is still 203.4 MB. Free memory was 169.4 MB in the beginning and 166.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-10-07 03:54:16,106 INFO L168 Benchmark]: RCFGBuilder took 722.49 ms. Allocated memory is still 203.4 MB. Free memory was 166.7 MB in the beginning and 118.7 MB in the end (delta: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 7.1 GB. [2019-10-07 03:54:16,106 INFO L168 Benchmark]: TraceAbstraction took 48040.86 ms. Allocated memory was 203.4 MB in the beginning and 309.9 MB in the end (delta: 106.4 MB). Free memory was 118.7 MB in the beginning and 108.3 MB in the end (delta: 10.4 MB). Peak memory consumption was 116.9 MB. Max. memory is 7.1 GB. [2019-10-07 03:54:16,108 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 665.91 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 102.3 MB in the beginning and 169.4 MB in the end (delta: -67.1 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.10 ms. Allocated memory is still 203.4 MB. Free memory was 169.4 MB in the beginning and 166.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 722.49 ms. Allocated memory is still 203.4 MB. Free memory was 166.7 MB in the beginning and 118.7 MB in the end (delta: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 48040.86 ms. Allocated memory was 203.4 MB in the beginning and 309.9 MB in the end (delta: 106.4 MB). Free memory was 118.7 MB in the beginning and 108.3 MB in the end (delta: 10.4 MB). Peak memory consumption was 116.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...