java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/forester-heap/dll-token-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 03:48:41,493 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 03:48:41,495 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 03:48:41,513 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 03:48:41,514 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 03:48:41,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 03:48:41,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 03:48:41,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 03:48:41,533 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 03:48:41,536 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 03:48:41,538 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 03:48:41,539 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 03:48:41,539 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 03:48:41,541 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 03:48:41,544 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 03:48:41,546 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 03:48:41,548 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 03:48:41,549 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 03:48:41,550 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 03:48:41,555 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 03:48:41,559 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 03:48:41,562 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 03:48:41,565 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 03:48:41,566 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 03:48:41,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 03:48:41,569 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 03:48:41,569 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 03:48:41,571 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 03:48:41,572 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 03:48:41,573 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 03:48:41,573 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 03:48:41,575 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 03:48:41,576 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 03:48:41,576 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 03:48:41,578 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 03:48:41,578 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 03:48:41,579 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 03:48:41,579 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 03:48:41,579 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 03:48:41,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 03:48:41,581 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 03:48:41,582 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 03:48:41,621 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 03:48:41,621 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 03:48:41,623 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 03:48:41,623 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 03:48:41,623 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 03:48:41,623 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 03:48:41,624 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 03:48:41,624 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 03:48:41,624 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 03:48:41,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 03:48:41,626 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 03:48:41,626 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 03:48:41,627 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 03:48:41,627 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 03:48:41,627 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 03:48:41,627 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 03:48:41,627 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 03:48:41,628 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 03:48:41,628 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 03:48:41,628 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 03:48:41,628 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 03:48:41,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 03:48:41,629 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 03:48:41,629 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 03:48:41,629 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 03:48:41,630 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 03:48:41,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 03:48:41,631 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 03:48:41,631 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 03:48:41,908 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 03:48:41,921 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 03:48:41,925 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 03:48:41,926 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 03:48:41,927 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 03:48:41,927 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-token-1.i [2019-10-07 03:48:41,992 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/befcefa8a/33580b1c1e484a919d1fec1ed13d0c48/FLAG6d5a391fa [2019-10-07 03:48:42,521 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 03:48:42,522 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-token-1.i [2019-10-07 03:48:42,540 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/befcefa8a/33580b1c1e484a919d1fec1ed13d0c48/FLAG6d5a391fa [2019-10-07 03:48:42,767 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/befcefa8a/33580b1c1e484a919d1fec1ed13d0c48 [2019-10-07 03:48:42,777 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 03:48:42,778 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 03:48:42,779 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 03:48:42,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 03:48:42,783 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 03:48:42,784 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:48:42" (1/1) ... [2019-10-07 03:48:42,787 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bda3564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:42, skipping insertion in model container [2019-10-07 03:48:42,787 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:48:42" (1/1) ... [2019-10-07 03:48:42,795 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 03:48:42,837 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 03:48:43,294 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:48:43,304 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 03:48:43,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:48:43,407 INFO L192 MainTranslator]: Completed translation [2019-10-07 03:48:43,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:43 WrapperNode [2019-10-07 03:48:43,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 03:48:43,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 03:48:43,408 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 03:48:43,408 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 03:48:43,422 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:43" (1/1) ... [2019-10-07 03:48:43,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:43" (1/1) ... [2019-10-07 03:48:43,437 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:43" (1/1) ... [2019-10-07 03:48:43,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:43" (1/1) ... [2019-10-07 03:48:43,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:43" (1/1) ... [2019-10-07 03:48:43,460 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:43" (1/1) ... [2019-10-07 03:48:43,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:43" (1/1) ... [2019-10-07 03:48:43,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 03:48:43,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 03:48:43,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 03:48:43,470 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 03:48:43,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 03:48:43,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 03:48:43,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 03:48:43,527 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 03:48:43,527 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-07 03:48:43,527 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-07 03:48:43,527 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-07 03:48:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-07 03:48:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-07 03:48:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-07 03:48:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-07 03:48:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-07 03:48:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-07 03:48:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-07 03:48:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-07 03:48:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-07 03:48:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-07 03:48:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-07 03:48:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-07 03:48:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-07 03:48:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-07 03:48:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-07 03:48:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-07 03:48:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-07 03:48:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-07 03:48:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-07 03:48:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-07 03:48:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-07 03:48:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-07 03:48:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-07 03:48:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-07 03:48:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-07 03:48:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-07 03:48:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-07 03:48:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-07 03:48:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-07 03:48:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-07 03:48:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-07 03:48:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-07 03:48:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-07 03:48:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-07 03:48:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-07 03:48:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-07 03:48:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-07 03:48:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-07 03:48:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-07 03:48:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-07 03:48:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-07 03:48:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-07 03:48:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-07 03:48:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-07 03:48:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-07 03:48:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-07 03:48:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-07 03:48:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 03:48:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-07 03:48:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-07 03:48:43,537 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-07 03:48:43,537 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-07 03:48:43,537 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-07 03:48:43,537 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-07 03:48:43,537 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-07 03:48:43,537 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-07 03:48:43,537 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-07 03:48:43,538 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-07 03:48:43,538 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-07 03:48:43,538 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-07 03:48:43,538 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 03:48:43,538 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-07 03:48:43,538 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-07 03:48:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-07 03:48:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-07 03:48:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-07 03:48:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-07 03:48:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-07 03:48:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-07 03:48:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-07 03:48:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-07 03:48:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-07 03:48:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-07 03:48:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-07 03:48:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-07 03:48:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-07 03:48:43,541 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-07 03:48:43,541 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-07 03:48:43,541 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-07 03:48:43,541 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-07 03:48:43,541 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-07 03:48:43,541 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-07 03:48:43,541 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-07 03:48:43,542 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-07 03:48:43,542 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-07 03:48:43,542 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-07 03:48:43,542 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-07 03:48:43,542 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-07 03:48:43,542 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-07 03:48:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-07 03:48:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-07 03:48:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-07 03:48:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-07 03:48:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-07 03:48:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-07 03:48:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-07 03:48:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-07 03:48:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-07 03:48:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-07 03:48:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-07 03:48:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 03:48:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 03:48:43,545 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 03:48:43,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 03:48:43,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 03:48:43,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 03:48:43,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 03:48:43,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 03:48:43,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 03:48:43,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 03:48:43,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 03:48:44,257 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 03:48:44,257 INFO L284 CfgBuilder]: Removed 15 assume(true) statements. [2019-10-07 03:48:44,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:48:44 BoogieIcfgContainer [2019-10-07 03:48:44,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 03:48:44,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 03:48:44,262 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 03:48:44,265 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 03:48:44,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:48:42" (1/3) ... [2019-10-07 03:48:44,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd5c3b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:48:44, skipping insertion in model container [2019-10-07 03:48:44,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:48:43" (2/3) ... [2019-10-07 03:48:44,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd5c3b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:48:44, skipping insertion in model container [2019-10-07 03:48:44,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:48:44" (3/3) ... [2019-10-07 03:48:44,269 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2019-10-07 03:48:44,279 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 03:48:44,287 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-07 03:48:44,299 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-07 03:48:44,328 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 03:48:44,328 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 03:48:44,328 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 03:48:44,329 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 03:48:44,329 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 03:48:44,329 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 03:48:44,329 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 03:48:44,329 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 03:48:44,348 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-10-07 03:48:44,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-07 03:48:44,355 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:44,356 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:44,359 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:44,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:44,365 INFO L82 PathProgramCache]: Analyzing trace with hash -2068371297, now seen corresponding path program 1 times [2019-10-07 03:48:44,374 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:44,375 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:44,375 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:44,375 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:44,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:44,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:48:44,539 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:44,540 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:44,540 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-07 03:48:44,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-07 03:48:44,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-07 03:48:44,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 03:48:44,566 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-10-07 03:48:44,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:44,600 INFO L93 Difference]: Finished difference Result 89 states and 135 transitions. [2019-10-07 03:48:44,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-07 03:48:44,601 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-10-07 03:48:44,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:44,610 INFO L225 Difference]: With dead ends: 89 [2019-10-07 03:48:44,610 INFO L226 Difference]: Without dead ends: 42 [2019-10-07 03:48:44,614 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 03:48:44,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-07 03:48:44,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-10-07 03:48:44,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-07 03:48:44,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-10-07 03:48:44,656 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 9 [2019-10-07 03:48:44,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:44,656 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-10-07 03:48:44,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-07 03:48:44,657 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-10-07 03:48:44,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-07 03:48:44,658 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:44,658 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:44,658 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:44,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:44,659 INFO L82 PathProgramCache]: Analyzing trace with hash -2069137918, now seen corresponding path program 1 times [2019-10-07 03:48:44,659 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:44,660 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:44,660 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:44,660 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:44,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:44,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:48:44,835 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:44,835 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:44,836 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 03:48:44,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 03:48:44,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 03:48:44,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:48:44,840 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 4 states. [2019-10-07 03:48:44,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:44,962 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-10-07 03:48:44,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 03:48:44,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-10-07 03:48:44,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:44,964 INFO L225 Difference]: With dead ends: 42 [2019-10-07 03:48:44,964 INFO L226 Difference]: Without dead ends: 40 [2019-10-07 03:48:44,965 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:48:44,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-07 03:48:44,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-10-07 03:48:44,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-07 03:48:44,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2019-10-07 03:48:44,971 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 9 [2019-10-07 03:48:44,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:44,972 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2019-10-07 03:48:44,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 03:48:44,972 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2019-10-07 03:48:44,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-07 03:48:44,973 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:44,973 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:44,973 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:44,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:44,974 INFO L82 PathProgramCache]: Analyzing trace with hash 281190468, now seen corresponding path program 1 times [2019-10-07 03:48:44,974 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:44,974 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:44,974 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:44,975 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:44,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:45,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:48:45,044 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:45,044 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:45,044 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 03:48:45,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 03:48:45,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 03:48:45,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:48:45,046 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 4 states. [2019-10-07 03:48:45,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:45,140 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-10-07 03:48:45,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 03:48:45,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-07 03:48:45,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:45,144 INFO L225 Difference]: With dead ends: 66 [2019-10-07 03:48:45,144 INFO L226 Difference]: Without dead ends: 64 [2019-10-07 03:48:45,144 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:48:45,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-07 03:48:45,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 38. [2019-10-07 03:48:45,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-07 03:48:45,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-10-07 03:48:45,151 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 10 [2019-10-07 03:48:45,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:45,152 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-10-07 03:48:45,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 03:48:45,152 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-10-07 03:48:45,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 03:48:45,153 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:45,153 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:45,154 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:45,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:45,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1990658958, now seen corresponding path program 1 times [2019-10-07 03:48:45,154 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:45,154 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:45,155 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:45,155 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:45,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:45,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:48:45,225 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:45,225 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:45,225 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 03:48:45,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:48:45,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:48:45,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:48:45,227 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 5 states. [2019-10-07 03:48:45,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:45,325 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-10-07 03:48:45,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 03:48:45,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-07 03:48:45,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:45,326 INFO L225 Difference]: With dead ends: 38 [2019-10-07 03:48:45,326 INFO L226 Difference]: Without dead ends: 36 [2019-10-07 03:48:45,327 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:48:45,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-07 03:48:45,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-07 03:48:45,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-07 03:48:45,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-10-07 03:48:45,333 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 15 [2019-10-07 03:48:45,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:45,333 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-10-07 03:48:45,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:48:45,333 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-10-07 03:48:45,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 03:48:45,334 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:45,334 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:45,335 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:45,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:45,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1990696694, now seen corresponding path program 1 times [2019-10-07 03:48:45,335 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:45,335 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:45,336 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:45,336 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:45,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:45,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:48:45,509 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:45,510 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:45,510 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 03:48:45,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:48:45,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:48:45,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:48:45,511 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2019-10-07 03:48:45,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:45,667 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2019-10-07 03:48:45,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 03:48:45,668 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-07 03:48:45,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:45,669 INFO L225 Difference]: With dead ends: 71 [2019-10-07 03:48:45,669 INFO L226 Difference]: Without dead ends: 47 [2019-10-07 03:48:45,670 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 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:48:45,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-07 03:48:45,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2019-10-07 03:48:45,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-07 03:48:45,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-10-07 03:48:45,682 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 15 [2019-10-07 03:48:45,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:45,683 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-10-07 03:48:45,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:48:45,683 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-10-07 03:48:45,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-07 03:48:45,685 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:45,685 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:45,687 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:45,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:45,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1969294646, now seen corresponding path program 1 times [2019-10-07 03:48:45,688 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:45,688 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:45,689 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:45,689 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:45,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:46,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:48:46,022 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:46,022 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:48:46,023 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 03:48:46,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 03:48:46,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 03:48:46,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-07 03:48:46,023 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 8 states. [2019-10-07 03:48:46,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:46,223 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2019-10-07 03:48:46,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 03:48:46,224 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-10-07 03:48:46,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:46,225 INFO L225 Difference]: With dead ends: 53 [2019-10-07 03:48:46,225 INFO L226 Difference]: Without dead ends: 51 [2019-10-07 03:48:46,226 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-07 03:48:46,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-07 03:48:46,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-10-07 03:48:46,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-07 03:48:46,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2019-10-07 03:48:46,233 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 19 [2019-10-07 03:48:46,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:46,233 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2019-10-07 03:48:46,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 03:48:46,234 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2019-10-07 03:48:46,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-07 03:48:46,236 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:46,236 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:46,236 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:46,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:46,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1633935391, now seen corresponding path program 1 times [2019-10-07 03:48:46,237 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:46,241 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:46,241 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:46,241 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:46,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:46,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:46,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:48:46,492 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:46,492 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:48:46,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:48:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:46,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-07 03:48:46,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:48:46,726 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-07 03:48:46,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:46,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:46,746 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 13 treesize of output 9 [2019-10-07 03:48:46,746 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:46,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:46,765 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 03:48:46,766 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-10-07 03:48:46,827 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:46,828 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-07 03:48:46,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:46,910 INFO L567 ElimStorePlain]: treesize reduction 14, result has 88.4 percent of original size [2019-10-07 03:48:46,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:48:46,923 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:46,973 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:46,984 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:48:47,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:47,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:48:47,051 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 20 [2019-10-07 03:48:47,052 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:47,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:47,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:48:47,080 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-10-07 03:48:47,081 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:47,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:47,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 03:48:47,103 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:109, output treesize:36 [2019-10-07 03:48:47,182 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:47,182 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-07 03:48:47,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:47,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:47,234 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_23|, |v_#memory_$Pointer$.offset_21|, |v_#memory_int_31|, |v_#memory_int_32|], 10=[|v_#memory_int_34|]} [2019-10-07 03:48:47,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:48:47,239 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:47,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:47,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:48:47,286 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:47,321 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:47,324 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-07 03:48:47,347 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:47,350 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:48:47,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:47,399 INFO L341 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2019-10-07 03:48:47,400 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 48 [2019-10-07 03:48:47,400 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:47,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:47,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-07 03:48:47,422 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:181, output treesize:41 [2019-10-07 03:48:47,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2019-10-07 03:48:47,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:47,484 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:47,485 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 03:48:47,485 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2019-10-07 03:48:47,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:48:47,490 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:48:47,500 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_23|, |v_#memory_$Pointer$.offset_21|, |v_#memory_int_32|], 3=[|v_#memory_int_31|]} [2019-10-07 03:48:47,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:47,569 INFO L567 ElimStorePlain]: treesize reduction 69, result has 58.4 percent of original size [2019-10-07 03:48:47,577 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:47,660 INFO L567 ElimStorePlain]: treesize reduction 11, result has 89.6 percent of original size [2019-10-07 03:48:47,664 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:48:47,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:47,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 03:48:47,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 03:48:47,708 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-07 03:48:47,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:47,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 03:48:47,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-07 03:48:47,736 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:157, output treesize:116 [2019-10-07 03:48:47,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 03:48:47,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 03:48:47,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 03:48:48,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 03:48:48,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 03:48:48,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 03:48:48,335 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|, |v_#memory_int_29|], 10=[|v_#memory_int_30|]} [2019-10-07 03:48:48,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:48,362 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:48,379 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:48,507 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 57 [2019-10-07 03:48:48,508 INFO L567 ElimStorePlain]: treesize reduction 566, result has 15.3 percent of original size [2019-10-07 03:48:48,516 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-07 03:48:48,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:48,538 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:48:48,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:48,572 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-10-07 03:48:48,572 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:875, output treesize:108 [2019-10-07 03:48:48,670 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-07 03:48:48,670 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 03:48:48,670 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 11 [2019-10-07 03:48:48,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 03:48:48,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 03:48:48,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-07 03:48:48,672 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 6 states. [2019-10-07 03:48:56,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:48:56,282 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-10-07 03:48:56,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 03:48:56,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-10-07 03:48:56,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:48:56,283 INFO L225 Difference]: With dead ends: 61 [2019-10-07 03:48:56,283 INFO L226 Difference]: Without dead ends: 59 [2019-10-07 03:48:56,284 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-10-07 03:48:56,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-07 03:48:56,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2019-10-07 03:48:56,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-07 03:48:56,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-10-07 03:48:56,292 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 19 [2019-10-07 03:48:56,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:48:56,292 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-10-07 03:48:56,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 03:48:56,293 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-10-07 03:48:56,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-07 03:48:56,293 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:48:56,294 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:48:56,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:48:56,500 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:48:56,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:48:56,500 INFO L82 PathProgramCache]: Analyzing trace with hash 945197535, now seen corresponding path program 1 times [2019-10-07 03:48:56,501 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:48:56,501 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:56,502 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:56,502 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:48:56,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:48:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:56,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:48:56,662 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:48:56,663 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:48:56,663 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:48:56,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:48:56,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-07 03:48:56,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:48:56,788 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-07 03:48:56,788 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:56,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:56,803 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 13 treesize of output 9 [2019-10-07 03:48:56,804 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:56,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:56,814 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 03:48:56,815 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-10-07 03:48:56,871 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:56,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-07 03:48:56,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:56,984 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-10-07 03:48:56,985 INFO L567 ElimStorePlain]: treesize reduction 14, result has 88.7 percent of original size [2019-10-07 03:48:56,992 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-07 03:48:57,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:57,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:48:57,038 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:57,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:57,080 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-07 03:48:57,109 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:57,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:48:57,135 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:57,136 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 64 [2019-10-07 03:48:57,136 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:57,191 INFO L567 ElimStorePlain]: treesize reduction 18, result has 78.6 percent of original size [2019-10-07 03:48:57,193 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 03:48:57,193 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:112, output treesize:36 [2019-10-07 03:48:57,258 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:57,259 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-07 03:48:57,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:57,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:57,309 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.offset_25|, |v_#memory_int_41|, |v_#memory_int_42|], 10=[|v_#memory_int_44|]} [2019-10-07 03:48:57,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:48:57,315 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:57,347 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:57,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:48:57,352 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:57,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:57,388 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-07 03:48:57,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:57,426 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:48:57,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:57,484 INFO L341 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2019-10-07 03:48:57,484 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 48 [2019-10-07 03:48:57,486 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:57,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:57,524 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-07 03:48:57,525 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:181, output treesize:41 [2019-10-07 03:48:57,558 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2019-10-07 03:48:57,558 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:57,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:57,566 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 03:48:57,566 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2019-10-07 03:48:57,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:48:57,581 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:48:57,587 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.offset_25|, |v_#memory_int_42|], 3=[|v_#memory_int_41|]} [2019-10-07 03:48:57,594 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:57,707 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-10-07 03:48:57,708 INFO L567 ElimStorePlain]: treesize reduction 70, result has 58.3 percent of original size [2019-10-07 03:48:57,714 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:48:57,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:57,770 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:48:57,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:48:58,021 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:48:58,023 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:295) 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) 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:336) 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) ... 21 more [2019-10-07 03:48:58,029 INFO L168 Benchmark]: Toolchain (without parser) took 15250.89 ms. Allocated memory was 136.3 MB in the beginning and 285.2 MB in the end (delta: 148.9 MB). Free memory was 99.4 MB in the beginning and 155.3 MB in the end (delta: -55.9 MB). Peak memory consumption was 93.0 MB. Max. memory is 7.1 GB. [2019-10-07 03:48:58,030 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 136.3 MB. Free memory was 119.6 MB in the beginning and 119.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 03:48:58,031 INFO L168 Benchmark]: CACSL2BoogieTranslator took 628.36 ms. Allocated memory was 136.3 MB in the beginning and 201.3 MB in the end (delta: 65.0 MB). Free memory was 99.2 MB in the beginning and 167.9 MB in the end (delta: -68.7 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2019-10-07 03:48:58,032 INFO L168 Benchmark]: Boogie Preprocessor took 61.47 ms. Allocated memory is still 201.3 MB. Free memory was 167.9 MB in the beginning and 164.7 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-10-07 03:48:58,032 INFO L168 Benchmark]: RCFGBuilder took 789.42 ms. Allocated memory is still 201.3 MB. Free memory was 164.7 MB in the beginning and 117.0 MB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 7.1 GB. [2019-10-07 03:48:58,033 INFO L168 Benchmark]: TraceAbstraction took 13765.94 ms. Allocated memory was 201.3 MB in the beginning and 285.2 MB in the end (delta: 83.9 MB). Free memory was 117.0 MB in the beginning and 155.3 MB in the end (delta: -38.3 MB). Peak memory consumption was 45.6 MB. Max. memory is 7.1 GB. [2019-10-07 03:48:58,037 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.22 ms. Allocated memory is still 136.3 MB. Free memory was 119.6 MB in the beginning and 119.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 628.36 ms. Allocated memory was 136.3 MB in the beginning and 201.3 MB in the end (delta: 65.0 MB). Free memory was 99.2 MB in the beginning and 167.9 MB in the end (delta: -68.7 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.47 ms. Allocated memory is still 201.3 MB. Free memory was 167.9 MB in the beginning and 164.7 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 789.42 ms. Allocated memory is still 201.3 MB. Free memory was 164.7 MB in the beginning and 117.0 MB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13765.94 ms. Allocated memory was 201.3 MB in the beginning and 285.2 MB in the end (delta: 83.9 MB). Free memory was 117.0 MB in the beginning and 155.3 MB in the end (delta: -38.3 MB). Peak memory consumption was 45.6 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:295) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...