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-manipulation/tree-4.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:57:40,342 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:57:40,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:57:40,364 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:57:40,364 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:57:40,366 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:57:40,368 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:57:40,378 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:57:40,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:57:40,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:57:40,384 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:57:40,386 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:57:40,386 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:57:40,387 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:57:40,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:57:40,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:57:40,389 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:57:40,390 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:57:40,392 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:57:40,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:57:40,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:57:40,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:57:40,397 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:57:40,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:57:40,399 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:57:40,400 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:57:40,400 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:57:40,401 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:57:40,401 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:57:40,402 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:57:40,402 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:57:40,404 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:57:40,405 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:57:40,406 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:57:40,408 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:57:40,408 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:57:40,409 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:57:40,411 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:57:40,411 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:57:40,412 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:57:40,413 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:57:40,414 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-13 21:57:40,434 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:57:40,434 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:57:40,436 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:57:40,436 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:57:40,437 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:57:40,437 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:57:40,437 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:57:40,437 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:57:40,437 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:57:40,438 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:57:40,439 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:57:40,439 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:57:40,439 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:57:40,439 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:57:40,440 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:57:40,440 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:57:40,440 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:57:40,440 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:57:40,440 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:57:40,441 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:57:40,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:57:40,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:57:40,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:57:40,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:57:40,442 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:57:40,442 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:57:40,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:57:40,442 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:57:40,443 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-13 21:57:40,720 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:57:40,733 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:57:40,737 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:57:40,738 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:57:40,738 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:57:40,739 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/tree-4.i [2019-10-13 21:57:40,811 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d58bc11d/676db8b52d554cfeaaac81bd2b98329c/FLAGc33b8c0fd [2019-10-13 21:57:41,364 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:57:41,365 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/tree-4.i [2019-10-13 21:57:41,390 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d58bc11d/676db8b52d554cfeaaac81bd2b98329c/FLAGc33b8c0fd [2019-10-13 21:57:41,635 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d58bc11d/676db8b52d554cfeaaac81bd2b98329c [2019-10-13 21:57:41,645 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:57:41,647 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:57:41,648 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:57:41,648 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:57:41,653 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:57:41,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:57:41" (1/1) ... [2019-10-13 21:57:41,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ac0915c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:41, skipping insertion in model container [2019-10-13 21:57:41,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:57:41" (1/1) ... [2019-10-13 21:57:41,665 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:57:41,717 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:57:42,167 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:57:42,177 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:57:42,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:57:42,284 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:57:42,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:42 WrapperNode [2019-10-13 21:57:42,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:57:42,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:57:42,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:57:42,286 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:57:42,300 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:42" (1/1) ... [2019-10-13 21:57:42,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:42" (1/1) ... [2019-10-13 21:57:42,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:42" (1/1) ... [2019-10-13 21:57:42,323 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:42" (1/1) ... [2019-10-13 21:57:42,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:42" (1/1) ... [2019-10-13 21:57:42,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:42" (1/1) ... [2019-10-13 21:57:42,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:42" (1/1) ... [2019-10-13 21:57:42,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:57:42,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:57:42,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:57:42,369 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:57:42,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:42" (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-13 21:57:42,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:57:42,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:57:42,435 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-13 21:57:42,435 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-13 21:57:42,435 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2019-10-13 21:57:42,435 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2019-10-13 21:57:42,435 INFO L138 BoogieDeclarations]: Found implementation of procedure create_tree [2019-10-13 21:57:42,436 INFO L138 BoogieDeclarations]: Found implementation of procedure free_tree [2019-10-13 21:57:42,436 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:57:42,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:57:42,436 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-13 21:57:42,436 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-13 21:57:42,436 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-13 21:57:42,437 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-13 21:57:42,437 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-13 21:57:42,437 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-13 21:57:42,437 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-13 21:57:42,437 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-13 21:57:42,438 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-13 21:57:42,438 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-13 21:57:42,438 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-13 21:57:42,438 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-13 21:57:42,438 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-13 21:57:42,438 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-13 21:57:42,439 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-13 21:57:42,439 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-13 21:57:42,439 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-13 21:57:42,439 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-13 21:57:42,439 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-13 21:57:42,439 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-13 21:57:42,440 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-13 21:57:42,440 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-13 21:57:42,440 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-13 21:57:42,440 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-13 21:57:42,440 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-13 21:57:42,440 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-13 21:57:42,441 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-13 21:57:42,441 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-13 21:57:42,441 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-13 21:57:42,441 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-13 21:57:42,441 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-13 21:57:42,441 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-13 21:57:42,441 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-13 21:57:42,442 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-13 21:57:42,442 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-13 21:57:42,442 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-13 21:57:42,442 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-13 21:57:42,442 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-13 21:57:42,442 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-13 21:57:42,443 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-13 21:57:42,443 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-13 21:57:42,443 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-13 21:57:42,443 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-13 21:57:42,443 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-13 21:57:42,443 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-13 21:57:42,444 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-13 21:57:42,444 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-13 21:57:42,444 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-13 21:57:42,444 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-13 21:57:42,444 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-13 21:57:42,444 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-13 21:57:42,444 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-13 21:57:42,445 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:57:42,445 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 21:57:42,445 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-13 21:57:42,445 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:57:42,445 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-13 21:57:42,445 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-13 21:57:42,446 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-13 21:57:42,446 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-13 21:57:42,446 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-13 21:57:42,446 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-13 21:57:42,446 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-13 21:57:42,446 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:57:42,446 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-13 21:57:42,447 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-13 21:57:42,447 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-13 21:57:42,447 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-13 21:57:42,447 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-13 21:57:42,447 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-13 21:57:42,447 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-13 21:57:42,448 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-13 21:57:42,448 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-13 21:57:42,448 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-13 21:57:42,448 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-13 21:57:42,448 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-13 21:57:42,448 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-13 21:57:42,449 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-13 21:57:42,449 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-13 21:57:42,449 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-13 21:57:42,449 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-13 21:57:42,449 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-13 21:57:42,449 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-13 21:57:42,450 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-13 21:57:42,450 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-13 21:57:42,450 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-13 21:57:42,450 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-13 21:57:42,450 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-13 21:57:42,450 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-13 21:57:42,450 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-13 21:57:42,451 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-13 21:57:42,451 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-13 21:57:42,451 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-13 21:57:42,451 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-13 21:57:42,451 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-13 21:57:42,451 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-13 21:57:42,451 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-13 21:57:42,452 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-13 21:57:42,452 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-13 21:57:42,452 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-13 21:57:42,452 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-13 21:57:42,452 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-13 21:57:42,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:57:42,452 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2019-10-13 21:57:42,452 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2019-10-13 21:57:42,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:57:42,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:57:42,453 INFO L130 BoogieDeclarations]: Found specification of procedure create_tree [2019-10-13 21:57:42,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:57:42,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:57:42,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:57:42,454 INFO L130 BoogieDeclarations]: Found specification of procedure free_tree [2019-10-13 21:57:42,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:57:42,454 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:57:42,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:57:42,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:57:43,402 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:57:43,403 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-10-13 21:57:43,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:57:43 BoogieIcfgContainer [2019-10-13 21:57:43,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:57:43,406 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:57:43,406 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:57:43,409 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:57:43,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:57:41" (1/3) ... [2019-10-13 21:57:43,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@342aad9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:57:43, skipping insertion in model container [2019-10-13 21:57:43,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:42" (2/3) ... [2019-10-13 21:57:43,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@342aad9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:57:43, skipping insertion in model container [2019-10-13 21:57:43,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:57:43" (3/3) ... [2019-10-13 21:57:43,414 INFO L109 eAbstractionObserver]: Analyzing ICFG tree-4.i [2019-10-13 21:57:43,424 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:57:43,433 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:57:43,446 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:57:43,471 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:57:43,471 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:57:43,472 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:57:43,472 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:57:43,472 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:57:43,490 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:57:43,490 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:57:43,491 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:57:43,510 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-10-13 21:57:43,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 21:57:43,515 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:57:43,516 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:57:43,519 INFO L410 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:57:43,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:57:43,525 INFO L82 PathProgramCache]: Analyzing trace with hash 833824495, now seen corresponding path program 1 times [2019-10-13 21:57:43,534 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:57:43,535 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211218467] [2019-10-13 21:57:43,535 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:43,536 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:43,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:57:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:57:43,690 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-13 21:57:43,691 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211218467] [2019-10-13 21:57:43,693 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:57:43,695 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-13 21:57:43,696 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354191138] [2019-10-13 21:57:43,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 21:57:43,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:57:43,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 21:57:43,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 21:57:43,718 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2019-10-13 21:57:43,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:57:43,748 INFO L93 Difference]: Finished difference Result 79 states and 118 transitions. [2019-10-13 21:57:43,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 21:57:43,749 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-10-13 21:57:43,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:57:43,759 INFO L225 Difference]: With dead ends: 79 [2019-10-13 21:57:43,759 INFO L226 Difference]: Without dead ends: 31 [2019-10-13 21:57:43,763 INFO L600 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-13 21:57:43,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-13 21:57:43,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-10-13 21:57:43,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-13 21:57:43,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-10-13 21:57:43,805 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 17 [2019-10-13 21:57:43,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:57:43,805 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-10-13 21:57:43,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 21:57:43,806 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-10-13 21:57:43,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 21:57:43,807 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:57:43,807 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:57:43,807 INFO L410 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:57:43,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:57:43,808 INFO L82 PathProgramCache]: Analyzing trace with hash -174511117, now seen corresponding path program 1 times [2019-10-13 21:57:43,808 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:57:43,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299284158] [2019-10-13 21:57:43,808 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:43,808 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:43,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:57:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:57:43,956 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-13 21:57:43,956 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299284158] [2019-10-13 21:57:43,956 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:57:43,957 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:57:43,957 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856875916] [2019-10-13 21:57:43,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:57:43,959 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:57:43,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:57:43,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:57:43,962 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 6 states. [2019-10-13 21:57:44,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:57:44,137 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2019-10-13 21:57:44,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:57:44,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-10-13 21:57:44,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:57:44,142 INFO L225 Difference]: With dead ends: 56 [2019-10-13 21:57:44,142 INFO L226 Difference]: Without dead ends: 33 [2019-10-13 21:57:44,143 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:57:44,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-13 21:57:44,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-13 21:57:44,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-13 21:57:44,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-10-13 21:57:44,155 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 18 [2019-10-13 21:57:44,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:57:44,155 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-10-13 21:57:44,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:57:44,156 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-10-13 21:57:44,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:57:44,156 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:57:44,157 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:57:44,157 INFO L410 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:57:44,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:57:44,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1037557495, now seen corresponding path program 1 times [2019-10-13 21:57:44,159 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:57:44,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359562708] [2019-10-13 21:57:44,159 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:44,159 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:44,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:57:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:57:44,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:57:44,296 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359562708] [2019-10-13 21:57:44,296 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:57:44,296 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:57:44,296 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294289295] [2019-10-13 21:57:44,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:57:44,297 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:57:44,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:57:44,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:57:44,298 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 3 states. [2019-10-13 21:57:44,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:57:44,347 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2019-10-13 21:57:44,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:57:44,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 21:57:44,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:57:44,349 INFO L225 Difference]: With dead ends: 55 [2019-10-13 21:57:44,349 INFO L226 Difference]: Without dead ends: 34 [2019-10-13 21:57:44,350 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:57:44,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-13 21:57:44,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-10-13 21:57:44,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-13 21:57:44,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-10-13 21:57:44,356 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 20 [2019-10-13 21:57:44,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:57:44,357 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-10-13 21:57:44,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:57:44,357 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-10-13 21:57:44,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:57:44,358 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:57:44,358 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:57:44,358 INFO L410 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:57:44,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:57:44,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1990611584, now seen corresponding path program 1 times [2019-10-13 21:57:44,359 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:57:44,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057760124] [2019-10-13 21:57:44,359 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:44,360 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:44,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:57:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:57:44,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:57:44,497 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057760124] [2019-10-13 21:57:44,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186050725] [2019-10-13 21:57:44,498 INFO L94 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-13 21:57:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:57:44,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-13 21:57:44,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:57:44,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:57:44,669 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:57:44,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:57:44,737 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:57:44,737 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [9] total 9 [2019-10-13 21:57:44,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201931376] [2019-10-13 21:57:44,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:57:44,738 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:57:44,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:57:44,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:57:44,739 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 8 states. [2019-10-13 21:57:44,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:57:44,879 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2019-10-13 21:57:44,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:57:44,880 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-10-13 21:57:44,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:57:44,881 INFO L225 Difference]: With dead ends: 47 [2019-10-13 21:57:44,881 INFO L226 Difference]: Without dead ends: 44 [2019-10-13 21:57:44,882 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:57:44,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-13 21:57:44,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2019-10-13 21:57:44,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-13 21:57:44,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-13 21:57:44,889 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 21 [2019-10-13 21:57:44,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:57:44,889 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-13 21:57:44,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:57:44,890 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-13 21:57:44,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 21:57:44,891 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:57:44,891 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:57:45,095 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:57:45,096 INFO L410 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:57:45,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:57:45,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1856453461, now seen corresponding path program 1 times [2019-10-13 21:57:45,097 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:57:45,097 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089392164] [2019-10-13 21:57:45,097 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:45,097 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:57:45,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:57:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:57:45,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:57:45,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089392164] [2019-10-13 21:57:45,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040152777] [2019-10-13 21:57:45,563 INFO L94 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-13 21:57:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:57:45,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-13 21:57:45,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:57:45,731 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 21:57:45,732 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 21:57:45,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:57:45,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 21:57:45,741 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-13 21:57:45,853 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:57:45,854 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-13 21:57:45,855 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 21:57:46,112 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-10-13 21:57:46,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:57:46,123 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_77|], 6=[|v_#memory_$Pointer$.base_83|, |v_#memory_$Pointer$.offset_83|], 13=[|v_#memory_$Pointer$.base_84|, |v_#memory_$Pointer$.offset_84|]} [2019-10-13 21:57:46,162 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:57:46,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:57:46,172 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 935 treesize of output 301 [2019-10-13 21:57:46,173 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 21:57:46,325 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-10-13 21:57:46,325 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:57:46,334 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-13 21:57:46,478 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-10-13 21:57:46,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:57:46,488 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 21:57:46,602 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-10-13 21:57:46,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:57:46,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:57:46,820 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-10-13 21:57:46,821 INFO L341 Elim1Store]: treesize reduction 939, result has 56.4 percent of original size [2019-10-13 21:57:46,822 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 3 case distinctions, treesize of input 587 treesize of output 1687 [2019-10-13 21:57:46,823 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 21:57:46,985 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-10-13 21:57:46,985 INFO L567 ElimStorePlain]: treesize reduction 1101, result has 34.9 percent of original size [2019-10-13 21:57:46,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:57:47,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 64 [2019-10-13 21:57:47,000 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-13 21:57:47,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:57:47,040 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 21:57:47,040 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:3062, output treesize:93 [2019-10-13 21:57:47,392 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_int|], 6=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|]} [2019-10-13 21:57:47,404 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:57:47,405 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 7 [2019-10-13 21:57:47,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 21:57:47,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:57:47,451 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:57:47,452 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 74 [2019-10-13 21:57:47,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:47,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:47,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:47,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:47,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:47,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:47,463 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 21:57:47,499 INFO L567 ElimStorePlain]: treesize reduction 36, result has 50.0 percent of original size [2019-10-13 21:57:47,503 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-10-13 21:57:47,504 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 21:57:47,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:57:47,508 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 21:57:47,508 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:110, output treesize:3 [2019-10-13 21:57:47,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:57:47,515 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:57:48,292 WARN L191 SmtUtils]: Spent 674.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-10-13 21:57:48,657 WARN L191 SmtUtils]: Spent 362.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-10-13 21:57:49,095 WARN L191 SmtUtils]: Spent 435.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-10-13 21:57:49,603 WARN L191 SmtUtils]: Spent 507.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-10-13 21:57:49,693 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_77|], 2=[|v_#memory_int_87|], 7=[|v_#memory_$Pointer$.base_83|, |v_#memory_$Pointer$.offset_83|], 13=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|]} [2019-10-13 21:57:49,829 INFO L341 Elim1Store]: treesize reduction 628, result has 49.5 percent of original size [2019-10-13 21:57:49,830 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 1 case distinctions, treesize of input 936 treesize of output 616 [2019-10-13 21:57:49,831 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-13 21:57:49,951 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-10-13 21:57:49,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:57:50,010 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:57:50,010 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 678 treesize of output 685 [2019-10-13 21:57:50,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:50,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:50,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:57:50,014 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-10-13 21:57:50,206 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-10-13 21:57:50,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:57:50,408 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:57:50,409 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) 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) Caused by: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) 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.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.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:335) 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-10-13 21:57:50,418 INFO L168 Benchmark]: Toolchain (without parser) took 8769.09 ms. Allocated memory was 136.8 MB in the beginning and 251.7 MB in the end (delta: 114.8 MB). Free memory was 100.8 MB in the beginning and 85.2 MB in the end (delta: 15.6 MB). Peak memory consumption was 130.4 MB. Max. memory is 7.1 GB. [2019-10-13 21:57:50,419 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 136.8 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 21:57:50,423 INFO L168 Benchmark]: CACSL2BoogieTranslator took 637.32 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 100.6 MB in the beginning and 167.1 MB in the end (delta: -66.5 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-10-13 21:57:50,424 INFO L168 Benchmark]: Boogie Preprocessor took 82.39 ms. Allocated memory is still 201.3 MB. Free memory was 167.1 MB in the beginning and 163.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-10-13 21:57:50,430 INFO L168 Benchmark]: RCFGBuilder took 1036.22 ms. Allocated memory is still 201.3 MB. Free memory was 163.7 MB in the beginning and 89.9 MB in the end (delta: 73.8 MB). Peak memory consumption was 73.8 MB. Max. memory is 7.1 GB. [2019-10-13 21:57:50,434 INFO L168 Benchmark]: TraceAbstraction took 7008.18 ms. Allocated memory was 201.3 MB in the beginning and 251.7 MB in the end (delta: 50.3 MB). Free memory was 89.2 MB in the beginning and 85.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 54.3 MB. Max. memory is 7.1 GB. [2019-10-13 21:57:50,441 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.21 ms. Allocated memory is still 136.8 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 637.32 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 100.6 MB in the beginning and 167.1 MB in the end (delta: -66.5 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 82.39 ms. Allocated memory is still 201.3 MB. Free memory was 167.1 MB in the beginning and 163.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1036.22 ms. Allocated memory is still 201.3 MB. Free memory was 163.7 MB in the beginning and 89.9 MB in the end (delta: 73.8 MB). Peak memory consumption was 73.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7008.18 ms. Allocated memory was 201.3 MB in the beginning and 251.7 MB in the end (delta: 50.3 MB). Free memory was 89.2 MB in the beginning and 85.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 54.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...