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 -i ../../../trunk/examples/svcomp/heap-data/process_queue.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 18:08:52,604 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 18:08:52,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 18:08:52,627 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 18:08:52,628 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 18:08:52,629 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 18:08:52,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 18:08:52,635 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 18:08:52,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 18:08:52,637 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 18:08:52,638 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 18:08:52,639 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 18:08:52,639 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 18:08:52,640 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 18:08:52,641 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 18:08:52,642 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 18:08:52,643 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 18:08:52,644 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 18:08:52,646 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 18:08:52,648 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 18:08:52,649 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 18:08:52,650 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 18:08:52,651 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 18:08:52,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 18:08:52,659 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 18:08:52,659 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 18:08:52,659 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 18:08:52,660 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 18:08:52,660 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 18:08:52,662 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 18:08:52,662 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 18:08:52,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 18:08:52,667 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 18:08:52,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 18:08:52,669 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 18:08:52,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 18:08:52,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 18:08:52,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 18:08:52,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 18:08:52,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 18:08:52,674 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 18:08:52,675 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 18:08:52,691 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 18:08:52,692 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 18:08:52,693 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 18:08:52,693 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 18:08:52,693 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 18:08:52,694 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 18:08:52,694 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 18:08:52,694 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 18:08:52,694 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 18:08:52,695 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 18:08:52,695 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 18:08:52,695 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 18:08:52,695 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 18:08:52,695 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 18:08:52,696 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 18:08:52,696 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 18:08:52,696 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 18:08:52,696 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 18:08:52,696 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 18:08:52,697 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 18:08:52,697 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 18:08:52,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 18:08:52,697 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 18:08:52,698 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 18:08:52,698 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 18:08:52,698 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 18:08:52,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 18:08:52,698 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 18:08:52,699 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 18:08:53,006 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 18:08:53,019 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 18:08:53,023 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 18:08:53,024 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 18:08:53,024 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 18:08:53,025 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/process_queue.i [2019-10-13 18:08:53,086 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6f7b4b06/f2d4caee962b491b95aa768d04229940/FLAGe52731f85 [2019-10-13 18:08:53,616 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 18:08:53,618 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/process_queue.i [2019-10-13 18:08:53,633 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6f7b4b06/f2d4caee962b491b95aa768d04229940/FLAGe52731f85 [2019-10-13 18:08:53,906 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6f7b4b06/f2d4caee962b491b95aa768d04229940 [2019-10-13 18:08:53,915 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 18:08:53,917 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 18:08:53,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 18:08:53,918 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 18:08:53,920 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 18:08:53,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:08:53" (1/1) ... [2019-10-13 18:08:53,923 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e9222f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:53, skipping insertion in model container [2019-10-13 18:08:53,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:08:53" (1/1) ... [2019-10-13 18:08:53,928 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 18:08:53,967 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 18:08:54,417 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 18:08:54,432 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 18:08:54,487 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 18:08:54,549 INFO L192 MainTranslator]: Completed translation [2019-10-13 18:08:54,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:54 WrapperNode [2019-10-13 18:08:54,550 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 18:08:54,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 18:08:54,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 18:08:54,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 18:08:54,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:54" (1/1) ... [2019-10-13 18:08:54,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:54" (1/1) ... [2019-10-13 18:08:54,584 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:54" (1/1) ... [2019-10-13 18:08:54,584 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:54" (1/1) ... [2019-10-13 18:08:54,607 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:54" (1/1) ... [2019-10-13 18:08:54,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:54" (1/1) ... [2019-10-13 18:08:54,619 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:54" (1/1) ... [2019-10-13 18:08:54,626 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 18:08:54,627 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 18:08:54,627 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 18:08:54,627 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 18:08:54,628 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 18:08:54,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 18:08:54,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 18:08:54,684 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-13 18:08:54,684 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-13 18:08:54,684 INFO L138 BoogieDeclarations]: Found implementation of procedure run_process [2019-10-13 18:08:54,684 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2019-10-13 18:08:54,685 INFO L138 BoogieDeclarations]: Found implementation of procedure choose_next [2019-10-13 18:08:54,685 INFO L138 BoogieDeclarations]: Found implementation of procedure check_queue [2019-10-13 18:08:54,685 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 18:08:54,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 18:08:54,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 18:08:54,686 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-13 18:08:54,686 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-13 18:08:54,686 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-13 18:08:54,686 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-13 18:08:54,686 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-13 18:08:54,687 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-13 18:08:54,687 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-13 18:08:54,687 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-13 18:08:54,687 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-13 18:08:54,687 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-13 18:08:54,687 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-13 18:08:54,688 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-13 18:08:54,688 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-13 18:08:54,688 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-13 18:08:54,688 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-13 18:08:54,688 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-13 18:08:54,688 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-13 18:08:54,688 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-13 18:08:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-13 18:08:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-13 18:08:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-13 18:08:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-13 18:08:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-13 18:08:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-13 18:08:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-13 18:08:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-13 18:08:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-13 18:08:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-13 18:08:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-13 18:08:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-13 18:08:54,691 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-13 18:08:54,691 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-13 18:08:54,691 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-13 18:08:54,691 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-13 18:08:54,691 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-13 18:08:54,691 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-13 18:08:54,691 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-13 18:08:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-13 18:08:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-13 18:08:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-13 18:08:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-13 18:08:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-13 18:08:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-13 18:08:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-13 18:08:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-13 18:08:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-13 18:08:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-13 18:08:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-13 18:08:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-13 18:08:54,693 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-13 18:08:54,694 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-13 18:08:54,694 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-13 18:08:54,694 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 18:08:54,694 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 18:08:54,694 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-13 18:08:54,694 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 18:08:54,695 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-13 18:08:54,695 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-13 18:08:54,695 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-13 18:08:54,695 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-13 18:08:54,695 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-13 18:08:54,695 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-13 18:08:54,696 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-13 18:08:54,696 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-13 18:08:54,696 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-13 18:08:54,696 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 18:08:54,696 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-13 18:08:54,696 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-13 18:08:54,696 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-13 18:08:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-13 18:08:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-13 18:08:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-13 18:08:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-13 18:08:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-13 18:08:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-13 18:08:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-13 18:08:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-13 18:08:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-13 18:08:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-13 18:08:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-13 18:08:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-13 18:08:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-13 18:08:54,699 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-13 18:08:54,699 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-13 18:08:54,699 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-13 18:08:54,699 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-13 18:08:54,699 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-13 18:08:54,699 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-13 18:08:54,700 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-13 18:08:54,700 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-13 18:08:54,700 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-13 18:08:54,700 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-13 18:08:54,700 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-13 18:08:54,700 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-13 18:08:54,701 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-13 18:08:54,701 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-13 18:08:54,701 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-13 18:08:54,701 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-13 18:08:54,701 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-13 18:08:54,701 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-13 18:08:54,701 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-13 18:08:54,702 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-13 18:08:54,702 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-13 18:08:54,702 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-13 18:08:54,702 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-13 18:08:54,702 INFO L130 BoogieDeclarations]: Found specification of procedure run_process [2019-10-13 18:08:54,702 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2019-10-13 18:08:54,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 18:08:54,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 18:08:54,703 INFO L130 BoogieDeclarations]: Found specification of procedure choose_next [2019-10-13 18:08:54,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 18:08:54,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 18:08:54,703 INFO L130 BoogieDeclarations]: Found specification of procedure check_queue [2019-10-13 18:08:54,704 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 18:08:54,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 18:08:54,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 18:08:54,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-13 18:08:54,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 18:08:54,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 18:08:54,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 18:08:55,251 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 18:08:55,252 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 18:08:55,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:08:55 BoogieIcfgContainer [2019-10-13 18:08:55,254 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 18:08:55,255 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 18:08:55,255 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 18:08:55,259 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 18:08:55,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:08:53" (1/3) ... [2019-10-13 18:08:55,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1173da62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:08:55, skipping insertion in model container [2019-10-13 18:08:55,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:54" (2/3) ... [2019-10-13 18:08:55,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1173da62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:08:55, skipping insertion in model container [2019-10-13 18:08:55,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:08:55" (3/3) ... [2019-10-13 18:08:55,265 INFO L109 eAbstractionObserver]: Analyzing ICFG process_queue.i [2019-10-13 18:08:55,277 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 18:08:55,286 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 18:08:55,298 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 18:08:55,329 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 18:08:55,330 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 18:08:55,330 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 18:08:55,330 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 18:08:55,331 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 18:08:55,331 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 18:08:55,331 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 18:08:55,331 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 18:08:55,355 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2019-10-13 18:08:55,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 18:08:55,363 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:55,365 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:55,370 INFO L410 AbstractCegarLoop]: === Iteration 1 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:55,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:55,377 INFO L82 PathProgramCache]: Analyzing trace with hash -699499398, now seen corresponding path program 1 times [2019-10-13 18:08:55,387 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:55,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589647239] [2019-10-13 18:08:55,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:55,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:55,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:55,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:55,769 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589647239] [2019-10-13 18:08:55,770 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:08:55,771 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 18:08:55,771 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056943541] [2019-10-13 18:08:55,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 18:08:55,776 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:55,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 18:08:55,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 18:08:55,794 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 7 states. [2019-10-13 18:08:56,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:56,195 INFO L93 Difference]: Finished difference Result 100 states and 134 transitions. [2019-10-13 18:08:56,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 18:08:56,197 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-10-13 18:08:56,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:56,216 INFO L225 Difference]: With dead ends: 100 [2019-10-13 18:08:56,216 INFO L226 Difference]: Without dead ends: 54 [2019-10-13 18:08:56,227 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-10-13 18:08:56,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-13 18:08:56,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-10-13 18:08:56,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-13 18:08:56,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2019-10-13 18:08:56,299 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 17 [2019-10-13 18:08:56,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:56,300 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2019-10-13 18:08:56,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 18:08:56,301 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2019-10-13 18:08:56,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 18:08:56,304 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:56,305 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:56,305 INFO L410 AbstractCegarLoop]: === Iteration 2 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:56,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:56,306 INFO L82 PathProgramCache]: Analyzing trace with hash -436646864, now seen corresponding path program 1 times [2019-10-13 18:08:56,307 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:56,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038082732] [2019-10-13 18:08:56,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:56,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:56,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:56,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:56,726 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038082732] [2019-10-13 18:08:56,727 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:08:56,727 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 18:08:56,727 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820990803] [2019-10-13 18:08:56,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 18:08:56,729 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:56,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 18:08:56,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 18:08:56,730 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 12 states. [2019-10-13 18:08:57,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:57,880 INFO L93 Difference]: Finished difference Result 113 states and 152 transitions. [2019-10-13 18:08:57,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 18:08:57,881 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-10-13 18:08:57,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:57,885 INFO L225 Difference]: With dead ends: 113 [2019-10-13 18:08:57,885 INFO L226 Difference]: Without dead ends: 111 [2019-10-13 18:08:57,887 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2019-10-13 18:08:57,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-13 18:08:57,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 86. [2019-10-13 18:08:57,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-10-13 18:08:57,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 111 transitions. [2019-10-13 18:08:57,913 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 111 transitions. Word has length 20 [2019-10-13 18:08:57,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:57,914 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 111 transitions. [2019-10-13 18:08:57,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 18:08:57,914 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 111 transitions. [2019-10-13 18:08:57,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 18:08:57,919 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:57,919 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:57,919 INFO L410 AbstractCegarLoop]: === Iteration 3 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:57,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:57,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1313067226, now seen corresponding path program 1 times [2019-10-13 18:08:57,921 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:57,921 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172714324] [2019-10-13 18:08:57,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:57,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:57,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:58,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:58,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:58,372 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172714324] [2019-10-13 18:08:58,372 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223436861] [2019-10-13 18:08:58,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:58,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-13 18:08:58,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:08:58,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:58,665 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-10-13 18:08:58,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:58,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:58,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:58,708 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-13 18:08:58,708 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:58,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:58,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:58,746 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-10-13 18:08:58,747 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:58,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:58,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:58,769 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-13 18:08:58,769 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:58,794 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:58,794 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:58,795 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:94, output treesize:26 [2019-10-13 18:09:00,902 WARN L860 $PredicateComparison]: unable to prove that (exists ((append_to_queue_~n.base Int)) (let ((.cse1 (+ |c_append_to_queue_#in~n.offset| 8))) (and (<= |c_append_to_queue_#in~n.base| append_to_queue_~n.base) (= (let ((.cse0 (store |c_old(#memory_$Pointer$.offset)| append_to_queue_~n.base (store (select |c_old(#memory_$Pointer$.offset)| append_to_queue_~n.base) .cse1 (select (select |c_old(#memory_$Pointer$.offset)| |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset|))))) (store .cse0 |c_append_to_queue_#in~q.base| (store (select .cse0 |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset| |c_append_to_queue_#in~n.offset|))) |c_#memory_$Pointer$.offset|) (= (let ((.cse2 (store |c_old(#memory_$Pointer$.base)| append_to_queue_~n.base (store (select |c_old(#memory_$Pointer$.base)| append_to_queue_~n.base) .cse1 (select (select |c_old(#memory_$Pointer$.base)| |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset|))))) (store .cse2 |c_append_to_queue_#in~q.base| (store (select .cse2 |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset| append_to_queue_~n.base))) |c_#memory_$Pointer$.base|)))) is different from true [2019-10-13 18:09:00,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:00,935 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2019-10-13 18:09:00,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:00,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:00,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:00,962 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2019-10-13 18:09:00,963 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:00,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:00,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:00,978 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:42 [2019-10-13 18:09:01,200 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 18:09:01,203 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:01,204 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 38 [2019-10-13 18:09:01,206 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:01,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:01,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:01,234 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:01,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2019-10-13 18:09:01,235 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:01,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:01,241 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:01,241 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:7 [2019-10-13 18:09:01,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:01,246 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:09:01,246 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2019-10-13 18:09:01,246 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675961430] [2019-10-13 18:09:01,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-13 18:09:01,247 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:01,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-13 18:09:01,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=335, Unknown=1, NotChecked=36, Total=420 [2019-10-13 18:09:01,248 INFO L87 Difference]: Start difference. First operand 86 states and 111 transitions. Second operand 21 states. [2019-10-13 18:09:03,685 WARN L191 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-10-13 18:09:04,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:04,981 INFO L93 Difference]: Finished difference Result 222 states and 304 transitions. [2019-10-13 18:09:04,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 18:09:04,984 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 23 [2019-10-13 18:09:04,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:04,987 INFO L225 Difference]: With dead ends: 222 [2019-10-13 18:09:04,987 INFO L226 Difference]: Without dead ends: 154 [2019-10-13 18:09:04,988 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=129, Invalid=744, Unknown=1, NotChecked=56, Total=930 [2019-10-13 18:09:04,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-13 18:09:05,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 146. [2019-10-13 18:09:05,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-10-13 18:09:05,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 199 transitions. [2019-10-13 18:09:05,017 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 199 transitions. Word has length 23 [2019-10-13 18:09:05,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:05,017 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 199 transitions. [2019-10-13 18:09:05,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-13 18:09:05,017 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 199 transitions. [2019-10-13 18:09:05,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 18:09:05,019 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:05,019 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:05,236 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:05,236 INFO L410 AbstractCegarLoop]: === Iteration 4 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:05,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:05,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1566014097, now seen corresponding path program 1 times [2019-10-13 18:09:05,237 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:05,237 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896038832] [2019-10-13 18:09:05,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:05,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:05,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:05,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:05,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896038832] [2019-10-13 18:09:05,313 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:09:05,313 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 18:09:05,313 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858581329] [2019-10-13 18:09:05,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 18:09:05,314 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:05,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 18:09:05,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 18:09:05,315 INFO L87 Difference]: Start difference. First operand 146 states and 199 transitions. Second operand 5 states. [2019-10-13 18:09:05,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:05,515 INFO L93 Difference]: Finished difference Result 266 states and 365 transitions. [2019-10-13 18:09:05,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 18:09:05,516 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-10-13 18:09:05,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:05,518 INFO L225 Difference]: With dead ends: 266 [2019-10-13 18:09:05,518 INFO L226 Difference]: Without dead ends: 156 [2019-10-13 18:09:05,523 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 18:09:05,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-10-13 18:09:05,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2019-10-13 18:09:05,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-10-13 18:09:05,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 205 transitions. [2019-10-13 18:09:05,556 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 205 transitions. Word has length 29 [2019-10-13 18:09:05,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:05,556 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 205 transitions. [2019-10-13 18:09:05,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 18:09:05,556 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 205 transitions. [2019-10-13 18:09:05,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-13 18:09:05,558 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:05,558 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:05,558 INFO L410 AbstractCegarLoop]: === Iteration 5 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:05,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:05,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1445249493, now seen corresponding path program 1 times [2019-10-13 18:09:05,559 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:05,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921376505] [2019-10-13 18:09:05,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:05,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:05,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:05,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:05,717 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 18:09:05,718 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921376505] [2019-10-13 18:09:05,718 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372443993] [2019-10-13 18:09:05,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:05,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-13 18:09:05,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:09:05,899 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:05,900 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 47 [2019-10-13 18:09:05,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:05,905 INFO L567 ElimStorePlain]: treesize reduction 21, result has 25.0 percent of original size [2019-10-13 18:09:05,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:05,906 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:7 [2019-10-13 18:09:05,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-10-13 18:09:05,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:05,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:05,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:05,934 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-10-13 18:09:05,939 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 18:09:05,939 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 18:09:05,939 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 13 [2019-10-13 18:09:05,939 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976412624] [2019-10-13 18:09:05,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 18:09:05,940 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:05,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 18:09:05,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-13 18:09:05,941 INFO L87 Difference]: Start difference. First operand 154 states and 205 transitions. Second operand 9 states. [2019-10-13 18:09:06,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:06,135 INFO L93 Difference]: Finished difference Result 318 states and 439 transitions. [2019-10-13 18:09:06,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 18:09:06,136 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-10-13 18:09:06,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:06,138 INFO L225 Difference]: With dead ends: 318 [2019-10-13 18:09:06,139 INFO L226 Difference]: Without dead ends: 185 [2019-10-13 18:09:06,141 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2019-10-13 18:09:06,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-10-13 18:09:06,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 177. [2019-10-13 18:09:06,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-10-13 18:09:06,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 239 transitions. [2019-10-13 18:09:06,166 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 239 transitions. Word has length 38 [2019-10-13 18:09:06,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:06,167 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 239 transitions. [2019-10-13 18:09:06,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 18:09:06,167 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 239 transitions. [2019-10-13 18:09:06,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-13 18:09:06,169 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:06,169 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:06,373 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:06,374 INFO L410 AbstractCegarLoop]: === Iteration 6 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:06,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:06,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1053709227, now seen corresponding path program 2 times [2019-10-13 18:09:06,375 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:06,375 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173341243] [2019-10-13 18:09:06,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:06,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:06,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:07,261 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 18:09:07,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173341243] [2019-10-13 18:09:07,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594506871] [2019-10-13 18:09:07,262 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:07,420 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 18:09:07,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 18:09:07,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 109 conjunts are in the unsatisfiable core [2019-10-13 18:09:07,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:09:07,487 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 18:09:07,488 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:07,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:07,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:07,497 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-10-13 18:09:07,619 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:07,620 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 47 [2019-10-13 18:09:07,621 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:07,646 INFO L567 ElimStorePlain]: treesize reduction 20, result has 73.3 percent of original size [2019-10-13 18:09:07,669 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:07,669 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 47 [2019-10-13 18:09:07,670 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:07,690 INFO L567 ElimStorePlain]: treesize reduction 20, result has 53.5 percent of original size [2019-10-13 18:09:07,691 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:07,691 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:87, output treesize:23 [2019-10-13 18:09:08,340 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:08,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-10-13 18:09:08,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:08,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:08,435 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_28|, |v_#memory_$Pointer$.base_29|, |v_#memory_$Pointer$.base_31|, |v_#memory_$Pointer$.offset_30|], 4=[|v_#memory_int_24|]} [2019-10-13 18:09:08,441 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:08,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:08,490 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:08,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:08,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:08,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:08,555 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 57 treesize of output 37 [2019-10-13 18:09:08,556 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:08,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:08,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:08,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:08,606 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 31 [2019-10-13 18:09:08,607 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:08,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:08,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:08,653 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 28 treesize of output 31 [2019-10-13 18:09:08,654 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:08,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:08,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:08,678 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:143, output treesize:47 [2019-10-13 18:09:08,791 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:08,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:08,812 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:08,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:113, output treesize:114 [2019-10-13 18:09:10,888 WARN L191 SmtUtils]: Spent 1.96 s on a formula simplification that was a NOOP. DAG size: 42 [2019-10-13 18:09:10,899 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_BEFORE_CALL_2|], 4=[|v_#memory_$Pointer$.offset_BEFORE_CALL_4|, |v_old(#memory_$Pointer$.base)_AFTER_CALL_5|]} [2019-10-13 18:09:10,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:10,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:10,911 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 22 [2019-10-13 18:09:10,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:10,956 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:10,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:10,963 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 43 treesize of output 18 [2019-10-13 18:09:10,964 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:10,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:10,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:10,999 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 31 [2019-10-13 18:09:11,000 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:11,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:11,020 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:11,021 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:145, output treesize:75 [2019-10-13 18:09:11,336 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 18:09:11,338 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:11,339 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 51 [2019-10-13 18:09:11,340 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:11,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:11,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:11,365 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:11,365 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2019-10-13 18:09:11,366 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:11,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:11,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:11,378 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:106, output treesize:11 [2019-10-13 18:09:11,400 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-13 18:09:11,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:11,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:11,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:11,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-13 18:09:11,418 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:11,418 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:09:11,418 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 40 [2019-10-13 18:09:11,418 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460703268] [2019-10-13 18:09:11,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-13 18:09:11,419 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:11,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-13 18:09:11,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1430, Unknown=0, NotChecked=0, Total=1560 [2019-10-13 18:09:11,421 INFO L87 Difference]: Start difference. First operand 177 states and 239 transitions. Second operand 40 states. [2019-10-13 18:09:15,596 WARN L191 SmtUtils]: Spent 3.79 s on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-10-13 18:09:20,649 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 73 [2019-10-13 18:09:21,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:21,140 INFO L93 Difference]: Finished difference Result 314 states and 422 transitions. [2019-10-13 18:09:21,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-13 18:09:21,142 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 41 [2019-10-13 18:09:21,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:21,147 INFO L225 Difference]: With dead ends: 314 [2019-10-13 18:09:21,147 INFO L226 Difference]: Without dead ends: 304 [2019-10-13 18:09:21,151 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1357 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=669, Invalid=4733, Unknown=0, NotChecked=0, Total=5402 [2019-10-13 18:09:21,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-10-13 18:09:21,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 274. [2019-10-13 18:09:21,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-10-13 18:09:21,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 370 transitions. [2019-10-13 18:09:21,202 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 370 transitions. Word has length 41 [2019-10-13 18:09:21,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:21,204 INFO L462 AbstractCegarLoop]: Abstraction has 274 states and 370 transitions. [2019-10-13 18:09:21,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-13 18:09:21,204 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 370 transitions. [2019-10-13 18:09:21,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-13 18:09:21,213 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:21,213 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:21,417 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:21,417 INFO L410 AbstractCegarLoop]: === Iteration 7 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:21,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:21,418 INFO L82 PathProgramCache]: Analyzing trace with hash 868237973, now seen corresponding path program 3 times [2019-10-13 18:09:21,418 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:21,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821816456] [2019-10-13 18:09:21,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:21,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:21,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:22,300 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-10-13 18:09:22,317 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 18:09:22,318 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821816456] [2019-10-13 18:09:22,318 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864980905] [2019-10-13 18:09:22,318 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:22,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 18:09:22,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 18:09:22,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 109 conjunts are in the unsatisfiable core [2019-10-13 18:09:22,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:09:22,693 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 18:09:22,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:22,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:22,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:22,752 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-10-13 18:09:22,753 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:22,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:22,793 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:22,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:22,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:22,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:22,837 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 30 treesize of output 18 [2019-10-13 18:09:22,837 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:22,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:22,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:22,872 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-13 18:09:22,873 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:22,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:22,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:22,895 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:101, output treesize:32 [2019-10-13 18:09:22,959 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-10-13 18:09:22,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:22,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:22,975 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-10-13 18:09:22,976 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:22,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:22,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:22,992 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:15 [2019-10-13 18:09:23,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:23,161 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2019-10-13 18:09:23,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:23,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:23,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:23,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2019-10-13 18:09:23,198 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:23,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:23,224 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:23,224 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:107, output treesize:60 [2019-10-13 18:09:23,638 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:23,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-10-13 18:09:23,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:23,695 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:23,697 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_34|, |v_#memory_$Pointer$.offset_33|], 6=[|v_#memory_$Pointer$.base_37|, |v_#memory_$Pointer$.offset_36|]} [2019-10-13 18:09:23,702 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:23,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:23,747 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:23,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:23,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:23,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:23,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:23,794 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:23,795 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 44 [2019-10-13 18:09:23,795 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:23,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:23,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:23,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:23,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:23,837 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 0 case distinctions, treesize of input 41 treesize of output 32 [2019-10-13 18:09:23,837 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:23,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:23,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:23,864 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:132, output treesize:58 [2019-10-13 18:09:24,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:24,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:24,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 32 [2019-10-13 18:09:24,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:24,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:24,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:24,149 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:24,149 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 60 [2019-10-13 18:09:24,151 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:24,200 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.3 percent of original size [2019-10-13 18:09:24,201 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:24,201 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:125, output treesize:90 [2019-10-13 18:09:24,683 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 18:09:24,767 INFO L341 Elim1Store]: treesize reduction 8, result has 89.2 percent of original size [2019-10-13 18:09:24,767 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 154 treesize of output 143 [2019-10-13 18:09:24,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:24,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:24,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:24,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:24,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:24,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:24,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:24,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:24,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:24,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:24,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:24,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:24,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:24,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:24,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:24,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:24,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:24,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:24,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:24,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:24,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:24,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:24,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:24,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:24,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:24,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:24,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:24,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:24,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:24,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:24,801 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:24,852 INFO L567 ElimStorePlain]: treesize reduction 103, result has 36.0 percent of original size [2019-10-13 18:09:24,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:24,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:24,869 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:24,870 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 39 [2019-10-13 18:09:24,870 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:24,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:24,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:24,882 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:161, output treesize:7 [2019-10-13 18:09:24,895 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 18:09:24,895 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:09:24,895 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2019-10-13 18:09:24,895 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57295610] [2019-10-13 18:09:24,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-13 18:09:24,896 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:24,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-13 18:09:24,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=966, Unknown=0, NotChecked=0, Total=1056 [2019-10-13 18:09:24,897 INFO L87 Difference]: Start difference. First operand 274 states and 370 transitions. Second operand 33 states. [2019-10-13 18:09:28,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:28,613 INFO L93 Difference]: Finished difference Result 607 states and 836 transitions. [2019-10-13 18:09:28,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-13 18:09:28,616 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 44 [2019-10-13 18:09:28,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:28,620 INFO L225 Difference]: With dead ends: 607 [2019-10-13 18:09:28,620 INFO L226 Difference]: Without dead ends: 399 [2019-10-13 18:09:28,622 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=238, Invalid=2114, Unknown=0, NotChecked=0, Total=2352 [2019-10-13 18:09:28,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-10-13 18:09:28,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 388. [2019-10-13 18:09:28,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-13 18:09:28,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 523 transitions. [2019-10-13 18:09:28,663 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 523 transitions. Word has length 44 [2019-10-13 18:09:28,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:28,663 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 523 transitions. [2019-10-13 18:09:28,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-13 18:09:28,664 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 523 transitions. [2019-10-13 18:09:28,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 18:09:28,665 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:28,666 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:28,873 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:28,873 INFO L410 AbstractCegarLoop]: === Iteration 8 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:28,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:28,874 INFO L82 PathProgramCache]: Analyzing trace with hash -775608654, now seen corresponding path program 1 times [2019-10-13 18:09:28,874 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:28,874 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011965697] [2019-10-13 18:09:28,874 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:28,875 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:28,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:29,683 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:29,683 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011965697] [2019-10-13 18:09:29,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655912763] [2019-10-13 18:09:29,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:29,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 85 conjunts are in the unsatisfiable core [2019-10-13 18:09:29,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:09:29,991 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:29,992 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 47 [2019-10-13 18:09:29,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:30,013 INFO L567 ElimStorePlain]: treesize reduction 20, result has 71.4 percent of original size [2019-10-13 18:09:30,038 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:30,039 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 47 [2019-10-13 18:09:30,040 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:30,053 INFO L567 ElimStorePlain]: treesize reduction 20, result has 47.4 percent of original size [2019-10-13 18:09:30,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:30,053 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:15 [2019-10-13 18:09:30,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:30,611 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 128 [2019-10-13 18:09:30,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:30,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:30,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:30,650 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 95 [2019-10-13 18:09:30,651 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:30,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:30,672 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 27 [2019-10-13 18:09:30,674 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:30,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:30,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:30,695 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:174, output treesize:55 [2019-10-13 18:09:30,865 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2019-10-13 18:09:30,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:30,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:30,877 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2019-10-13 18:09:30,878 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:30,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:30,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:30,890 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:11 [2019-10-13 18:09:30,902 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-13 18:09:30,903 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:30,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:30,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:30,904 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-13 18:09:30,917 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:30,917 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:09:30,917 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 37 [2019-10-13 18:09:30,918 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358378000] [2019-10-13 18:09:30,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-13 18:09:30,918 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:30,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-13 18:09:30,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1224, Unknown=0, NotChecked=0, Total=1332 [2019-10-13 18:09:30,920 INFO L87 Difference]: Start difference. First operand 388 states and 523 transitions. Second operand 37 states. [2019-10-13 18:09:33,055 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-10-13 18:09:34,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:34,690 INFO L93 Difference]: Finished difference Result 501 states and 667 transitions. [2019-10-13 18:09:34,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-13 18:09:34,690 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 50 [2019-10-13 18:09:34,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:34,699 INFO L225 Difference]: With dead ends: 501 [2019-10-13 18:09:34,700 INFO L226 Difference]: Without dead ends: 499 [2019-10-13 18:09:34,701 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=425, Invalid=3865, Unknown=0, NotChecked=0, Total=4290 [2019-10-13 18:09:34,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-10-13 18:09:34,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 472. [2019-10-13 18:09:34,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-10-13 18:09:34,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 631 transitions. [2019-10-13 18:09:34,765 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 631 transitions. Word has length 50 [2019-10-13 18:09:34,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:34,765 INFO L462 AbstractCegarLoop]: Abstraction has 472 states and 631 transitions. [2019-10-13 18:09:34,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-13 18:09:34,766 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 631 transitions. [2019-10-13 18:09:34,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-13 18:09:34,767 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:34,767 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:34,979 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:34,980 INFO L410 AbstractCegarLoop]: === Iteration 9 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:34,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:34,981 INFO L82 PathProgramCache]: Analyzing trace with hash -2006943180, now seen corresponding path program 1 times [2019-10-13 18:09:34,981 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:34,981 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687321335] [2019-10-13 18:09:34,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:34,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:34,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:35,289 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 18:09:35,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687321335] [2019-10-13 18:09:35,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233491475] [2019-10-13 18:09:35,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:35,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 78 conjunts are in the unsatisfiable core [2019-10-13 18:09:35,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:09:35,501 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:35,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 47 [2019-10-13 18:09:35,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:35,513 INFO L567 ElimStorePlain]: treesize reduction 21, result has 25.0 percent of original size [2019-10-13 18:09:35,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:35,514 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:7 [2019-10-13 18:09:35,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:35,908 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:35,908 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 61 [2019-10-13 18:09:35,909 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:35,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:35,971 INFO L341 Elim1Store]: treesize reduction 24, result has 45.5 percent of original size [2019-10-13 18:09:35,971 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 51 [2019-10-13 18:09:35,972 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:35,993 INFO L567 ElimStorePlain]: treesize reduction 16, result has 71.4 percent of original size [2019-10-13 18:09:35,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:35,994 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:40 [2019-10-13 18:09:36,161 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:36,161 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-10-13 18:09:36,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:36,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:36,173 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:36,173 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-10-13 18:09:36,174 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:36,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:36,179 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:36,179 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:7 [2019-10-13 18:09:36,190 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:36,191 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:09:36,191 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 31 [2019-10-13 18:09:36,191 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069526823] [2019-10-13 18:09:36,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-13 18:09:36,192 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:36,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-13 18:09:36,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=849, Unknown=0, NotChecked=0, Total=930 [2019-10-13 18:09:36,192 INFO L87 Difference]: Start difference. First operand 472 states and 631 transitions. Second operand 31 states.