/usr/bin/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/list-ext2-properties/list_and_tree_cnstr-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 13:31:08,409 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 13:31:08,414 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 13:31:08,452 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 13:31:08,453 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 13:31:08,461 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 13:31:08,464 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 13:31:08,467 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 13:31:08,470 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 13:31:08,473 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 13:31:08,474 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 13:31:08,475 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 13:31:08,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 13:31:08,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 13:31:08,480 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 13:31:08,482 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 13:31:08,484 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 13:31:08,485 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 13:31:08,486 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 13:31:08,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 13:31:08,498 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 13:31:08,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 13:31:08,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 13:31:08,500 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 13:31:08,512 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 13:31:08,512 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 13:31:08,512 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 13:31:08,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 13:31:08,517 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 13:31:08,520 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 13:31:08,520 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 13:31:08,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 13:31:08,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 13:31:08,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 13:31:08,528 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 13:31:08,528 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 13:31:08,529 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 13:31:08,529 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 13:31:08,529 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 13:31:08,530 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 13:31:08,532 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 13:31:08,533 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-04 13:31:08,576 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 13:31:08,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 13:31:08,579 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-04 13:31:08,579 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-04 13:31:08,579 INFO L138 SettingsManager]: * Use SBE=true [2020-09-04 13:31:08,579 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 13:31:08,580 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 13:31:08,580 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 13:31:08,580 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 13:31:08,580 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 13:31:08,581 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 13:31:08,582 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 13:31:08,582 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 13:31:08,582 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 13:31:08,582 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 13:31:08,583 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 13:31:08,583 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 13:31:08,583 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 13:31:08,583 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-04 13:31:08,583 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 13:31:08,584 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 13:31:08,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 13:31:08,584 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 13:31:08,584 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-04 13:31:08,584 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-04 13:31:08,585 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-04 13:31:08,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-04 13:31:08,585 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 13:31:08,585 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-04 13:31:08,585 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-04 13:31:09,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 13:31:09,064 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 13:31:09,068 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 13:31:09,070 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 13:31:09,071 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 13:31:09,072 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-1.i [2020-09-04 13:31:09,161 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8c6253700/491f6ce438574cd79fc344d95df75c1f/FLAG1fbda5331 [2020-09-04 13:31:09,757 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 13:31:09,758 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-1.i [2020-09-04 13:31:09,774 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8c6253700/491f6ce438574cd79fc344d95df75c1f/FLAG1fbda5331 [2020-09-04 13:31:10,061 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8c6253700/491f6ce438574cd79fc344d95df75c1f [2020-09-04 13:31:10,073 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 13:31:10,074 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 13:31:10,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 13:31:10,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 13:31:10,080 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 13:31:10,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:31:10" (1/1) ... [2020-09-04 13:31:10,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@163a0972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:31:10, skipping insertion in model container [2020-09-04 13:31:10,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:31:10" (1/1) ... [2020-09-04 13:31:10,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 13:31:10,146 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 13:31:10,597 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:31:10,609 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 13:31:10,661 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:31:10,717 INFO L208 MainTranslator]: Completed translation [2020-09-04 13:31:10,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:31:10 WrapperNode [2020-09-04 13:31:10,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 13:31:10,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 13:31:10,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 13:31:10,719 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 13:31:10,736 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:31:10" (1/1) ... [2020-09-04 13:31:10,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:31:10" (1/1) ... [2020-09-04 13:31:10,755 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:31:10" (1/1) ... [2020-09-04 13:31:10,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:31:10" (1/1) ... [2020-09-04 13:31:10,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:31:10" (1/1) ... [2020-09-04 13:31:10,809 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:31:10" (1/1) ... [2020-09-04 13:31:10,819 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:31:10" (1/1) ... [2020-09-04 13:31:10,835 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 13:31:10,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 13:31:10,836 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 13:31:10,836 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 13:31:10,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:31:10" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-04 13:31:10,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 13:31:10,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 13:31:10,909 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-09-04 13:31:10,909 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-09-04 13:31:10,909 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-09-04 13:31:10,909 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 13:31:10,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 13:31:10,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 13:31:10,911 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-09-04 13:31:10,911 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-09-04 13:31:10,911 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-09-04 13:31:10,912 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-09-04 13:31:10,912 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-09-04 13:31:10,913 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-09-04 13:31:10,913 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-09-04 13:31:10,914 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-09-04 13:31:10,914 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-09-04 13:31:10,914 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-09-04 13:31:10,914 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-09-04 13:31:10,915 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-09-04 13:31:10,915 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-09-04 13:31:10,916 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-09-04 13:31:10,916 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-09-04 13:31:10,916 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-09-04 13:31:10,917 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-09-04 13:31:10,918 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-09-04 13:31:10,918 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-09-04 13:31:10,918 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-09-04 13:31:10,919 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-09-04 13:31:10,919 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-09-04 13:31:10,919 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-09-04 13:31:10,919 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-09-04 13:31:10,919 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-09-04 13:31:10,920 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-09-04 13:31:10,920 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-09-04 13:31:10,920 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-09-04 13:31:10,920 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-09-04 13:31:10,920 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-09-04 13:31:10,920 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-09-04 13:31:10,921 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-09-04 13:31:10,921 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-09-04 13:31:10,921 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-09-04 13:31:10,921 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-09-04 13:31:10,922 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-09-04 13:31:10,922 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-09-04 13:31:10,922 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-09-04 13:31:10,922 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-09-04 13:31:10,922 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-09-04 13:31:10,922 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-09-04 13:31:10,922 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-09-04 13:31:10,923 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-09-04 13:31:10,923 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-09-04 13:31:10,923 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-09-04 13:31:10,923 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-09-04 13:31:10,923 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-09-04 13:31:10,923 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-09-04 13:31:10,923 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-09-04 13:31:10,924 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-09-04 13:31:10,924 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-09-04 13:31:10,924 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-09-04 13:31:10,924 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-09-04 13:31:10,924 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-09-04 13:31:10,924 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-09-04 13:31:10,924 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-09-04 13:31:10,925 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-09-04 13:31:10,925 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-09-04 13:31:10,925 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-09-04 13:31:10,926 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-09-04 13:31:10,926 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-09-04 13:31:10,926 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-04 13:31:10,927 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-09-04 13:31:10,927 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-09-04 13:31:10,927 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-09-04 13:31:10,928 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-04 13:31:10,928 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-09-04 13:31:10,928 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-09-04 13:31:10,928 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-09-04 13:31:10,928 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-09-04 13:31:10,928 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-09-04 13:31:10,929 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-09-04 13:31:10,929 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-09-04 13:31:10,930 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-09-04 13:31:10,930 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-09-04 13:31:10,930 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-09-04 13:31:10,930 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-09-04 13:31:10,931 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-09-04 13:31:10,931 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-09-04 13:31:10,932 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-09-04 13:31:10,932 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-09-04 13:31:10,932 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-09-04 13:31:10,933 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-09-04 13:31:10,933 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-09-04 13:31:10,933 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-09-04 13:31:10,933 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-09-04 13:31:10,934 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-09-04 13:31:10,934 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-09-04 13:31:10,934 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-09-04 13:31:10,934 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-09-04 13:31:10,934 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-09-04 13:31:10,934 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-09-04 13:31:10,934 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-09-04 13:31:10,935 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-09-04 13:31:10,935 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-09-04 13:31:10,935 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-09-04 13:31:10,935 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-09-04 13:31:10,935 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-09-04 13:31:10,935 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-09-04 13:31:10,935 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-09-04 13:31:10,936 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-09-04 13:31:10,936 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-09-04 13:31:10,936 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-09-04 13:31:10,936 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-09-04 13:31:10,936 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-09-04 13:31:10,936 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-09-04 13:31:10,936 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 13:31:10,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-09-04 13:31:10,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-09-04 13:31:10,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-09-04 13:31:10,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-04 13:31:10,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-04 13:31:10,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-09-04 13:31:10,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 13:31:10,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 13:31:11,293 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-09-04 13:31:11,620 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 13:31:11,623 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-09-04 13:31:11,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:31:11 BoogieIcfgContainer [2020-09-04 13:31:11,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 13:31:11,634 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 13:31:11,634 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 13:31:11,639 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 13:31:11,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 01:31:10" (1/3) ... [2020-09-04 13:31:11,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22955a22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:31:11, skipping insertion in model container [2020-09-04 13:31:11,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:31:10" (2/3) ... [2020-09-04 13:31:11,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22955a22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:31:11, skipping insertion in model container [2020-09-04 13:31:11,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:31:11" (3/3) ... [2020-09-04 13:31:11,644 INFO L109 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-1.i [2020-09-04 13:31:11,656 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-04 13:31:11,667 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 13:31:11,689 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 13:31:11,715 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 13:31:11,715 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 13:31:11,715 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-04 13:31:11,715 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 13:31:11,716 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 13:31:11,716 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 13:31:11,716 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 13:31:11,716 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 13:31:11,736 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2020-09-04 13:31:11,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-04 13:31:11,744 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:31:11,745 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:31:11,746 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:31:11,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:31:11,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1575706012, now seen corresponding path program 1 times [2020-09-04 13:31:11,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:31:11,763 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538876926] [2020-09-04 13:31:11,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:31:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:11,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:31:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:11,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:31:11,995 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538876926] [2020-09-04 13:31:11,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:31:11,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:31:11,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619913099] [2020-09-04 13:31:12,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:31:12,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:31:12,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:31:12,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:31:12,024 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 3 states. [2020-09-04 13:31:12,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:31:12,207 INFO L93 Difference]: Finished difference Result 108 states and 166 transitions. [2020-09-04 13:31:12,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:31:12,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-09-04 13:31:12,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:31:12,220 INFO L225 Difference]: With dead ends: 108 [2020-09-04 13:31:12,220 INFO L226 Difference]: Without dead ends: 47 [2020-09-04 13:31:12,225 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:31:12,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-09-04 13:31:12,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-09-04 13:31:12,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-09-04 13:31:12,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2020-09-04 13:31:12,275 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 20 [2020-09-04 13:31:12,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:31:12,275 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2020-09-04 13:31:12,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:31:12,276 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2020-09-04 13:31:12,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-04 13:31:12,277 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:31:12,277 INFO L422 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] [2020-09-04 13:31:12,278 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 13:31:12,278 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:31:12,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:31:12,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1627887593, now seen corresponding path program 1 times [2020-09-04 13:31:12,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:31:12,279 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499410119] [2020-09-04 13:31:12,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:31:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:12,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:31:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:12,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:31:12,401 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499410119] [2020-09-04 13:31:12,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:31:12,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 13:31:12,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67756310] [2020-09-04 13:31:12,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 13:31:12,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:31:12,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 13:31:12,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 13:31:12,408 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand 4 states. [2020-09-04 13:31:12,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:31:12,550 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2020-09-04 13:31:12,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 13:31:12,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-09-04 13:31:12,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:31:12,554 INFO L225 Difference]: With dead ends: 75 [2020-09-04 13:31:12,555 INFO L226 Difference]: Without dead ends: 55 [2020-09-04 13:31:12,556 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 13:31:12,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-09-04 13:31:12,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-09-04 13:31:12,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-09-04 13:31:12,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 77 transitions. [2020-09-04 13:31:12,566 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 77 transitions. Word has length 25 [2020-09-04 13:31:12,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:31:12,567 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 77 transitions. [2020-09-04 13:31:12,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 13:31:12,567 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2020-09-04 13:31:12,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-09-04 13:31:12,568 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:31:12,568 INFO L422 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, 1, 1] [2020-09-04 13:31:12,569 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 13:31:12,569 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:31:12,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:31:12,569 INFO L82 PathProgramCache]: Analyzing trace with hash -164754602, now seen corresponding path program 1 times [2020-09-04 13:31:12,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:31:12,570 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864344632] [2020-09-04 13:31:12,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:31:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:12,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:31:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:12,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:31:12,656 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864344632] [2020-09-04 13:31:12,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:31:12,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 13:31:12,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880474510] [2020-09-04 13:31:12,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 13:31:12,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:31:12,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 13:31:12,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 13:31:12,659 INFO L87 Difference]: Start difference. First operand 55 states and 77 transitions. Second operand 4 states. [2020-09-04 13:31:12,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:31:12,798 INFO L93 Difference]: Finished difference Result 93 states and 131 transitions. [2020-09-04 13:31:12,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 13:31:12,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2020-09-04 13:31:12,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:31:12,801 INFO L225 Difference]: With dead ends: 93 [2020-09-04 13:31:12,801 INFO L226 Difference]: Without dead ends: 57 [2020-09-04 13:31:12,803 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 13:31:12,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-09-04 13:31:12,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-09-04 13:31:12,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-09-04 13:31:12,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2020-09-04 13:31:12,817 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 31 [2020-09-04 13:31:12,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:31:12,818 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2020-09-04 13:31:12,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 13:31:12,818 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2020-09-04 13:31:12,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-09-04 13:31:12,819 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:31:12,820 INFO L422 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, 1, 1] [2020-09-04 13:31:12,820 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 13:31:12,820 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:31:12,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:31:12,820 INFO L82 PathProgramCache]: Analyzing trace with hash -982403052, now seen corresponding path program 1 times [2020-09-04 13:31:12,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:31:12,824 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959064981] [2020-09-04 13:31:12,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:31:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:12,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:31:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:12,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:31:12,950 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959064981] [2020-09-04 13:31:12,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:31:12,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:31:12,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721125110] [2020-09-04 13:31:12,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:31:12,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:31:12,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:31:12,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:31:12,952 INFO L87 Difference]: Start difference. First operand 57 states and 79 transitions. Second operand 6 states. [2020-09-04 13:31:13,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:31:13,164 INFO L93 Difference]: Finished difference Result 82 states and 108 transitions. [2020-09-04 13:31:13,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 13:31:13,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-09-04 13:31:13,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:31:13,167 INFO L225 Difference]: With dead ends: 82 [2020-09-04 13:31:13,167 INFO L226 Difference]: Without dead ends: 78 [2020-09-04 13:31:13,168 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-04 13:31:13,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-09-04 13:31:13,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 66. [2020-09-04 13:31:13,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-09-04 13:31:13,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2020-09-04 13:31:13,177 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 31 [2020-09-04 13:31:13,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:31:13,178 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2020-09-04 13:31:13,178 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:31:13,178 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2020-09-04 13:31:13,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-09-04 13:31:13,179 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:31:13,180 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:31:13,180 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 13:31:13,180 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:31:13,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:31:13,181 INFO L82 PathProgramCache]: Analyzing trace with hash 852152367, now seen corresponding path program 1 times [2020-09-04 13:31:13,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:31:13,181 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278927715] [2020-09-04 13:31:13,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:31:13,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:13,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:31:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:13,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:31:13,353 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278927715] [2020-09-04 13:31:13,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:31:13,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:31:13,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844108274] [2020-09-04 13:31:13,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:31:13,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:31:13,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:31:13,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:31:13,356 INFO L87 Difference]: Start difference. First operand 66 states and 91 transitions. Second operand 6 states. [2020-09-04 13:31:13,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:31:13,560 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2020-09-04 13:31:13,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 13:31:13,560 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-09-04 13:31:13,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:31:13,562 INFO L225 Difference]: With dead ends: 84 [2020-09-04 13:31:13,562 INFO L226 Difference]: Without dead ends: 76 [2020-09-04 13:31:13,562 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-04 13:31:13,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-09-04 13:31:13,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2020-09-04 13:31:13,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-09-04 13:31:13,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2020-09-04 13:31:13,577 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 33 [2020-09-04 13:31:13,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:31:13,577 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2020-09-04 13:31:13,577 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:31:13,577 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2020-09-04 13:31:13,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-09-04 13:31:13,580 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:31:13,580 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:31:13,580 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 13:31:13,580 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:31:13,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:31:13,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1876855343, now seen corresponding path program 1 times [2020-09-04 13:31:13,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:31:13,582 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41146001] [2020-09-04 13:31:13,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:31:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:13,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:31:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:13,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:31:13,670 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41146001] [2020-09-04 13:31:13,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:31:13,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:31:13,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200715142] [2020-09-04 13:31:13,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:31:13,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:31:13,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:31:13,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:31:13,672 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. Second operand 6 states. [2020-09-04 13:31:13,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:31:13,880 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2020-09-04 13:31:13,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 13:31:13,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-09-04 13:31:13,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:31:13,882 INFO L225 Difference]: With dead ends: 84 [2020-09-04 13:31:13,883 INFO L226 Difference]: Without dead ends: 73 [2020-09-04 13:31:13,883 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-04 13:31:13,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-09-04 13:31:13,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2020-09-04 13:31:13,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-09-04 13:31:13,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 84 transitions. [2020-09-04 13:31:13,890 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 84 transitions. Word has length 33 [2020-09-04 13:31:13,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:31:13,890 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 84 transitions. [2020-09-04 13:31:13,890 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:31:13,891 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 84 transitions. [2020-09-04 13:31:13,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-09-04 13:31:13,892 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:31:13,892 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:31:13,892 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 13:31:13,892 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:31:13,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:31:13,893 INFO L82 PathProgramCache]: Analyzing trace with hash -778946181, now seen corresponding path program 1 times [2020-09-04 13:31:13,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:31:13,893 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875593692] [2020-09-04 13:31:13,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:31:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:14,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:31:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:14,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:31:14,050 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875593692] [2020-09-04 13:31:14,050 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400115633] [2020-09-04 13:31:14,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-04 13:31:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:14,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 28 conjunts are in the unsatisfiable core [2020-09-04 13:31:14,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:31:14,295 INFO L384 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 [2020-09-04 13:31:14,295 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:14,302 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:14,302 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:14,303 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-09-04 13:31:14,334 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:14,335 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-09-04 13:31:14,336 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:14,344 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:14,349 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-09-04 13:31:14,349 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:14,361 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:14,362 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:14,362 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2020-09-04 13:31:14,391 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-09-04 13:31:14,392 INFO L384 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 1 case distinctions, treesize of input 27 treesize of output 11 [2020-09-04 13:31:14,393 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:14,398 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:14,398 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:14,398 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2020-09-04 13:31:14,418 INFO L384 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 19 treesize of output 18 [2020-09-04 13:31:14,419 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:14,431 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:14,434 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-04 13:31:14,434 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2020-09-04 13:31:14,506 INFO L384 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 0 case distinctions, treesize of input 22 treesize of output 10 [2020-09-04 13:31:14,511 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:14,526 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:14,529 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:14,529 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2020-09-04 13:31:14,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:31:14,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:31:14,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2020-09-04 13:31:14,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597181200] [2020-09-04 13:31:14,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:31:14,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:31:14,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:31:14,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:31:14,536 INFO L87 Difference]: Start difference. First operand 61 states and 84 transitions. Second operand 10 states. [2020-09-04 13:31:14,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:31:14,985 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2020-09-04 13:31:14,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 13:31:14,991 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2020-09-04 13:31:14,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:31:14,992 INFO L225 Difference]: With dead ends: 86 [2020-09-04 13:31:14,992 INFO L226 Difference]: Without dead ends: 80 [2020-09-04 13:31:14,994 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2020-09-04 13:31:14,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-09-04 13:31:15,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2020-09-04 13:31:15,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-09-04 13:31:15,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 92 transitions. [2020-09-04 13:31:15,006 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 92 transitions. Word has length 35 [2020-09-04 13:31:15,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:31:15,006 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 92 transitions. [2020-09-04 13:31:15,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:31:15,007 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 92 transitions. [2020-09-04 13:31:15,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-09-04 13:31:15,008 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:31:15,008 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:31:15,211 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-09-04 13:31:15,212 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:31:15,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:31:15,213 INFO L82 PathProgramCache]: Analyzing trace with hash 84455483, now seen corresponding path program 1 times [2020-09-04 13:31:15,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:31:15,214 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526874020] [2020-09-04 13:31:15,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:31:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:15,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:31:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:15,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:31:15,361 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526874020] [2020-09-04 13:31:15,361 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494081400] [2020-09-04 13:31:15,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-04 13:31:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:15,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 28 conjunts are in the unsatisfiable core [2020-09-04 13:31:15,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:31:15,513 INFO L384 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 [2020-09-04 13:31:15,514 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:15,516 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:15,516 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:15,516 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-09-04 13:31:15,533 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:15,534 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-09-04 13:31:15,535 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:15,544 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:15,548 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-09-04 13:31:15,549 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:15,557 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:15,558 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:15,558 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2020-09-04 13:31:15,575 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-09-04 13:31:15,576 INFO L384 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 1 case distinctions, treesize of input 27 treesize of output 11 [2020-09-04 13:31:15,577 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:15,581 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:15,581 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:15,582 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2020-09-04 13:31:15,594 INFO L384 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 19 treesize of output 18 [2020-09-04 13:31:15,596 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:15,602 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:15,605 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-04 13:31:15,605 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2020-09-04 13:31:15,648 INFO L384 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 0 case distinctions, treesize of input 22 treesize of output 10 [2020-09-04 13:31:15,650 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:15,655 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:15,657 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:15,657 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2020-09-04 13:31:15,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:31:15,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:31:15,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2020-09-04 13:31:15,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996829175] [2020-09-04 13:31:15,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:31:15,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:31:15,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:31:15,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:31:15,663 INFO L87 Difference]: Start difference. First operand 68 states and 92 transitions. Second operand 10 states. [2020-09-04 13:31:16,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:31:16,083 INFO L93 Difference]: Finished difference Result 95 states and 123 transitions. [2020-09-04 13:31:16,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 13:31:16,083 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2020-09-04 13:31:16,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:31:16,085 INFO L225 Difference]: With dead ends: 95 [2020-09-04 13:31:16,086 INFO L226 Difference]: Without dead ends: 91 [2020-09-04 13:31:16,087 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2020-09-04 13:31:16,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-09-04 13:31:16,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2020-09-04 13:31:16,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-09-04 13:31:16,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 106 transitions. [2020-09-04 13:31:16,094 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 106 transitions. Word has length 35 [2020-09-04 13:31:16,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:31:16,095 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 106 transitions. [2020-09-04 13:31:16,095 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:31:16,095 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 106 transitions. [2020-09-04 13:31:16,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-09-04 13:31:16,096 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:31:16,096 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-09-04 13:31:16,307 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:31:16,308 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:31:16,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:31:16,309 INFO L82 PathProgramCache]: Analyzing trace with hash -169587242, now seen corresponding path program 1 times [2020-09-04 13:31:16,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:31:16,309 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536704270] [2020-09-04 13:31:16,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:31:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:16,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:31:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:16,626 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:31:16,626 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536704270] [2020-09-04 13:31:16,627 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273357179] [2020-09-04 13:31:16,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-04 13:31:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:16,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 35 conjunts are in the unsatisfiable core [2020-09-04 13:31:16,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:31:16,769 INFO L384 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 [2020-09-04 13:31:16,769 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:16,771 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:16,772 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:16,772 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-09-04 13:31:16,827 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:16,828 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-09-04 13:31:16,828 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:16,834 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:16,835 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:16,835 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2020-09-04 13:31:16,891 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-09-04 13:31:16,891 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:16,902 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:16,909 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-09-04 13:31:16,910 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:16,919 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:16,923 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:16,923 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2020-09-04 13:31:16,956 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_42|], 2=[|v_#memory_$Pointer$.offset_43|, |v_#memory_$Pointer$.base_45|]} [2020-09-04 13:31:16,975 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2020-09-04 13:31:16,975 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:16,986 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:16,998 INFO L384 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 110 treesize of output 82 [2020-09-04 13:31:16,999 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:17,008 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:17,034 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:17,034 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 105 [2020-09-04 13:31:17,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-09-04 13:31:17,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-04 13:31:17,040 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:17,054 INFO L625 ElimStorePlain]: treesize reduction 48, result has 38.5 percent of original size [2020-09-04 13:31:17,054 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:17,054 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2020-09-04 13:31:17,099 INFO L384 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 39 treesize of output 21 [2020-09-04 13:31:17,100 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:17,109 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:17,111 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 [2020-09-04 13:31:17,112 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:17,120 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:17,127 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:17,127 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2020-09-04 13:31:17,134 INFO L384 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 [2020-09-04 13:31:17,135 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:17,136 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:17,137 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:17,137 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-09-04 13:31:17,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:31:17,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:31:17,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2020-09-04 13:31:17,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489393217] [2020-09-04 13:31:17,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 13:31:17,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:31:17,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 13:31:17,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2020-09-04 13:31:17,141 INFO L87 Difference]: Start difference. First operand 79 states and 106 transitions. Second operand 15 states. [2020-09-04 13:31:17,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:31:17,759 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2020-09-04 13:31:17,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 13:31:17,760 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2020-09-04 13:31:17,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:31:17,761 INFO L225 Difference]: With dead ends: 99 [2020-09-04 13:31:17,761 INFO L226 Difference]: Without dead ends: 95 [2020-09-04 13:31:17,762 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2020-09-04 13:31:17,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-09-04 13:31:17,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2020-09-04 13:31:17,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-09-04 13:31:17,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 111 transitions. [2020-09-04 13:31:17,774 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 111 transitions. Word has length 37 [2020-09-04 13:31:17,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:31:17,774 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 111 transitions. [2020-09-04 13:31:17,774 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 13:31:17,774 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 111 transitions. [2020-09-04 13:31:17,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-09-04 13:31:17,775 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:31:17,776 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-09-04 13:31:17,979 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:31:17,979 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:31:17,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:31:17,980 INFO L82 PathProgramCache]: Analyzing trace with hash 284097905, now seen corresponding path program 1 times [2020-09-04 13:31:17,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:31:17,981 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500254779] [2020-09-04 13:31:17,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:31:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:18,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:31:18,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:18,185 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:31:18,186 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500254779] [2020-09-04 13:31:18,188 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420452622] [2020-09-04 13:31:18,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-04 13:31:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:18,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 34 conjunts are in the unsatisfiable core [2020-09-04 13:31:18,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:31:18,331 INFO L384 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 [2020-09-04 13:31:18,331 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:18,334 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:18,334 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:18,335 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-09-04 13:31:18,394 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:18,395 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-09-04 13:31:18,396 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:18,402 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:18,402 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:18,403 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2020-09-04 13:31:18,438 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-09-04 13:31:18,438 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:18,451 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:18,457 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-09-04 13:31:18,458 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:18,471 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:18,473 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:18,473 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2020-09-04 13:31:18,509 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_43|], 2=[|v_#memory_$Pointer$.offset_45|, |v_#memory_$Pointer$.base_47|]} [2020-09-04 13:31:18,513 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2020-09-04 13:31:18,513 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:18,530 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:18,534 INFO L384 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 110 treesize of output 82 [2020-09-04 13:31:18,535 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:18,546 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:18,570 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:18,570 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 105 [2020-09-04 13:31:18,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-09-04 13:31:18,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-04 13:31:18,574 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:18,592 INFO L625 ElimStorePlain]: treesize reduction 48, result has 38.5 percent of original size [2020-09-04 13:31:18,592 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:18,593 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2020-09-04 13:31:18,634 INFO L384 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 39 treesize of output 21 [2020-09-04 13:31:18,634 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:18,642 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:18,647 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 [2020-09-04 13:31:18,648 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:18,652 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:18,653 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:18,653 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2020-09-04 13:31:18,658 INFO L384 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 [2020-09-04 13:31:18,658 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:18,666 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:18,666 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:18,667 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-09-04 13:31:18,689 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:31:18,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:31:18,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2020-09-04 13:31:18,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058831472] [2020-09-04 13:31:18,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 13:31:18,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:31:18,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 13:31:18,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-09-04 13:31:18,691 INFO L87 Difference]: Start difference. First operand 83 states and 111 transitions. Second operand 16 states. [2020-09-04 13:31:19,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:31:19,274 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2020-09-04 13:31:19,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 13:31:19,274 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2020-09-04 13:31:19,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:31:19,276 INFO L225 Difference]: With dead ends: 101 [2020-09-04 13:31:19,276 INFO L226 Difference]: Without dead ends: 91 [2020-09-04 13:31:19,284 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2020-09-04 13:31:19,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-09-04 13:31:19,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 74. [2020-09-04 13:31:19,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-09-04 13:31:19,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 99 transitions. [2020-09-04 13:31:19,292 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 99 transitions. Word has length 39 [2020-09-04 13:31:19,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:31:19,296 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 99 transitions. [2020-09-04 13:31:19,296 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 13:31:19,296 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 99 transitions. [2020-09-04 13:31:19,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-09-04 13:31:19,298 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:31:19,298 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-09-04 13:31:19,513 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:31:19,514 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:31:19,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:31:19,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1308800881, now seen corresponding path program 2 times [2020-09-04 13:31:19,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:31:19,516 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016039177] [2020-09-04 13:31:19,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:31:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:19,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:31:19,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:19,726 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:31:19,727 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016039177] [2020-09-04 13:31:19,727 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921829887] [2020-09-04 13:31:19,727 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-04 13:31:19,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-04 13:31:19,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-04 13:31:19,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 36 conjunts are in the unsatisfiable core [2020-09-04 13:31:19,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:31:19,887 INFO L384 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 [2020-09-04 13:31:19,887 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:19,891 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:19,891 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:19,892 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-09-04 13:31:19,913 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:19,914 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-09-04 13:31:19,915 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:19,929 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:19,929 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:19,930 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2020-09-04 13:31:19,939 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-09-04 13:31:19,939 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:19,952 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:19,958 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-09-04 13:31:19,958 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:19,978 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:19,981 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:19,981 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2020-09-04 13:31:19,995 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_44|], 2=[|v_#memory_$Pointer$.base_49|, |v_#memory_$Pointer$.offset_47|]} [2020-09-04 13:31:19,999 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2020-09-04 13:31:20,000 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:20,015 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:20,039 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:20,040 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 108 [2020-09-04 13:31:20,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-09-04 13:31:20,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-09-04 13:31:20,043 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:20,066 INFO L625 ElimStorePlain]: treesize reduction 36, result has 63.3 percent of original size [2020-09-04 13:31:20,070 INFO L384 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 51 treesize of output 41 [2020-09-04 13:31:20,071 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:20,082 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:20,083 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:20,083 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2020-09-04 13:31:20,111 INFO L384 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 31 treesize of output 19 [2020-09-04 13:31:20,112 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:20,120 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:20,123 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 11 [2020-09-04 13:31:20,123 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:20,133 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:20,135 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:20,135 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2020-09-04 13:31:20,139 INFO L384 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 [2020-09-04 13:31:20,139 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:20,143 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:20,144 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:20,144 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-09-04 13:31:20,166 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:31:20,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:31:20,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2020-09-04 13:31:20,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982303378] [2020-09-04 13:31:20,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 13:31:20,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:31:20,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 13:31:20,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-04 13:31:20,168 INFO L87 Difference]: Start difference. First operand 74 states and 99 transitions. Second operand 12 states. [2020-09-04 13:31:20,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:31:20,561 INFO L93 Difference]: Finished difference Result 94 states and 121 transitions. [2020-09-04 13:31:20,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 13:31:20,562 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2020-09-04 13:31:20,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:31:20,563 INFO L225 Difference]: With dead ends: 94 [2020-09-04 13:31:20,563 INFO L226 Difference]: Without dead ends: 81 [2020-09-04 13:31:20,564 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2020-09-04 13:31:20,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-09-04 13:31:20,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2020-09-04 13:31:20,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-09-04 13:31:20,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 93 transitions. [2020-09-04 13:31:20,569 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 93 transitions. Word has length 39 [2020-09-04 13:31:20,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:31:20,570 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 93 transitions. [2020-09-04 13:31:20,570 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 13:31:20,570 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 93 transitions. [2020-09-04 13:31:20,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-09-04 13:31:20,577 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:31:20,581 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-09-04 13:31:20,781 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-09-04 13:31:20,782 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:31:20,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:31:20,783 INFO L82 PathProgramCache]: Analyzing trace with hash -315248798, now seen corresponding path program 2 times [2020-09-04 13:31:20,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:31:20,783 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43518270] [2020-09-04 13:31:20,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:31:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:20,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:31:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:20,997 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:31:20,998 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43518270] [2020-09-04 13:31:20,998 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526891945] [2020-09-04 13:31:20,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-04 13:31:21,149 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-04 13:31:21,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-04 13:31:21,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 40 conjunts are in the unsatisfiable core [2020-09-04 13:31:21,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:31:21,162 INFO L384 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 [2020-09-04 13:31:21,162 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:21,168 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:21,168 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:21,169 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-09-04 13:31:21,197 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:21,197 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-09-04 13:31:21,199 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:21,237 INFO L625 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2020-09-04 13:31:21,243 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-09-04 13:31:21,243 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:21,258 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:21,258 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:21,258 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2020-09-04 13:31:21,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:31:21,293 INFO L384 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 27 treesize of output 11 [2020-09-04 13:31:21,294 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:21,304 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:21,304 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:21,304 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2020-09-04 13:31:21,353 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:21,354 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-09-04 13:31:21,354 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:21,372 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:21,376 INFO L384 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 19 treesize of output 18 [2020-09-04 13:31:21,377 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:21,386 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:21,387 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:21,387 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2020-09-04 13:31:21,435 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-09-04 13:31:21,435 INFO L384 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 1 case distinctions, treesize of input 34 treesize of output 21 [2020-09-04 13:31:21,436 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:21,446 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:21,448 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-04 13:31:21,449 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2020-09-04 13:31:21,522 INFO L384 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 26 treesize of output 28 [2020-09-04 13:31:21,522 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:21,535 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:21,540 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-09-04 13:31:21,540 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2020-09-04 13:31:21,611 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-09-04 13:31:21,616 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:21,624 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:21,626 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:21,626 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2020-09-04 13:31:21,648 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:31:21,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:31:21,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2020-09-04 13:31:21,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107790413] [2020-09-04 13:31:21,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 13:31:21,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:31:21,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 13:31:21,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2020-09-04 13:31:21,651 INFO L87 Difference]: Start difference. First operand 69 states and 93 transitions. Second operand 19 states. [2020-09-04 13:31:22,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:31:22,500 INFO L93 Difference]: Finished difference Result 105 states and 135 transitions. [2020-09-04 13:31:22,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 13:31:22,500 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 39 [2020-09-04 13:31:22,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:31:22,501 INFO L225 Difference]: With dead ends: 105 [2020-09-04 13:31:22,501 INFO L226 Difference]: Without dead ends: 97 [2020-09-04 13:31:22,502 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2020-09-04 13:31:22,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-09-04 13:31:22,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2020-09-04 13:31:22,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-09-04 13:31:22,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 114 transitions. [2020-09-04 13:31:22,513 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 114 transitions. Word has length 39 [2020-09-04 13:31:22,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:31:22,513 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 114 transitions. [2020-09-04 13:31:22,514 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 13:31:22,514 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 114 transitions. [2020-09-04 13:31:22,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-09-04 13:31:22,515 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:31:22,517 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-09-04 13:31:22,725 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:31:22,726 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:31:22,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:31:22,727 INFO L82 PathProgramCache]: Analyzing trace with hash -15546846, now seen corresponding path program 1 times [2020-09-04 13:31:22,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:31:22,727 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127900523] [2020-09-04 13:31:22,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:31:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:22,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:31:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:22,965 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:31:22,965 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127900523] [2020-09-04 13:31:22,966 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299821431] [2020-09-04 13:31:22,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:31:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:23,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 38 conjunts are in the unsatisfiable core [2020-09-04 13:31:23,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:31:23,115 INFO L384 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 [2020-09-04 13:31:23,116 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:23,118 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:23,118 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:23,118 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-09-04 13:31:23,169 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:23,170 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-09-04 13:31:23,171 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:23,198 INFO L625 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2020-09-04 13:31:23,202 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-09-04 13:31:23,202 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:23,212 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:23,212 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:23,212 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:28 [2020-09-04 13:31:23,257 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-09-04 13:31:23,257 INFO L384 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 1 case distinctions, treesize of input 27 treesize of output 11 [2020-09-04 13:31:23,258 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:23,266 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:23,267 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:23,267 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:22 [2020-09-04 13:31:23,316 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:23,316 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-09-04 13:31:23,317 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:23,329 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:23,334 INFO L384 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 19 treesize of output 18 [2020-09-04 13:31:23,334 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:23,345 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:23,346 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:23,346 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:27 [2020-09-04 13:31:23,409 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-09-04 13:31:23,410 INFO L384 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 1 case distinctions, treesize of input 34 treesize of output 21 [2020-09-04 13:31:23,410 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:23,419 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:23,420 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-04 13:31:23,420 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:27 [2020-09-04 13:31:23,484 INFO L384 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 26 treesize of output 28 [2020-09-04 13:31:23,485 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:23,496 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:23,502 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-09-04 13:31:23,502 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2020-09-04 13:31:23,583 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-09-04 13:31:23,584 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:23,591 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:23,595 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:23,595 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2020-09-04 13:31:23,618 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:31:23,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:31:23,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2020-09-04 13:31:23,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726418636] [2020-09-04 13:31:23,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-04 13:31:23,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:31:23,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-04 13:31:23,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2020-09-04 13:31:23,621 INFO L87 Difference]: Start difference. First operand 87 states and 114 transitions. Second operand 21 states. [2020-09-04 13:31:24,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:31:24,784 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2020-09-04 13:31:24,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 13:31:24,785 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2020-09-04 13:31:24,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:31:24,786 INFO L225 Difference]: With dead ends: 125 [2020-09-04 13:31:24,786 INFO L226 Difference]: Without dead ends: 119 [2020-09-04 13:31:24,788 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=195, Invalid=995, Unknown=0, NotChecked=0, Total=1190 [2020-09-04 13:31:24,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-09-04 13:31:24,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 95. [2020-09-04 13:31:24,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-09-04 13:31:24,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 124 transitions. [2020-09-04 13:31:24,793 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 124 transitions. Word has length 39 [2020-09-04 13:31:24,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:31:24,794 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 124 transitions. [2020-09-04 13:31:24,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-04 13:31:24,794 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 124 transitions. [2020-09-04 13:31:24,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-09-04 13:31:24,795 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:31:24,795 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-09-04 13:31:25,003 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:31:25,004 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:31:25,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:31:25,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1233000963, now seen corresponding path program 3 times [2020-09-04 13:31:25,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:31:25,005 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210580323] [2020-09-04 13:31:25,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:31:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:25,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:31:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:25,381 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:31:25,381 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210580323] [2020-09-04 13:31:25,381 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089982449] [2020-09-04 13:31:25,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:31:25,525 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-09-04 13:31:25,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-04 13:31:25,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 54 conjunts are in the unsatisfiable core [2020-09-04 13:31:25,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:31:25,540 INFO L384 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 [2020-09-04 13:31:25,541 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:25,544 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:25,544 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:25,545 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-09-04 13:31:25,567 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:25,567 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-09-04 13:31:25,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-04 13:31:25,573 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:25,604 INFO L625 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2020-09-04 13:31:25,604 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:25,605 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2020-09-04 13:31:25,656 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-09-04 13:31:25,657 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:25,671 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:25,677 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-09-04 13:31:25,677 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:25,693 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:25,695 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:25,695 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2020-09-04 13:31:25,758 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:25,758 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2020-09-04 13:31:25,759 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-04 13:31:25,760 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-04 13:31:25,761 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:25,783 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:25,784 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_55|], 2=[|v_#memory_$Pointer$.base_55|, |v_#memory_$Pointer$.offset_49|]} [2020-09-04 13:31:25,788 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-09-04 13:31:25,788 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:25,816 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:25,840 INFO L350 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2020-09-04 13:31:25,840 INFO L384 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 1 case distinctions, treesize of input 39 treesize of output 27 [2020-09-04 13:31:25,841 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:25,876 INFO L625 ElimStorePlain]: treesize reduction 8, result has 87.3 percent of original size [2020-09-04 13:31:25,883 INFO L384 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 23 treesize of output 11 [2020-09-04 13:31:25,883 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:25,901 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:25,901 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:25,902 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:89, output treesize:40 [2020-09-04 13:31:25,963 INFO L384 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 113 [2020-09-04 13:31:25,964 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:25,990 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:25,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:31:25,997 INFO L384 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 55 treesize of output 19 [2020-09-04 13:31:25,998 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:26,040 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:26,062 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:26,063 INFO L384 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 1 case distinctions, treesize of input 108 treesize of output 118 [2020-09-04 13:31:26,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2020-09-04 13:31:26,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-09-04 13:31:26,068 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:26,121 INFO L625 ElimStorePlain]: treesize reduction 26, result has 80.5 percent of original size [2020-09-04 13:31:26,122 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:26,123 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:162, output treesize:118 [2020-09-04 13:31:26,181 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_int_57|], 6=[|v_#memory_$Pointer$.offset_51|, |v_#memory_$Pointer$.base_57|]} [2020-09-04 13:31:26,186 INFO L384 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 69 treesize of output 54 [2020-09-04 13:31:26,186 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:26,206 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:26,249 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:26,250 INFO L384 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 278 treesize of output 257 [2020-09-04 13:31:26,252 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:26,304 INFO L625 ElimStorePlain]: treesize reduction 100, result has 61.8 percent of original size [2020-09-04 13:31:26,333 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:26,334 INFO L384 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 159 treesize of output 145 [2020-09-04 13:31:26,336 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-09-04 13:31:26,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-09-04 13:31:26,337 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:26,375 INFO L625 ElimStorePlain]: treesize reduction 108, result has 49.3 percent of original size [2020-09-04 13:31:26,375 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:26,376 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:307, output treesize:105 [2020-09-04 13:31:26,480 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:26,481 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 68 [2020-09-04 13:31:26,483 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-09-04 13:31:26,484 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-09-04 13:31:26,485 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-04 13:31:26,519 INFO L625 ElimStorePlain]: treesize reduction 22, result has 71.1 percent of original size [2020-09-04 13:31:26,522 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2020-09-04 13:31:26,523 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:26,531 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:26,532 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-04 13:31:26,533 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:123, output treesize:30 [2020-09-04 13:31:26,583 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:26,584 INFO L384 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2020-09-04 13:31:26,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-04 13:31:26,586 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:26,593 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:26,594 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:26,594 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:3 [2020-09-04 13:31:26,603 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:31:26,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:31:26,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2020-09-04 13:31:26,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168182034] [2020-09-04 13:31:26,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-04 13:31:26,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:31:26,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-04 13:31:26,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2020-09-04 13:31:26,606 INFO L87 Difference]: Start difference. First operand 95 states and 124 transitions. Second operand 20 states. [2020-09-04 13:31:27,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:31:27,689 INFO L93 Difference]: Finished difference Result 122 states and 154 transitions. [2020-09-04 13:31:27,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 13:31:27,689 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2020-09-04 13:31:27,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:31:27,691 INFO L225 Difference]: With dead ends: 122 [2020-09-04 13:31:27,691 INFO L226 Difference]: Without dead ends: 116 [2020-09-04 13:31:27,692 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2020-09-04 13:31:27,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-09-04 13:31:27,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2020-09-04 13:31:27,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-09-04 13:31:27,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 130 transitions. [2020-09-04 13:31:27,698 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 130 transitions. Word has length 41 [2020-09-04 13:31:27,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:31:27,698 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 130 transitions. [2020-09-04 13:31:27,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-04 13:31:27,699 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 130 transitions. [2020-09-04 13:31:27,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-09-04 13:31:27,699 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:31:27,700 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-09-04 13:31:27,900 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-09-04 13:31:27,901 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:31:27,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:31:27,901 INFO L82 PathProgramCache]: Analyzing trace with hash -2006936899, now seen corresponding path program 1 times [2020-09-04 13:31:27,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:31:27,902 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013853597] [2020-09-04 13:31:27,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:31:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 13:31:27,926 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 13:31:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 13:31:27,953 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 13:31:28,011 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-09-04 13:31:28,011 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 13:31:28,012 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 13:31:28,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 01:31:28 BoogieIcfgContainer [2020-09-04 13:31:28,094 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 13:31:28,096 INFO L168 Benchmark]: Toolchain (without parser) took 18022.35 ms. Allocated memory was 142.6 MB in the beginning and 392.7 MB in the end (delta: 250.1 MB). Free memory was 104.5 MB in the beginning and 354.5 MB in the end (delta: -250.0 MB). Peak memory consumption was 228.3 MB. Max. memory is 7.1 GB. [2020-09-04 13:31:28,097 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 142.6 MB. Free memory was 124.1 MB in the beginning and 123.9 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 13:31:28,097 INFO L168 Benchmark]: CACSL2BoogieTranslator took 642.44 ms. Allocated memory was 142.6 MB in the beginning and 205.0 MB in the end (delta: 62.4 MB). Free memory was 104.3 MB in the beginning and 170.9 MB in the end (delta: -66.6 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2020-09-04 13:31:28,097 INFO L168 Benchmark]: Boogie Preprocessor took 116.94 ms. Allocated memory is still 205.0 MB. Free memory was 170.9 MB in the beginning and 167.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2020-09-04 13:31:28,098 INFO L168 Benchmark]: RCFGBuilder took 794.86 ms. Allocated memory is still 205.0 MB. Free memory was 167.8 MB in the beginning and 110.9 MB in the end (delta: 56.9 MB). Peak memory consumption was 56.9 MB. Max. memory is 7.1 GB. [2020-09-04 13:31:28,098 INFO L168 Benchmark]: TraceAbstraction took 16459.93 ms. Allocated memory was 205.0 MB in the beginning and 392.7 MB in the end (delta: 187.7 MB). Free memory was 110.3 MB in the beginning and 354.5 MB in the end (delta: -244.2 MB). Peak memory consumption was 171.7 MB. Max. memory is 7.1 GB. [2020-09-04 13:31:28,100 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49 ms. Allocated memory is still 142.6 MB. Free memory was 124.1 MB in the beginning and 123.9 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 642.44 ms. Allocated memory was 142.6 MB in the beginning and 205.0 MB in the end (delta: 62.4 MB). Free memory was 104.3 MB in the beginning and 170.9 MB in the end (delta: -66.6 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 116.94 ms. Allocated memory is still 205.0 MB. Free memory was 170.9 MB in the beginning and 167.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 794.86 ms. Allocated memory is still 205.0 MB. Free memory was 167.8 MB in the beginning and 110.9 MB in the end (delta: 56.9 MB). Peak memory consumption was 56.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16459.93 ms. Allocated memory was 205.0 MB in the beginning and 392.7 MB in the end (delta: 187.7 MB). Free memory was 110.3 MB in the beginning and 354.5 MB in the end (delta: -244.2 MB). Peak memory consumption was 171.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 609]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L541] struct TreeNode* root = malloc(sizeof(*root)), *n; [L542] root->left = ((void *)0) [L543] root->right = ((void *)0) VAL [malloc(sizeof(*root))={-1:0}, root={-1:0}] [L544] COND FALSE !(__VERIFIER_nondet_int()) [L563] n = ((void *)0) [L564] struct TreeNode* pred; VAL [malloc(sizeof(*root))={-1:0}, n={0:0}, root={-1:0}] [L565] COND TRUE \read(*root) [L566] pred = ((void *)0) [L567] n = root VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, pred={0:0}, root={-1:0}] [L568] EXPR n->left [L568] n->left || n->right [L568] EXPR n->right [L568] n->left || n->right VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, n->left={0:0}, n->left || n->right=0, n->right={0:0}, pred={0:0}, root={-1:0}] [L568] COND FALSE !(n->left || n->right) [L575] COND FALSE !(\read(*pred)) [L581] root = ((void *)0) VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, pred={0:0}, root={0:0}] [L565] COND FALSE !(\read(*root)) VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, pred={0:0}, root={0:0}] [L584] List a = (List) malloc(sizeof(struct node)); VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, pred={0:0}, root={0:0}] [L585] COND FALSE !(a == 0) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, pred={0:0}, root={0:0}] [L586] List t; [L587] List p = a; VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}] [L588] COND TRUE __VERIFIER_nondet_int() [L589] p->h = 1 [L590] t = (List) malloc(sizeof(struct node)) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}, t={-3:0}] [L591] COND FALSE !(t == 0) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}, t={-3:0}] [L592] p->n = t [L593] EXPR p->n [L593] p = p->n [L588] COND FALSE !(__VERIFIER_nondet_int()) [L595] COND TRUE __VERIFIER_nondet_int() [L596] p->h = 2 [L597] t = (List) malloc(sizeof(struct node)) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-3:0}, pred={0:0}, root={0:0}, t={-4:0}] [L598] COND FALSE !(t == 0) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-3:0}, pred={0:0}, root={0:0}, t={-4:0}] [L599] p->n = t [L600] EXPR p->n [L600] p = p->n [L595] COND FALSE !(__VERIFIER_nondet_int()) [L602] p->h = 3 [L603] p = a VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}, t={-4:0}] [L604] EXPR p->h VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-2:0}, p->h=1, pred={0:0}, root={0:0}, t={-4:0}] [L604] COND FALSE !(p->h == 2) [L606] EXPR p->h VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-2:0}, p->h=1, pred={0:0}, root={0:0}, t={-4:0}] [L606] COND TRUE p->h == 1 [L607] EXPR p->n [L607] p = p->n [L606] EXPR p->h VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-3:0}, p->h=2, pred={0:0}, root={0:0}, t={-4:0}] [L606] COND FALSE !(p->h == 1) [L608] EXPR p->h VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-3:0}, p->h=2, pred={0:0}, root={0:0}, t={-4:0}] [L608] COND TRUE p->h != 3 [L609] __VERIFIER_error() VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-3:0}, pred={0:0}, root={0:0}, t={-4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.3s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 803 SDtfs, 629 SDslu, 4292 SDs, 0 SdLazy, 3646 SolverSat, 264 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 498 GetRequests, 300 SyntacticMatches, 6 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 151 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 822 NumberOfCodeBlocks, 822 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 759 ConstructedInterpolants, 15 QuantifiedInterpolants, 208514 SizeOfPredicates, 117 NumberOfNonLiveVariables, 1390 ConjunctsInSsa, 293 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 36/112 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...