/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-properties/splice-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 21:15:49,025 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:15:49,028 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:15:49,045 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:15:49,045 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:15:49,046 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:15:49,048 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:15:49,050 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:15:49,051 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:15:49,052 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:15:49,053 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:15:49,054 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:15:49,055 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:15:49,056 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:15:49,056 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:15:49,058 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:15:49,058 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:15:49,059 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:15:49,061 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:15:49,063 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:15:49,064 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:15:49,066 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:15:49,067 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:15:49,067 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:15:49,070 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:15:49,070 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:15:49,070 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:15:49,073 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:15:49,073 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:15:49,074 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:15:49,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:15:49,075 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:15:49,078 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:15:49,078 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:15:49,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:15:49,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:15:49,080 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:15:49,081 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:15:49,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:15:49,082 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:15:49,082 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:15:49,083 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 21:15:49,105 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:15:49,106 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:15:49,108 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:15:49,108 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:15:49,108 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:15:49,109 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:15:49,109 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:15:49,109 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:15:49,109 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:15:49,109 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:15:49,110 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:15:49,111 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:15:49,111 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:15:49,111 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:15:49,112 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:15:49,112 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:15:49,112 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:15:49,112 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:15:49,112 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:15:49,113 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:15:49,113 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:15:49,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:15:49,114 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:15:49,114 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:15:49,114 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:15:49,114 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:15:49,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:15:49,114 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:15:49,115 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:15:49,416 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:15:49,436 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:15:49,440 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:15:49,441 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:15:49,441 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:15:49,442 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/splice-2.i [2019-11-06 21:15:49,512 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e59ba68e5/eb50f1c9c6d345639aab3341654e51c0/FLAG7ad224b14 [2019-11-06 21:15:50,071 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:15:50,072 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/splice-2.i [2019-11-06 21:15:50,085 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e59ba68e5/eb50f1c9c6d345639aab3341654e51c0/FLAG7ad224b14 [2019-11-06 21:15:50,342 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e59ba68e5/eb50f1c9c6d345639aab3341654e51c0 [2019-11-06 21:15:50,351 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:15:50,352 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:15:50,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:15:50,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:15:50,356 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:15:50,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:15:50" (1/1) ... [2019-11-06 21:15:50,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@382a1c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:50, skipping insertion in model container [2019-11-06 21:15:50,359 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:15:50" (1/1) ... [2019-11-06 21:15:50,365 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:15:50,406 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:15:50,815 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:15:50,837 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:15:50,917 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:15:50,974 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:15:50,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:50 WrapperNode [2019-11-06 21:15:50,975 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:15:50,976 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:15:50,976 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:15:50,976 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:15:50,990 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:50" (1/1) ... [2019-11-06 21:15:50,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:50" (1/1) ... [2019-11-06 21:15:51,014 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:50" (1/1) ... [2019-11-06 21:15:51,015 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:50" (1/1) ... [2019-11-06 21:15:51,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:50" (1/1) ... [2019-11-06 21:15:51,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:50" (1/1) ... [2019-11-06 21:15:51,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:50" (1/1) ... [2019-11-06 21:15:51,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:15:51,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:15:51,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:15:51,053 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:15:51,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:15:51,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:15:51,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:15:51,111 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-06 21:15:51,111 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-06 21:15:51,111 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-06 21:15:51,112 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-06 21:15:51,112 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-06 21:15:51,112 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-06 21:15:51,113 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:15:51,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:15:51,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 21:15:51,113 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-06 21:15:51,113 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-06 21:15:51,113 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-06 21:15:51,114 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-06 21:15:51,114 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-06 21:15:51,114 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-06 21:15:51,114 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-06 21:15:51,114 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-06 21:15:51,115 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-06 21:15:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-06 21:15:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-06 21:15:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-06 21:15:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-06 21:15:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-06 21:15:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-06 21:15:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-06 21:15:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-06 21:15:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-06 21:15:51,119 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-06 21:15:51,119 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-06 21:15:51,119 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-06 21:15:51,119 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-06 21:15:51,119 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-06 21:15:51,119 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-06 21:15:51,119 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-06 21:15:51,119 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-06 21:15:51,119 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-06 21:15:51,119 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-06 21:15:51,120 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-06 21:15:51,122 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-06 21:15:51,122 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-06 21:15:51,123 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-06 21:15:51,123 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-06 21:15:51,123 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-06 21:15:51,123 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-06 21:15:51,123 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-06 21:15:51,123 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-06 21:15:51,123 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-06 21:15:51,124 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-06 21:15:51,124 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-06 21:15:51,124 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-06 21:15:51,124 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-06 21:15:51,124 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-06 21:15:51,124 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-06 21:15:51,125 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-06 21:15:51,125 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-06 21:15:51,125 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-06 21:15:51,125 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-06 21:15:51,125 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-06 21:15:51,125 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-06 21:15:51,125 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-06 21:15:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-06 21:15:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-06 21:15:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-06 21:15:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-06 21:15:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 21:15:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-06 21:15:51,128 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-06 21:15:51,128 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-06 21:15:51,128 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-06 21:15:51,128 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-06 21:15:51,129 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-06 21:15:51,129 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-06 21:15:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-06 21:15:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-06 21:15:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-06 21:15:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-06 21:15:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 21:15:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-06 21:15:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-06 21:15:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-06 21:15:51,132 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-06 21:15:51,132 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-06 21:15:51,132 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-06 21:15:51,132 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-06 21:15:51,132 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-06 21:15:51,133 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-06 21:15:51,133 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-06 21:15:51,134 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-06 21:15:51,134 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-06 21:15:51,135 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-06 21:15:51,135 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-06 21:15:51,135 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-06 21:15:51,135 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-06 21:15:51,135 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-06 21:15:51,135 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-06 21:15:51,135 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-06 21:15:51,135 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-06 21:15:51,136 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-06 21:15:51,136 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-06 21:15:51,136 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-06 21:15:51,136 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-06 21:15:51,136 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-06 21:15:51,136 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-06 21:15:51,136 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-06 21:15:51,137 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-06 21:15:51,137 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-06 21:15:51,137 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-06 21:15:51,137 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-06 21:15:51,137 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-06 21:15:51,137 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-06 21:15:51,137 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-06 21:15:51,138 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-06 21:15:51,138 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-06 21:15:51,138 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-06 21:15:51,138 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-06 21:15:51,138 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-06 21:15:51,139 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-06 21:15:51,139 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:15:51,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 21:15:51,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 21:15:51,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-06 21:15:51,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-06 21:15:51,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 21:15:51,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:15:51,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:15:51,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 21:15:51,566 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-06 21:15:51,742 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:15:51,742 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-06 21:15:51,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:15:51 BoogieIcfgContainer [2019-11-06 21:15:51,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:15:51,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:15:51,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:15:51,748 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:15:51,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:15:50" (1/3) ... [2019-11-06 21:15:51,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3b2bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:15:51, skipping insertion in model container [2019-11-06 21:15:51,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:50" (2/3) ... [2019-11-06 21:15:51,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3b2bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:15:51, skipping insertion in model container [2019-11-06 21:15:51,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:15:51" (3/3) ... [2019-11-06 21:15:51,752 INFO L109 eAbstractionObserver]: Analyzing ICFG splice-2.i [2019-11-06 21:15:51,762 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:15:51,771 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 21:15:51,784 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 21:15:51,810 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:15:51,810 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:15:51,810 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:15:51,811 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:15:51,811 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:15:51,811 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:15:51,811 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:15:51,811 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:15:51,830 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-11-06 21:15:51,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 21:15:51,837 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:51,838 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:51,840 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:51,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:51,847 INFO L82 PathProgramCache]: Analyzing trace with hash 661731879, now seen corresponding path program 1 times [2019-11-06 21:15:51,854 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:51,855 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511801207] [2019-11-06 21:15:51,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:52,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:52,045 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511801207] [2019-11-06 21:15:52,046 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:15:52,047 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:15:52,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365040207] [2019-11-06 21:15:52,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:15:52,056 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:52,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:15:52,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:15:52,077 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2019-11-06 21:15:52,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:52,244 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2019-11-06 21:15:52,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:15:52,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-06 21:15:52,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:52,259 INFO L225 Difference]: With dead ends: 54 [2019-11-06 21:15:52,260 INFO L226 Difference]: Without dead ends: 27 [2019-11-06 21:15:52,263 INFO L630 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 [2019-11-06 21:15:52,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-06 21:15:52,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-06 21:15:52,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-06 21:15:52,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-11-06 21:15:52,298 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 16 [2019-11-06 21:15:52,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:52,298 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-11-06 21:15:52,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:15:52,299 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2019-11-06 21:15:52,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-06 21:15:52,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:52,300 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:52,300 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:52,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:52,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1973627133, now seen corresponding path program 1 times [2019-11-06 21:15:52,301 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:52,301 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832354491] [2019-11-06 21:15:52,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:52,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:52,448 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832354491] [2019-11-06 21:15:52,448 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:15:52,449 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:15:52,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813065745] [2019-11-06 21:15:52,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:15:52,451 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:52,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:15:52,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:15:52,451 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 5 states. [2019-11-06 21:15:52,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:52,578 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2019-11-06 21:15:52,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:15:52,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-06 21:15:52,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:52,583 INFO L225 Difference]: With dead ends: 44 [2019-11-06 21:15:52,583 INFO L226 Difference]: Without dead ends: 37 [2019-11-06 21:15:52,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:15:52,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-06 21:15:52,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2019-11-06 21:15:52,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-06 21:15:52,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2019-11-06 21:15:52,597 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 18 [2019-11-06 21:15:52,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:52,598 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2019-11-06 21:15:52,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:15:52,599 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2019-11-06 21:15:52,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 21:15:52,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:52,601 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:52,602 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:52,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:52,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1721544590, now seen corresponding path program 1 times [2019-11-06 21:15:52,602 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:52,603 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143608256] [2019-11-06 21:15:52,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:52,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:52,732 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143608256] [2019-11-06 21:15:52,733 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:15:52,733 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:15:52,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224514720] [2019-11-06 21:15:52,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:15:52,734 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:52,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:15:52,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:15:52,734 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 5 states. [2019-11-06 21:15:52,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:52,839 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2019-11-06 21:15:52,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:15:52,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-06 21:15:52,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:52,842 INFO L225 Difference]: With dead ends: 51 [2019-11-06 21:15:52,842 INFO L226 Difference]: Without dead ends: 43 [2019-11-06 21:15:52,843 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:15:52,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-06 21:15:52,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2019-11-06 21:15:52,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-06 21:15:52,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2019-11-06 21:15:52,852 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 20 [2019-11-06 21:15:52,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:52,852 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2019-11-06 21:15:52,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:15:52,852 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2019-11-06 21:15:52,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-06 21:15:52,853 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:52,853 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:52,854 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:52,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:52,854 INFO L82 PathProgramCache]: Analyzing trace with hash -918584693, now seen corresponding path program 1 times [2019-11-06 21:15:52,855 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:52,855 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786627164] [2019-11-06 21:15:52,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:52,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:52,966 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786627164] [2019-11-06 21:15:52,967 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:15:52,967 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 21:15:52,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160489072] [2019-11-06 21:15:52,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 21:15:52,968 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:52,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 21:15:52,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:15:52,969 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand 7 states. [2019-11-06 21:15:53,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:53,176 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2019-11-06 21:15:53,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:15:53,177 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-06 21:15:53,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:53,178 INFO L225 Difference]: With dead ends: 74 [2019-11-06 21:15:53,179 INFO L226 Difference]: Without dead ends: 47 [2019-11-06 21:15:53,179 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:15:53,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-06 21:15:53,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2019-11-06 21:15:53,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-06 21:15:53,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2019-11-06 21:15:53,190 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 21 [2019-11-06 21:15:53,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:53,191 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2019-11-06 21:15:53,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 21:15:53,191 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2019-11-06 21:15:53,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-06 21:15:53,193 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:53,194 INFO L410 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] [2019-11-06 21:15:53,195 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:53,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:53,196 INFO L82 PathProgramCache]: Analyzing trace with hash -743556192, now seen corresponding path program 1 times [2019-11-06 21:15:53,196 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:53,196 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023027685] [2019-11-06 21:15:53,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:53,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:53,544 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023027685] [2019-11-06 21:15:53,544 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061350979] [2019-11-06 21:15:53,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:53,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-06 21:15:53,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:53,760 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:15:53,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:53,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:53,770 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:53,770 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:15:53,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 21:15:53,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:53,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:53,832 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:53,832 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-06 21:15:53,886 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:53,887 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 21:15:53,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:53,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:53,898 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:53,898 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-11-06 21:15:53,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:53,916 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-06 21:15:53,917 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:53,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:53,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:53,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-11-06 21:15:53,951 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-06 21:15:53,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:53,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:53,963 INFO L496 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. [2019-11-06 21:15:53,963 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2019-11-06 21:15:54,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:54,113 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 21:15:54,114 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:54,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:54,125 INFO L496 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. [2019-11-06 21:15:54,125 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:22 [2019-11-06 21:15:54,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-06 21:15:54,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:54,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:54,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:54,204 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-11-06 21:15:54,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:54,210 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:54,210 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 22 [2019-11-06 21:15:54,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118266129] [2019-11-06 21:15:54,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-06 21:15:54,211 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:54,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-06 21:15:54,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-11-06 21:15:54,213 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand 22 states. [2019-11-06 21:15:55,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:55,328 INFO L93 Difference]: Finished difference Result 129 states and 168 transitions. [2019-11-06 21:15:55,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-06 21:15:55,328 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 27 [2019-11-06 21:15:55,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:55,329 INFO L225 Difference]: With dead ends: 129 [2019-11-06 21:15:55,330 INFO L226 Difference]: Without dead ends: 96 [2019-11-06 21:15:55,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=232, Invalid=1250, Unknown=0, NotChecked=0, Total=1482 [2019-11-06 21:15:55,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-06 21:15:55,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 63. [2019-11-06 21:15:55,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-06 21:15:55,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2019-11-06 21:15:55,342 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 27 [2019-11-06 21:15:55,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:55,342 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2019-11-06 21:15:55,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-06 21:15:55,343 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2019-11-06 21:15:55,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-06 21:15:55,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:55,344 INFO L410 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] [2019-11-06 21:15:55,544 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:55,545 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:55,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:55,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1592893925, now seen corresponding path program 1 times [2019-11-06 21:15:55,547 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:55,547 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430176784] [2019-11-06 21:15:55,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:55,820 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:55,820 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430176784] [2019-11-06 21:15:55,820 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436534029] [2019-11-06 21:15:55,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:55,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-06 21:15:55,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:55,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:15:55,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:55,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:55,957 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:15:55,957 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:55,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:55,963 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:55,963 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-11-06 21:15:55,987 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-06 21:15:55,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:55,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:55,999 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-06 21:15:56,000 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:56,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:56,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:56,004 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-11-06 21:15:56,006 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-06 21:15:56,006 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:56,006 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 10 [2019-11-06 21:15:56,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372581425] [2019-11-06 21:15:56,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 21:15:56,007 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:56,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 21:15:56,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:15:56,008 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand 10 states. [2019-11-06 21:15:56,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:56,292 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2019-11-06 21:15:56,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 21:15:56,292 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-11-06 21:15:56,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:56,293 INFO L225 Difference]: With dead ends: 76 [2019-11-06 21:15:56,294 INFO L226 Difference]: Without dead ends: 68 [2019-11-06 21:15:56,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-11-06 21:15:56,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-06 21:15:56,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2019-11-06 21:15:56,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-06 21:15:56,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2019-11-06 21:15:56,304 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 29 [2019-11-06 21:15:56,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:56,304 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2019-11-06 21:15:56,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 21:15:56,304 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2019-11-06 21:15:56,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-06 21:15:56,306 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:56,306 INFO L410 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] [2019-11-06 21:15:56,518 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:56,519 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:56,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:56,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1278392056, now seen corresponding path program 2 times [2019-11-06 21:15:56,520 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:56,520 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704284680] [2019-11-06 21:15:56,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:56,583 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-06 21:15:56,583 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704284680] [2019-11-06 21:15:56,583 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:15:56,584 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 21:15:56,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442358758] [2019-11-06 21:15:56,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 21:15:56,584 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:56,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 21:15:56,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:15:56,585 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 4 states. [2019-11-06 21:15:56,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:56,675 INFO L93 Difference]: Finished difference Result 112 states and 137 transitions. [2019-11-06 21:15:56,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 21:15:56,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-11-06 21:15:56,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:56,677 INFO L225 Difference]: With dead ends: 112 [2019-11-06 21:15:56,677 INFO L226 Difference]: Without dead ends: 70 [2019-11-06 21:15:56,678 INFO L630 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 [2019-11-06 21:15:56,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-06 21:15:56,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2019-11-06 21:15:56,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-06 21:15:56,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2019-11-06 21:15:56,686 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 30 [2019-11-06 21:15:56,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:56,686 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2019-11-06 21:15:56,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 21:15:56,686 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2019-11-06 21:15:56,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-06 21:15:56,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:56,688 INFO L410 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] [2019-11-06 21:15:56,688 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:56,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:56,688 INFO L82 PathProgramCache]: Analyzing trace with hash 496615306, now seen corresponding path program 1 times [2019-11-06 21:15:56,688 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:56,689 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651586533] [2019-11-06 21:15:56,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:57,049 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:57,049 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651586533] [2019-11-06 21:15:57,050 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493796961] [2019-11-06 21:15:57,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:57,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-06 21:15:57,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:57,185 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:15:57,185 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:57,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:57,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:57,187 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-06 21:15:57,240 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:57,240 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 21:15:57,241 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:57,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:57,246 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:57,247 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-06 21:15:57,279 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:15:57,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:57,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:57,301 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:15:57,304 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:57,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:57,315 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:57,315 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-11-06 21:15:57,357 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_22|], 2=[|v_#memory_$Pointer$.offset_20|, |v_#memory_$Pointer$.base_21|]} [2019-11-06 21:15:57,361 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2019-11-06 21:15:57,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:57,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:57,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 82 [2019-11-06 21:15:57,380 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:57,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:57,409 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:57,409 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 105 [2019-11-06 21:15:57,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:57,413 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:57,425 INFO L567 ElimStorePlain]: treesize reduction 48, result has 38.5 percent of original size [2019-11-06 21:15:57,426 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:57,426 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-11-06 21:15:57,493 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2019-11-06 21:15:57,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:57,508 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:57,510 INFO L375 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 [2019-11-06 21:15:57,511 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:57,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:57,516 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:57,516 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:12 [2019-11-06 21:15:57,549 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-06 21:15:57,550 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:57,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:57,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:57,555 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:7 [2019-11-06 21:15:57,581 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-06 21:15:57,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:57,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:57,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:57,583 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-06 21:15:57,607 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:57,608 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:57,608 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2019-11-06 21:15:57,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096677846] [2019-11-06 21:15:57,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-06 21:15:57,609 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:57,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-06 21:15:57,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2019-11-06 21:15:57,610 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand 25 states. [2019-11-06 21:15:58,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:58,896 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2019-11-06 21:15:58,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-06 21:15:58,896 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 30 [2019-11-06 21:15:58,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:58,898 INFO L225 Difference]: With dead ends: 85 [2019-11-06 21:15:58,898 INFO L226 Difference]: Without dead ends: 64 [2019-11-06 21:15:58,900 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=187, Invalid=1373, Unknown=0, NotChecked=0, Total=1560 [2019-11-06 21:15:58,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-06 21:15:58,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2019-11-06 21:15:58,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-06 21:15:58,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2019-11-06 21:15:58,907 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 30 [2019-11-06 21:15:58,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:58,907 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2019-11-06 21:15:58,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-06 21:15:58,907 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2019-11-06 21:15:58,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-06 21:15:58,908 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:58,908 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:59,117 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:59,118 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:59,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:59,118 INFO L82 PathProgramCache]: Analyzing trace with hash 748997879, now seen corresponding path program 1 times [2019-11-06 21:15:59,118 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:59,118 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961476041] [2019-11-06 21:15:59,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:59,453 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:59,454 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961476041] [2019-11-06 21:15:59,454 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021871036] [2019-11-06 21:15:59,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:59,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-06 21:15:59,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:59,592 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:15:59,592 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:59,601 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:59,601 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:59,601 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:15:59,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 21:15:59,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:59,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:59,677 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:59,678 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-06 21:15:59,717 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:59,718 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 21:15:59,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:59,729 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:59,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:59,730 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-11-06 21:15:59,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:59,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-06 21:15:59,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:59,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:59,753 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:59,753 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-11-06 21:15:59,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:59,794 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-06 21:15:59,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:59,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:59,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:59,804 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:22 [2019-11-06 21:15:59,903 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-06 21:15:59,903 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 21:15:59,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:59,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:59,919 INFO L496 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. [2019-11-06 21:15:59,919 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-11-06 21:15:59,992 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:59,993 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 68 [2019-11-06 21:15:59,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:00,041 INFO L567 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2019-11-06 21:16:00,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:00,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:00,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:00,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-06 21:16:00,045 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:41 [2019-11-06 21:16:00,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:00,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:00,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:00,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:00,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:00,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:00,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:00,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:16:00,391 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 21:16:00,392 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:00,406 INFO L567 ElimStorePlain]: treesize reduction 4, result has 81.8 percent of original size [2019-11-06 21:16:00,407 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:16:00,407 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:18 [2019-11-06 21:16:00,488 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:00,488 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2019-11-06 21:16:00,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:00,503 INFO L567 ElimStorePlain]: treesize reduction 4, result has 66.7 percent of original size [2019-11-06 21:16:00,504 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:00,504 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-06 21:16:00,509 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:16:00,510 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:16:00,510 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 29 [2019-11-06 21:16:00,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823396570] [2019-11-06 21:16:00,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-06 21:16:00,511 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:16:00,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-06 21:16:00,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2019-11-06 21:16:00,512 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 29 states. [2019-11-06 21:16:02,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:16:02,697 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2019-11-06 21:16:02,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-06 21:16:02,698 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 33 [2019-11-06 21:16:02,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:16:02,699 INFO L225 Difference]: With dead ends: 102 [2019-11-06 21:16:02,699 INFO L226 Difference]: Without dead ends: 94 [2019-11-06 21:16:02,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 896 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=434, Invalid=2872, Unknown=0, NotChecked=0, Total=3306 [2019-11-06 21:16:02,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-06 21:16:02,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 71. [2019-11-06 21:16:02,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-06 21:16:02,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2019-11-06 21:16:02,718 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 33 [2019-11-06 21:16:02,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:16:02,719 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2019-11-06 21:16:02,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-06 21:16:02,719 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2019-11-06 21:16:02,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-06 21:16:02,720 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:16:02,720 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:16:02,925 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:16:02,926 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:16:02,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:16:02,926 INFO L82 PathProgramCache]: Analyzing trace with hash -621471021, now seen corresponding path program 1 times [2019-11-06 21:16:02,927 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:16:02,927 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979172453] [2019-11-06 21:16:02,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:16:02,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:03,375 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:16:03,375 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979172453] [2019-11-06 21:16:03,375 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150805744] [2019-11-06 21:16:03,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:16:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:03,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 58 conjunts are in the unsatisfiable core [2019-11-06 21:16:03,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:16:03,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:16:03,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:03,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:03,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:03,511 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:16:03,561 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 21:16:03,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:03,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:03,572 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:03,572 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-06 21:16:03,642 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:03,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-06 21:16:03,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:03,676 INFO L567 ElimStorePlain]: treesize reduction 14, result has 68.9 percent of original size [2019-11-06 21:16:03,676 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:03,676 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:31 [2019-11-06 21:16:03,725 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_23|], 2=[|v_#memory_int_31|]} [2019-11-06 21:16:03,730 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:16:03,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:03,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:03,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:16:03,752 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 [2019-11-06 21:16:03,753 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:03,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:03,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:03,772 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:46 [2019-11-06 21:16:03,842 INFO L341 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-11-06 21:16:03,842 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 32 [2019-11-06 21:16:03,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:03,873 INFO L567 ElimStorePlain]: treesize reduction 10, result has 81.8 percent of original size [2019-11-06 21:16:03,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-06 21:16:03,879 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:03,895 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:03,896 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:03,896 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:41 [2019-11-06 21:16:03,950 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:03,951 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-06 21:16:03,952 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:03,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:03,967 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:03,967 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:39 [2019-11-06 21:16:04,025 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_25|], 6=[|v_#memory_int_33|]} [2019-11-06 21:16:04,050 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:04,051 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 99 [2019-11-06 21:16:04,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:04,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:04,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-06 21:16:04,120 INFO L567 ElimStorePlain]: treesize reduction 110, result has 51.3 percent of original size [2019-11-06 21:16:04,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:16:04,129 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 77 [2019-11-06 21:16:04,129 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:04,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:04,148 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:16:04,148 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:125, output treesize:87 [2019-11-06 21:16:04,268 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:04,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 150 [2019-11-06 21:16:04,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:04,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:04,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:04,331 INFO L567 ElimStorePlain]: treesize reduction 148, result has 42.0 percent of original size [2019-11-06 21:16:04,336 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 46 [2019-11-06 21:16:04,337 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:04,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:04,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:16:04,359 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:158, output treesize:91 [2019-11-06 21:16:04,478 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:16:04,487 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:04,488 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 49 [2019-11-06 21:16:04,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:04,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:04,490 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:16:04,521 INFO L567 ElimStorePlain]: treesize reduction 16, result has 69.8 percent of original size [2019-11-06 21:16:04,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-06 21:16:04,523 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:88, output treesize:37 [2019-11-06 21:16:04,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:16:04,591 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2019-11-06 21:16:04,592 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:04,604 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:04,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-06 21:16:04,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:37 [2019-11-06 21:16:04,717 INFO L341 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2019-11-06 21:16:04,718 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 37 [2019-11-06 21:16:04,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:04,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:04,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:04,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-06 21:16:04,739 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:51 [2019-11-06 21:16:04,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-06 21:16:04,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:04,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:04,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:04,854 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-11-06 21:16:04,863 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:16:04,863 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:16:04,863 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2019-11-06 21:16:04,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450420038] [2019-11-06 21:16:04,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-06 21:16:04,864 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:16:04,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-06 21:16:04,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1001, Unknown=0, NotChecked=0, Total=1122 [2019-11-06 21:16:04,865 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand 34 states. [2019-11-06 21:16:07,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:16:07,441 INFO L93 Difference]: Finished difference Result 124 states and 144 transitions. [2019-11-06 21:16:07,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-06 21:16:07,442 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 36 [2019-11-06 21:16:07,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:16:07,444 INFO L225 Difference]: With dead ends: 124 [2019-11-06 21:16:07,444 INFO L226 Difference]: Without dead ends: 122 [2019-11-06 21:16:07,445 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1017 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=454, Invalid=3578, Unknown=0, NotChecked=0, Total=4032 [2019-11-06 21:16:07,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-06 21:16:07,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 77. [2019-11-06 21:16:07,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-06 21:16:07,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2019-11-06 21:16:07,454 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 36 [2019-11-06 21:16:07,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:16:07,454 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2019-11-06 21:16:07,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-06 21:16:07,455 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2019-11-06 21:16:07,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-06 21:16:07,456 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:16:07,456 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:16:07,659 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:16:07,660 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:16:07,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:16:07,661 INFO L82 PathProgramCache]: Analyzing trace with hash -234871608, now seen corresponding path program 1 times [2019-11-06 21:16:07,661 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:16:07,661 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042224210] [2019-11-06 21:16:07,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:16:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:07,759 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-06 21:16:07,759 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042224210] [2019-11-06 21:16:07,759 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878093918] [2019-11-06 21:16:07,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:16:07,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:07,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-06 21:16:07,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:16:07,906 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-06 21:16:07,907 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:16:07,907 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-06 21:16:07,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499965397] [2019-11-06 21:16:07,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 21:16:07,908 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:16:07,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 21:16:07,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:16:07,908 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand 8 states. [2019-11-06 21:16:08,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:16:08,105 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2019-11-06 21:16:08,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 21:16:08,106 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2019-11-06 21:16:08,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:16:08,107 INFO L225 Difference]: With dead ends: 100 [2019-11-06 21:16:08,107 INFO L226 Difference]: Without dead ends: 95 [2019-11-06 21:16:08,107 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-11-06 21:16:08,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-06 21:16:08,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 82. [2019-11-06 21:16:08,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-06 21:16:08,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2019-11-06 21:16:08,129 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 38 [2019-11-06 21:16:08,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:16:08,129 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2019-11-06 21:16:08,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 21:16:08,130 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2019-11-06 21:16:08,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-06 21:16:08,131 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:16:08,131 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:16:08,332 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:16:08,332 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:16:08,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:16:08,332 INFO L82 PathProgramCache]: Analyzing trace with hash -233161586, now seen corresponding path program 1 times [2019-11-06 21:16:08,333 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:16:08,333 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251745404] [2019-11-06 21:16:08,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:16:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:08,651 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-06 21:16:08,652 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251745404] [2019-11-06 21:16:08,652 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245643776] [2019-11-06 21:16:08,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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 [2019-11-06 21:16:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:08,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-06 21:16:08,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:16:08,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:16:08,780 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:08,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:08,793 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:16:08,794 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:08,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:08,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:08,803 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2019-11-06 21:16:08,842 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:08,842 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 48 [2019-11-06 21:16:08,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:08,877 INFO L567 ElimStorePlain]: treesize reduction 28, result has 58.8 percent of original size [2019-11-06 21:16:08,900 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:08,901 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 48 [2019-11-06 21:16:08,902 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:08,931 INFO L567 ElimStorePlain]: treesize reduction 28, result has 56.3 percent of original size [2019-11-06 21:16:08,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:16:08,933 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:36 [2019-11-06 21:16:08,961 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-06 21:16:08,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:08,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:08,970 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-06 21:16:08,971 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:08,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:08,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:08,975 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-11-06 21:16:08,979 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-06 21:16:08,980 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:16:08,980 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 12 [2019-11-06 21:16:08,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104461599] [2019-11-06 21:16:08,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-06 21:16:08,981 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:16:08,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-06 21:16:08,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-11-06 21:16:08,981 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 12 states. [2019-11-06 21:16:09,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:16:09,366 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2019-11-06 21:16:09,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 21:16:09,366 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-11-06 21:16:09,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:16:09,367 INFO L225 Difference]: With dead ends: 101 [2019-11-06 21:16:09,368 INFO L226 Difference]: Without dead ends: 94 [2019-11-06 21:16:09,368 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2019-11-06 21:16:09,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-06 21:16:09,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2019-11-06 21:16:09,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-06 21:16:09,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2019-11-06 21:16:09,377 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 38 [2019-11-06 21:16:09,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:16:09,377 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2019-11-06 21:16:09,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-06 21:16:09,378 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2019-11-06 21:16:09,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-06 21:16:09,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:16:09,379 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:16:09,583 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:16:09,583 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:16:09,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:16:09,583 INFO L82 PathProgramCache]: Analyzing trace with hash -2076362507, now seen corresponding path program 2 times [2019-11-06 21:16:09,583 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:16:09,583 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076875817] [2019-11-06 21:16:09,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:16:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:10,311 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:16:10,312 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076875817] [2019-11-06 21:16:10,312 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202298478] [2019-11-06 21:16:10,312 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-11-06 21:16:10,428 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 21:16:10,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:16:10,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 69 conjunts are in the unsatisfiable core [2019-11-06 21:16:10,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:16:10,441 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:16:10,441 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:10,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:10,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:10,445 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:16:10,513 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:10,513 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-06 21:16:10,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:10,538 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-06 21:16:10,539 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:10,539 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-06 21:16:10,578 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:16:10,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:10,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:10,596 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:16:10,597 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:10,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:10,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:10,610 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:48 [2019-11-06 21:16:10,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:16:10,659 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-06 21:16:10,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:10,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:10,692 INFO L341 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-11-06 21:16:10,693 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 32 [2019-11-06 21:16:10,693 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:10,725 INFO L567 ElimStorePlain]: treesize reduction 10, result has 78.3 percent of original size [2019-11-06 21:16:10,725 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:10,726 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:36 [2019-11-06 21:16:10,766 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:10,767 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-11-06 21:16:10,767 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:10,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:10,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:10,781 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:49 [2019-11-06 21:16:10,825 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 83 [2019-11-06 21:16:10,826 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:10,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:10,867 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:10,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 127 [2019-11-06 21:16:10,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:10,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:10,871 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-06 21:16:10,932 INFO L567 ElimStorePlain]: treesize reduction 120, result has 48.5 percent of original size [2019-11-06 21:16:10,933 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:10,933 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:132, output treesize:127 [2019-11-06 21:16:10,994 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_37|], 6=[|v_#memory_$Pointer$.offset_27|, |v_#memory_$Pointer$.base_32|]} [2019-11-06 21:16:11,004 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 43 [2019-11-06 21:16:11,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:11,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:11,069 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:11,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 325 treesize of output 284 [2019-11-06 21:16:11,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:11,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:11,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:11,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:11,079 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-06 21:16:11,158 INFO L567 ElimStorePlain]: treesize reduction 688, result has 21.4 percent of original size [2019-11-06 21:16:11,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:16:11,193 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:11,193 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 176 treesize of output 150 [2019-11-06 21:16:11,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:11,195 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:11,231 INFO L567 ElimStorePlain]: treesize reduction 136, result has 46.2 percent of original size [2019-11-06 21:16:11,231 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:11,231 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:367, output treesize:117 [2019-11-06 21:16:11,403 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_int_38|], 6=[|v_#memory_$Pointer$.offset_28|, |v_#memory_$Pointer$.base_33|]} [2019-11-06 21:16:11,454 INFO L341 Elim1Store]: treesize reduction 78, result has 49.0 percent of original size [2019-11-06 21:16:11,455 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 82 [2019-11-06 21:16:11,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:11,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:11,457 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:11,538 INFO L567 ElimStorePlain]: treesize reduction 18, result has 88.7 percent of original size [2019-11-06 21:16:11,553 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:11,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 108 [2019-11-06 21:16:11,555 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:11,639 INFO L567 ElimStorePlain]: treesize reduction 14, result has 90.1 percent of original size [2019-11-06 21:16:11,687 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:11,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 128 [2019-11-06 21:16:11,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:11,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:11,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:11,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:11,693 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:16:11,785 INFO L567 ElimStorePlain]: treesize reduction 62, result has 60.8 percent of original size [2019-11-06 21:16:11,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:11,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:11,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:11,789 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-06 21:16:11,790 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:136, output treesize:153 [2019-11-06 21:16:12,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:12,057 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 52 [2019-11-06 21:16:12,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:12,062 INFO L375 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 73 treesize of output 49 [2019-11-06 21:16:12,063 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:12,123 INFO L567 ElimStorePlain]: treesize reduction 4, result has 95.7 percent of original size [2019-11-06 21:16:12,128 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 42 treesize of output 30 [2019-11-06 21:16:12,128 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:12,133 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 31 [2019-11-06 21:16:12,134 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:12,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:12,177 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-06 21:16:12,177 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:170, output treesize:43 [2019-11-06 21:16:12,210 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-06 21:16:12,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:12,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:12,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:12,218 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:11 [2019-11-06 21:16:12,222 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-06 21:16:12,222 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:12,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:12,224 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:12,224 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:3 [2019-11-06 21:16:12,255 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:16:12,255 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:16:12,256 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 29 [2019-11-06 21:16:12,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020899245] [2019-11-06 21:16:12,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-06 21:16:12,256 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:16:12,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-06 21:16:12,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2019-11-06 21:16:12,257 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand 29 states. [2019-11-06 21:16:13,452 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 62 [2019-11-06 21:16:29,636 WARN L191 SmtUtils]: Spent 16.09 s on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2019-11-06 21:16:30,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:16:30,140 INFO L93 Difference]: Finished difference Result 119 states and 138 transitions. [2019-11-06 21:16:30,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-06 21:16:30,140 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 39 [2019-11-06 21:16:30,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:16:30,141 INFO L225 Difference]: With dead ends: 119 [2019-11-06 21:16:30,141 INFO L226 Difference]: Without dead ends: 105 [2019-11-06 21:16:30,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=186, Invalid=1536, Unknown=0, NotChecked=0, Total=1722 [2019-11-06 21:16:30,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-06 21:16:30,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 94. [2019-11-06 21:16:30,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-06 21:16:30,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2019-11-06 21:16:30,148 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 39 [2019-11-06 21:16:30,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:16:30,148 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2019-11-06 21:16:30,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-06 21:16:30,149 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2019-11-06 21:16:30,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-06 21:16:30,149 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:16:30,150 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:16:30,350 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:16:30,351 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:16:30,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:16:30,351 INFO L82 PathProgramCache]: Analyzing trace with hash -731659325, now seen corresponding path program 1 times [2019-11-06 21:16:30,352 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:16:30,352 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634039227] [2019-11-06 21:16:30,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:16:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:30,891 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:16:30,891 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634039227] [2019-11-06 21:16:30,891 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919879915] [2019-11-06 21:16:30,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:16:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:31,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 74 conjunts are in the unsatisfiable core [2019-11-06 21:16:31,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:16:31,065 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:16:31,066 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:31,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:31,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:31,073 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:16:31,165 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:31,166 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-06 21:16:31,166 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:31,198 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-06 21:16:31,199 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:31,199 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-06 21:16:31,242 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:16:31,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:31,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:31,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:16:31,266 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:31,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:31,282 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:31,282 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:57 [2019-11-06 21:16:31,332 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_40|], 2=[|v_#memory_$Pointer$.base_35|, |v_#memory_$Pointer$.offset_30|]} [2019-11-06 21:16:31,337 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 21:16:31,338 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:31,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:31,369 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:16:31,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 22 [2019-11-06 21:16:31,370 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:31,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:31,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:16:31,396 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2019-11-06 21:16:31,396 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:31,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:31,412 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:31,412 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:98, output treesize:58 [2019-11-06 21:16:31,470 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:31,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-11-06 21:16:31,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:31,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:31,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:31,488 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:56 [2019-11-06 21:16:31,543 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:16:31,554 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:31,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 132 [2019-11-06 21:16:31,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:31,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:31,619 INFO L567 ElimStorePlain]: treesize reduction 30, result has 84.8 percent of original size [2019-11-06 21:16:31,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:16:31,626 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 23 [2019-11-06 21:16:31,627 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:31,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:31,674 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:31,674 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 116 [2019-11-06 21:16:31,675 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:31,721 INFO L567 ElimStorePlain]: treesize reduction 42, result has 65.3 percent of original size [2019-11-06 21:16:31,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:31,722 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:188, output treesize:73 [2019-11-06 21:16:31,789 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_32|, |v_#memory_int_42|], 6=[|v_#memory_$Pointer$.base_37|]} [2019-11-06 21:16:31,795 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 13 [2019-11-06 21:16:31,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:31,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:31,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2019-11-06 21:16:31,821 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:31,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:31,841 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:16:31,880 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:31,880 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 126 [2019-11-06 21:16:31,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:31,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:31,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:31,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:31,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:31,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:31,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:31,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:31,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:31,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:31,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:31,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:31,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:31,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:31,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:31,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:31,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:31,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:31,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:31,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:31,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:31,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:31,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:31,895 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 7 xjuncts. [2019-11-06 21:16:31,969 INFO L567 ElimStorePlain]: treesize reduction 781, result has 9.1 percent of original size [2019-11-06 21:16:31,970 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:16:31,970 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:181, output treesize:77 [2019-11-06 21:16:32,065 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 5=[|#memory_$Pointer$.base|]} [2019-11-06 21:16:32,068 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:16:32,069 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2019-11-06 21:16:32,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:32,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:32,097 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:16:32,110 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-11-06 21:16:32,110 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 40 [2019-11-06 21:16:32,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:32,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:32,113 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:16:32,141 INFO L567 ElimStorePlain]: treesize reduction 4, result has 89.2 percent of original size [2019-11-06 21:16:32,141 INFO L496 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. [2019-11-06 21:16:32,142 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:83, output treesize:33 [2019-11-06 21:16:32,194 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 21:16:32,195 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:32,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:32,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:16:32,208 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:25 [2019-11-06 21:16:32,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:16:32,297 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 21:16:32,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:32,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:32,309 INFO L496 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. [2019-11-06 21:16:32,309 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-11-06 21:16:32,443 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-06 21:16:32,444 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:32,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:32,449 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:32,449 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-11-06 21:16:32,458 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:16:32,459 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:16:32,459 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2019-11-06 21:16:32,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410221141] [2019-11-06 21:16:32,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-06 21:16:32,459 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:16:32,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-06 21:16:32,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1008, Unknown=0, NotChecked=0, Total=1122 [2019-11-06 21:16:32,460 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand 34 states. [2019-11-06 21:16:34,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:16:34,243 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2019-11-06 21:16:34,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-06 21:16:34,244 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 40 [2019-11-06 21:16:34,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:16:34,245 INFO L225 Difference]: With dead ends: 118 [2019-11-06 21:16:34,245 INFO L226 Difference]: Without dead ends: 116 [2019-11-06 21:16:34,246 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=266, Invalid=2086, Unknown=0, NotChecked=0, Total=2352 [2019-11-06 21:16:34,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-06 21:16:34,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2019-11-06 21:16:34,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-06 21:16:34,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2019-11-06 21:16:34,257 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 40 [2019-11-06 21:16:34,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:16:34,257 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2019-11-06 21:16:34,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-06 21:16:34,258 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2019-11-06 21:16:34,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-06 21:16:34,261 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:16:34,261 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:16:34,466 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:16:34,467 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:16:34,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:16:34,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1250078526, now seen corresponding path program 1 times [2019-11-06 21:16:34,468 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:16:34,468 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894065360] [2019-11-06 21:16:34,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:16:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:34,923 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:16:34,923 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894065360] [2019-11-06 21:16:34,923 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073657954] [2019-11-06 21:16:34,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:16:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:35,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-06 21:16:35,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:16:35,089 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:16:35,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:35,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:35,098 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:16:35,099 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:35,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:35,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:35,104 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2019-11-06 21:16:35,134 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-06 21:16:35,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:35,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:35,145 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-06 21:16:35,145 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:35,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:35,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:35,152 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2019-11-06 21:16:35,155 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-06 21:16:35,155 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:16:35,155 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 6] total 21 [2019-11-06 21:16:35,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101818155] [2019-11-06 21:16:35,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-06 21:16:35,156 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:16:35,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-06 21:16:35,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420